Abstract
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In addition to the number S of moves, ID Walk uses only one parameter Max which is the maximum number of candidate neighbors studied in every move. This candidate list strategy manages the Max candidates so as to obtain a good tradeoff between intensification and diversification.
A procedure has also been designed to tune the parameters automatically. We made experiments on several hard combinatorial optimization problems, and ID Walk compares favorably with correspondingly simple instances of leading metaheuristics, notably tabu search, simulated annealing and Metropolis. Thus, among algorithmic variants that are designed to be easy to program and implement, ID Walk has the potential to become an interesting alternative to such recognized approaches.
Our automatic tuning tool has also allowed us to compare several variants of ID Walk and tabu search to analyze which devices (parameters) have the greatest impact on the computation time. A surprising result shows that the specific diversification mechanism embedded in ID Walk is very significant, which motivates examination of additional instances in this new class of “dynamic” candidate list strategies.
This is a preview of subscription content, log in via an institution to check access.
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
Bessière, C.: Random Uniform CSP Generators, http://www.lirmm.fr/bessiere/generator.html
Connolly, D.T.: An improved annealing scheme for the qap. European Journal of Operational Research 46, 93–100 (1990)
de Givry, S., Verfaillie, G., Schiex, T.: Bounding the optimum of constraint optimization problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, Springer, Heidelberg (1997)
Dorne, R., Hao, J.K.: Tabu search for graph coloring, T-colorings and set Tcolorings. In: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 77–92. Kluwer Academic Publishers, Dordrecht (1998)
Eisenblätter, A., Koster, A.: FAP web - A website about Frequency Assignment Problems, http://fap.zib.de/
Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)
Gent, I., Walsh, T.: CSPLib: a benchmark library for constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 480–481. Springer, Heidelberg (1999)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Gomes, C., Sellmann, M., van Es, C., van Es, H.: The challenge of generating spatially balanced scientific experiment designs. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 387–394. Springer, Heidelberg (2004)
Gottlieb, J., Puchta, M., Solnon, C.: A study of greedy, local search and ant colony optimization approaches for car sequencing problems. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 246–257. Springer, Heidelberg (2003)
Kirkpatrick, S., Gellat, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Kolen, A.: A genetic algorithm for frequency assignment. Technical report, Universiteit Maastricht (1999)
Koster, A., Van Hoesel, C., Kolen, A.: Solving frequency assignment problems via tree-decomposition. Technical Report 99-011, Universiteit Maastricht (1999)
Michel, L., Van Hentenryck, P.: A constraint-based architecture for local search. In: Proc. of the OOPSLA conference (2002)
Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing conflict: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58, 161–205 (1992)
Morgenstern, C.: Distributed coloration neighborhood search. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, vol. 26, pp. 335–357. American Mathematical Society, Providence (1993)
Neveu, B., Trombettoni, G.: INCOP: An Open Library for INcomplete Combinatorial OPtimization. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 909–913. Springer, Heidelberg (2003)
Neveu, B., Trombettoni, G.: When Local Search Goes with the Winners. In: Int. Workshop CPAIOR 2003, pp. 180–194 (2003)
Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. Theoretical Computer Science, vol. 26, AMS (2003)
Voudouris, C., Tsang, E.: Solving the radio link frequency assignment problem using guided local search. In: Nato Symposium on Frequency Assignment, Sharing and Conservation in Systems (AEROSPACE) (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neveu, B., Trombettoni, G., Glover, F. (2004). ID Walk: A Candidate List Strategy with a Simple Diversification Device. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive