Abstract
Many problems in AI can be stated as search problems and most of them are very complex to solve. One alternative for these problems are local search methods that have been widely used for tackling difficult optimization problems for which we do not know algorithms which can solve every instance to optimality in a reasonable amount of time. One of the most popular methods is what is known as iterated local search (ILS), which samples the set of local optima searching for a better solution. This algorithm’s behavior is achieved by some mechanisms like perturbation which is a key aspect to consider, since it allows the algorithm to reach a new solution from the set of local optima by escaping from the previous local optimum basis of attraction. In order to design a good perturbation method we need to analyze the local optima structure such that ILS leads to a good biased sampling. In this paper, the local optima structure of the Quadratic Assignment Problem, an NP-hard optimization problem, is used to determine the required perturbation size in the ILS algorithm. The analysis is focused on verifying if the set of local optima has the “Big Valley (BV)” structure, and on how close local optima are in relation to problem size. Experimental results show that a small perturbation seems appropriate for instances having the BV structure, and for instances having a low distance among local optima, even if they do not have a clear BV structure. Finally, as the local optima structure moves away from BV a larger perturbation is needed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E.H.L., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Wiley, Chichester (1997)
Boese, K.D.: Models for Iterative Global Optimization. PhD thesis, University of California at Los Angeles, Los Angeles, CA (1996)
Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimization. Operations Research Letters 16, 101–113 (1994)
Dimitriou, T., Impagliazzo, R.: Towards a rigorous analysis of local optimization algorithms. In: 25th ACM Symposium on the Theory of Computing (1996)
Du, D., Pardalos, P.M. (eds.): Handbook of Combinatorial Optimization. Kluwer Academic Publishers, London (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco (1979)
Hoel, P.G. (ed.): Introduction to Mathematical Statistics. John Wiley & Sons, New York (1962)
Hu, T.C., Klee, V., Larman, D.: Optimization of globally convex functions. SIAM Journal on Control and Optimization 27(5), 1026–1047 (1989)
Johnson, D.S., McGeoch, L.A.: The travelling salesman problem: A case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215–310. Wiley, Chichester (1997)
Jones, T.: Evolutionary Algorithms, Fitness Landscape and Search. PhD thesis, The University of New Mexico, Albuquerque, New Mexico (1995)
Lourenco, H.R., Martin, O.C., Stutzle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, Kluwer, Dordrecht (2002)
Manderick, B., De Weger, M., Spiessens, P.: The genetic algorithm and the structure of the fitness landscape. In: Belew, R.K. (ed.) Fourth International Conference on Genetic Algorithms, pp. 143–150. Morgan Kaufmann, San Mateo (1991)
Martin, O., Otto, S.W., Felten, E.W.: Large-step markov chains for the traveling salesman problem. Complex Systems 5(3), 299–326 (1991)
Mattfeld, D.C., Bierwirth, C.: A search space analysis of the job shop scheduling problem. Annals of Operational Research 86, 441–453 (1999)
Reeves, C.R.: Landscapes, operators and heuristic search. Annals of Operational Research 86, 473–490 (1999)
Reidys, C.M., Stadler, P.F.: Combinatorial landscapes. SIAM Review 44(1), 3–54 (2002)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs (1995)
Taillard, E.D.: Comparison of iterative searches for the quadratic assignment problem. Location Science 3, 87–105 (1995)
Weinberger, E.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics 63, 325–336 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gutiérrez, E., Brizuela, C.A. (2006). ILS-Perturbation Based on Local Optima Structure for the QAP Problem. In: Gelbukh, A., Reyes-Garcia, C.A. (eds) MICAI 2006: Advances in Artificial Intelligence. MICAI 2006. Lecture Notes in Computer Science(), vol 4293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925231_38
Download citation
DOI: https://doi.org/10.1007/11925231_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49026-5
Online ISBN: 978-3-540-49058-6
eBook Packages: Computer ScienceComputer Science (R0)