Abstract
This paper describes a new algorithm for combinatorial optimization problems and presents the results of our experiments. HOLSA — Heuristic Oscillating Local Search Algorithm- is a neighborhood search algorithm using an evaluation function f inspired from A*, a best-first strategy, a pruning of states as in B&B and operators performing variable steps. All these caracteristics lead to an oscillation principle whereby the search alternates between improving the economic function and satisfying the constraints. We specify how to compute the start state, the evaluation function and the variable steps in order to implement the general outline of HOLSA. Its performance is tested on the multidimensional knapsack problem, using randomly generated problems and classical test problems of the litterature. The experiments show that HOLSA is very efficient, according to the quality of the solutions as well as the search speed, at least on the class of problems studied in this paper. Moreover with large problems, and a limited number of generated nodes, we show that it is better than Branch & Bound, simulated annealing, tabu search and GRASP, both for the quality of the solution and the computational time.
Preview
Unable to display preview. Download preview PDF.
References
Drexl, A.: A Simulated Annealing Approach to the Multiconstraint Zero-One Knapsack Problem. Computing 40 (1987) 1–8.
Feo, T. A., Resende, M. G. C.: Greedy Randomized Adaptative Search Procedures. Journal of Global Optimization 6 (1995) 109–133.
Glover, F.: Tabu Search — Part I. ORSA Journal on Computing 1(3) (1989) 190–206.
Glover, F., Kochenberger, G. A.: Critical Event Tabu Search For Multidimensional Knapsack Problems. in Meta-Heuristics: Theory and Applications (I.H. Osman and J.P. Kelly Eds) Kluwer Academic Publishers (1996) 407–427.
Kirkpatrick, S., Gellat, C. D., Vecchi, M. P.: Optimization by Simulated Annealing. Science 220 (1983) 671–680.
Korf, R.: Depth-First Iterative Deepening: an Optimal Admissible Tree Search. Articial Intelligence 27 (1985).
Nau, D., Kumar, V., Kanal, L.: General Branch and Bound and its Relation to A* and AO*. Artificial Intelligence 23 (1984) 29–59.
Nilsson, N.: Problem-Solving Methods in Artificial Intelligence. MacGraw Hill (1971).
Papadimitriou, C. H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice-Hall (1982).
Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley (1984).
Pomerol, J.-Ch., Labat, J.-M., Futtersack, M.: Les algorithmes Branch and Bound et A* sont-ils identiques? in Premier congrès biennal de l'AFCET 1 (1993) 163–173.
Reeves, C. R.: Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications (1993).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Labat, JM., Mynard, L. (1997). Oscillation, heuristic ordering and pruning in neighborhood search. In: Smolka, G. (eds) Principles and Practice of Constraint Programming-CP97. CP 1997. Lecture Notes in Computer Science, vol 1330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017463
Download citation
DOI: https://doi.org/10.1007/BFb0017463
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63753-0
Online ISBN: 978-3-540-69642-1
eBook Packages: Springer Book Archive