Intensification, learning and diversification in a hybrid metaheuristic: an efficient unification
- 170 Downloads
Hybrid heuristic methods have lately been pointed out as an efficient approach to combinatorial optimization problems. The main reason behind this is that, by combining components from different metaheuristics, it is possible to explore solutions (which would be unreachable without hybridization) in the search space. In particular, evolutionary algorithms may get trapped into local optimum solutions due to the insufficient diversity of the solutions influencing the search process. This paper presents a hybridization of the recently proposed metaheuristic—intelligent-guided adaptive search (IGAS)—with the well-known path-relinking algorithm to solve large scale instances of the maximum covering location problem. Moreover, it proposes a slight change in IGAS that was tested through computational experiments and has shown improvement in its computational cost. Computational experiments also attested that the hybridized IGAS outperforms the results found in the literature.
KeywordsIntelligent-guided adaptive search Path-relinking Maximum covering location problem Large scale
The authors are grateful to Fundação de Amparo á Pesquisa do Estado de São Paulo (FAPESP) (Grant No. 15/21660-4) and Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) (Grant No. 308708/2015-6, 448614/2014-6) for their financial support. Research carried out using the computational resources of the Center for Mathematical Sciences Applied to Industry (CeMEAI) funded by FAPESP (Grant No. 2013/07375-0).
- CPLEX: IBM ILOG CPLEX Optimization Studio CPLEX User’s Manual Version 12 Release 6, IBM (2014)Google Scholar
- Fritzke, B.: A growing neural gas network learns topologies. In: Tesauro, G., Touretzky, D.S., Leen, T.K. (eds.): Advances in Neural Information Processing Systems 7, pp. 625–632. MIT Press, Cambridge (1995)Google Scholar
- Glover, F.: Tabu search and adaptive memory programing—advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer, Dordrecht (1996)Google Scholar
- Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) Artificial Evolution, Volume 1363 of Lecture Notes in Computer Science, pp. 1–51. Springer, Berlin (1998)Google Scholar
- Glover, F.: Scatter search and path relinking. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 297–316. McGraw Hill (1999)Google Scholar
- Lorena, L.A.N., Pereira, M.A.: A Lagrangean/surrogate heuristic for the maximal covering location problem using Hillman’s edition. Int. J. Ind. Eng. 9, 57–67 (2002)Google Scholar
- Martinetz, T.: Competitive Hebbian learning rule forms perfectly topology preserving maps. In: Gielen, S., Kappen, B. (eds.) Proceedings of the International Conference on Artificial Neural Networks (ICANN-93), pp. 427–434. Springer, Amsterdam (1993)Google Scholar
- Martinetz, T., Schulten, K.: A “neural-gas” network learns topologies. In: Kohonen, T., Makisara, K., Simula, O., Kangas, J. (eds.) Artificial Neural Networks, pp. 397–402. Elsevier Science Publishers B. V., North-Holland (1991)Google Scholar
- Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, Volume 32 of Operations Research/Computer Science Interfaces Series, pp. 29–63. Springer, New York (2005)CrossRefGoogle Scholar