Feasibility restoration for iterative meta-heuristics search algorithms

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

Volumn 2358, Issue , 2002, Pages 168-178

  Randall, Marcus ^a  

^a BOND UNIVERSITY   (Australia)

Author keywords

Combinatorial optimisation problems; Feasibility restoration; Meta heuristic; Simulated annealing

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; EXPERT SYSTEMS; ITERATIVE METHODS; LEARNING ALGORITHMS; RESTORATION; SIMULATED ANNEALING;

META HEURISTICS; META-HEURISTIC SEARCH ALGORITHMS; METAHEURISTIC; NEIGHBOURHOOD SEARCH; SEARCH ALGORITHMS; STANDARD TESTS;

HEURISTIC ALGORITHMS;

EID: 23044531918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48035-8_17     Document Type: Conference Paper

References (13)

1. Abramson, D., Dang, H. and Krishnamoorthy, M. (1996) “A Comparison of Two Methods for Solving 0-1 Integer Programs Using a General Purpose Simulated Annealing”, Annals of Operations Research, 63, pp. 129-150.
2. Abramson, D. and Randall, M. (1999) “A Simulated Annealing Code for General Integer Linear Programs”, Annals of Operations Research, 86, pp. 3-21.
3. Beasley, J (1990) “OR-library: Distributing Test problems by Electronic Mail”, Journal of the Operational Research Society, 41, pp. 1069-1072.
4. Beasley, J. and Chu, P. (1996) “A Genetic Algorithm for the Set Covering Problem”, European Journal of Operational Research, 94, pp. 392-404.
5. Chu, P. and Beasley, J. (1997) “A Genetic Algorithm for the Generalised Assignment Problem”, Computers and Operations Research, 24, pp. 17-23.
6. Chu, P. and Beasley, J. (1998) “A Genetic Algorithm for the Multidimensional Knapsack Problem”, Journal of Heuristics, 4, pp. 63-86.
7. Connolly, D. (1992) “General Purpose Simulated Annealing”, Journal of the Operational Research Society, 43, pp. 495-505.
8. Hertz, A., Laporte, G. and Mittaz, M. (2000) “A Tabu Search Heuristic for the Capacitated Arc Routing Problem”, Operations Research, 48, pp. 129-135.
9. Kämpke, T. (1988) “Simulated Annealing: A New Tool in Bin Packing”, Annals of Operations Research, 16 pp. 327-332.
10. Osman, I. (1995) “Heuristics for the Generalised Assignment Problem: Simulated annealing and Tabu Search Approaches”, OR Spektrum, 17, pp. 211-225
11. Randall, M. (1999) “A General Modelling Systems and Meta-heuristic based Solver for Combinatorial Optimisation Problems,” PhD thesis, Faculty of Environmental Science, Griffith University. Available online at: http://www.it.bond.edu.au/randall/general.pdf
12. Randall, M. and Abramson, D. (2000) “A General Meta-heuristic Based Solver for Combinatorial Optimisation Problems”, Journal of Computational Optimization and Applications, 20 (to appear).
13. Reinelt, G. (1991) “TSPLIB - a Traveling Salesman Problem Library”, ORSA Journal on Computing, 3, pp. 376-384. Available on-line at http://softlib.rice.edu/softlib/tsplib.