Guidelines for the use of meta-heuristics in combinatorial optimization

European Journal of Operational Research

Volumn 151, Issue 2, 2003, Pages 247-252

  Hertz, Alain ^a   Widmer, Marino ^b  

^a GERAD   (Canada)

^b UNIVERSITY OF FRIBOURG   (Switzerland)

Author keywords

Local search methods; Meta heuristics; Population search methods

Indexed keywords

ALGORITHMS; DECISION MAKING; HEURISTIC METHODS; OPTIMIZATION; TOPOLOGY;

COMBINATORIAL OPTIMIZATION;

OPERATIONS RESEARCH;

EID: 0043023858     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00823-8     Document Type: Conference Paper

References (9)

1. Galinier P., Hao J.K. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization. 3:1999;379-397.
2. Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science. 40:1984;1276-1290.
3. Glover F. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research. 13:1986;433-549.
4. Hertz A. Finding a feasible course schedule using tabu search. Discrete Applied Mathematics. 35:1992;255-270.
5. Holland J.H. Adaptation in Natural and Artificial Systems. 1975;University of Michigan Press, Ann Arbor, MI.
6. Hertz A., Widmer M. An improved tabu search approach for solving the job shop scheduling problem with tooling constraints. Discrete Applied Mathematics. 65:1996;319-346.
7. Kirkpatrick S., Gellatt C.D. Jr., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;671-680.
8. Mladenovic N., Hansen P. Variable neighbourhood search. Computers & Operations Research. 34:1997;1097-1100.
9. Rochat Y., Taillard E.D. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics. 1:1995;147-167.