Oscillation, heuristic ordering and pruning in neighborhood search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1330, Issue , 1997, Pages 506-518

  Labat, Jean Marc ^a   Mynard, Laurent ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LEARNING ALGORITHMS; SIMULATED ANNEALING; TABU SEARCH;

BEST-FIRST STRATEGY; COMBINATORIAL OPTIMIZATION PROBLEMS; EVALUATION FUNCTION; HEURISTIC ORDERING; LOCAL SEARCH ALGORITHM; MULTIDIMENSIONAL KNAPSACK PROBLEMS; NEIGHBORHOOD SEARCH; NEIGHBORHOOD SEARCH ALGORITHMS;

FUNCTION EVALUATION;

EID: 79960374617     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017463     Document Type: Conference Paper

References (12)

1. Drexl, A.: A Simulated Annealing Approach to the Multiconstraint Zero-One Knapsack Problem. Computing 40 (1987) 1-8.
2. Feo, T. A., Resende, M. G. C.: Greedy Randomized Adaptative Search Procedures. Journal of Global Optimization 6 (1995) 109-133.
3. Glover, F.: Tabu Search-Part I. ORSA Journal on Computing 1(3) (1989) 190-206.
4. 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 .
5. Kirkpatrick, S., Gellat, C. D., Vecchi, M. P.: Optimization by Simulated Annealing. Science 220 (1983) 671-680.
6. Korf, R,: Depth-First Iterative Deepening: an Optimal Admissible Tree Search. Articial Intelligence 27 (1985).
7. Nau, D., Kumar, V., Kanal, L.: General Branch and Bound and its Relation to A * and AO *. Artificial Intelligence 23 (1984) 29-59.
8. Nilsson, N.: Problem-Solving Methods in Artificial Intelligence. MacGraw Hill (1971).
9. Papadimitriou, C. H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice-Hall (1982).
10. Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley (1984).
11. Pomerol, J. Ch., Labat, J.-M., Futtersack, M.: Les algorithmes Branch and Bound et A * sont-ils identiques? in Premier congrès biennal de I'AFCET 1 (1993) 163-173.
12. Reeves, C. R.: Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications (1993).