Abstract
This contribution proposes a new perturbation technique for the iterated local search metaheuristic, which consists in a micro evolutionary algorithm that effectively explores the neighborhood of the solution that should undergo the perturbation operator. Its main idea is to play the same role as the standard ILS-perturbation operator, but more satisfactorily. A new model of integrative hybrid metaheuristic is obtained by incorporating the proposed perturbation approach into the iterated local search algorithm, because the evolutionary algorithm becomes a subordinate component of iterated local search. The benefits of the proposal in comparison to other iterated local search algorithms proposed in the literature to deal with binary optimization problems are experimentally shown.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)
Eshelman, L.J.: The CHC adaptive search algorithm: how to have safe search when engaging in non-traditional genetic recombination. In: Rawlins, G. (ed.) Foundations of Genetic Algorithms 1, pp. 265–283. Morgan Kaufmann, California (1991)
Forrest, S., Mitchell, M.: Relative building block fitness and the building block hypothesis. In: Whitley, L.D. (ed.) Foundations of Genetic Algorithms 2, pp. 109–126. Morgan Kaufmann, California (1993)
García-Martínez, C., Lozano, M., Herrera, F., Molina, D., Sánchez, A.M.: Global and local real-coded genetic algorithms based on parent-centric crossover operators. Eur. J. Oper. Res. 185, 1088–1113 (2008)
Glover, F., Kochenberger, G. (eds.): Handbook of metaheuristics. Kluwer Academic Publishers, Massachusetts (2003)
Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: motivation, analysis, and first results. Complex Syst. 3, 493–530 (1989)
Goldberg, D.E., Deb, K., Horn, J.: Massively multimodality, deception, and genetic algorithms. In: Männer, R., Manderick, B. (eds.) Proc. of the Int. Conf. on Parallel Problem Solving from Nature, pp. 37–46. North-Holland Pub. Co., Amsterdam (1992)
Heitktter, J.: SAC-94 Suite of 0/1-multiple-knapsack problem instances (2001), http://elib.zib.de/pub/Packages/mp-testdata/ip/sac94-suite
Hoos, H.H., Stützle, T.: Stochastic local search:–foundations and applications. Morgan Kaufmann Publishers, California (2004)
Hu, J., Goodman, E., Seo, K., Fan, Z., Rosenberg, R.: The hierarchical fair competition (HFC) framework for sustainable evolutionary algorithms. Evol. Comput. 13(2), 241–277 (2005)
Katayama, K., Narihisa, H.: Iterated local search approach using genetic transformation to the travelling salesman problem. In: Banzhaf, W., Daida, J., Eiben, A.E., Garzon, M.H., Honovar, V., Jakiela, M., Smith, R.E. (eds.) Proc. of the Genetic and Evolutionary Computation Conf., pp. 321–328. Morgan Kaufmann, California (1999)
Katayama, K., Narihisa, H.: A new iterated local search algorithm using genetic crossover for the travelling salesman problem. In: Proc. of the ACM Symposium on Applied Computing, pp. 302–306 (1999)
Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321–353. Kluwer Academic Publishers, Massachusetts (2003)
Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: Linkage problem, distribution estimation, and bayesian networks. Evolutionary Comput. 8(3), 311–340 (2000)
Pelikan, M., Hartmann, A., Lin, T.K.: Parameter-less hierarchical bayesian optimization algorithm. In: Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.) Parameter Setting in Evolutionary Algorithms. SCI, vol. 54, pp. 225–239. Springer, Berlin (2007)
Raidl, G.R.: A unified view on hybrid metaheuristics. In: Almeida, F., Blesa Aguilera, M.J., Blum, C., Moreno Vega, J.M., Pérez Pérez, M., Roli, A., Sampels, M. (eds.) HM 2006. LNCS, vol. 4030, pp. 1–12. Springer, Heidelberg (2006)
Sheskin, D.J.: Handbook of parametric and nonparametric statistical procedures. CRC Press, Boca Raton (2003)
Stützle, T.: Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res. 174, 1519–1539 (2006)
Talbi, E.-G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8(5), 541–565 (2002)
Thierens, D.: Adaptive mutation rate control schemes in genetic algorithms. In: Proc. of the Congress on Evolutionary Computation, pp. 980–985. IEEE Press, Los Alamitos (2002)
Thierens, D.: Population-based iterated local search: restricting neighborhood search by crossover. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 234–245. Springer, Heidelberg (2004)
Zar, J.H.: Biostatistical analysis. Prentice-Hall, Englewood Cliffs (1999)
Zhang, Q., Sun, J., Tsang, E.P.K.: Evolutionary algorithm with the guided mutation for the maximum clique problem. IEEE Trans. Evol. Comput. 9(2), 192–200 (2005)
Zhang, Q., Sun, J.: Iterated local search with guided mutation. In: IEEE Congress on Evolutionary Computation, pp. 924–929. IEEE Press, Los Alamitos (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lozano, M., García-Martínez, C. (2008). An Evolutionary ILS-Perturbation Technique. In: Blesa, M.J., et al. Hybrid Metaheuristics. HM 2008. Lecture Notes in Computer Science, vol 5296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88439-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-88439-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88438-5
Online ISBN: 978-3-540-88439-2
eBook Packages: Computer ScienceComputer Science (R0)