HEURISTICS, METAHEURISTICS, MACROHEURISTICS

Some Basic Heuristics

1. Approximate solving schemes

2. Greedy algorithms

3. Genetic algorithms

4. Simulated annealing

5. Tabu-search

6. GRASP

7. Ant Systems

8. Memetic alorithms

9. Neural networks

10. Space-filling curves
(Prof. John J. Bartholdi III,
School of Industrial and Systems Engineering, Georgia Institute of Technology)

11. Interchange techniques

12. Evolutionary multiobjective optimization

13. Cross-Entropy (CE) Method (Prof. Rueven Y. Rubinstein, Technion, Israel)

14. Partitioning /Synthesis Morphological Macroheuristics

Research Groups

  • Lab. for Experimental Algorithms (Univ. of Trento, Italy)
  • EU/ME the European chapter on metaheuristics (EURO Working Group)
  • Evolutionary Multi-Objective Optimization (Dr. Carlos A. Coello Coello)

    Educational Courses

  • Course on Metaheuristics for Combinatorial Optimization Problems (Prof. Pablo Moscato)

    Journals

  • Journal of Heuristics
  • ACM Journal of Experimental Algorithmics

    Bibliography

  • Basic Papers
    1. M. Ball, and M. Magazine, The Design and Analysis of Heuristics, Networks, Vol. 11, No. 2, pp. 215-219, 1981.
    2. R. Karp, Probabilistic Analysis of Partitioning Algorithms for the Traveling Salesman Problem in the Plan. Mathematics of the Operations Research, Vol. 2, No. 3, pp. 209-224, 1977.
    3. J.J. Bartholdi, III, and L.K. Platzman, Spacefilling Curves and the Planar Traveling Salesman Problem. J. of the ACM, 36/4, 719-737, 1989.

  • Books
    1. G. Laporte, and I. Osman, (Eds.) Metaheuristics in Combinatorial Optimization. Annals of Operations Research, Vol. 69, Amsterdam: Baltzer, 1995.
    2. C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems. J.Wiley & Sons, New York, 1995.
    3. G. Reinelt, The Traveling Salesman, Berlin: Springer-Verlag, 1994.
    4. Z. Michalewicz, Genetic Algorithms + Data Structure = Evolutionary Programs, 3rd ed., Berlin: Springer-Verlag, 1996.
    5. Z. Michalewicz, and D.B. Fogel, How To Solve It: Modern Heeuristics. Berlin: Springer-Verlag, 2000.
    6. Z. Michalewicz, Th. Baeck, and D.B. Fogel, (Eds.), Handbook of Evolutionary Computation. London: Oxford Univ. Press, 1997.
    7. Z. Michalewicz, and D. Dasgupta, (Eds.), Evolutionary Aalgorithms in Engineering Application. Berlin: Springer-Verlag, 1997.
    8. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, (eds.), The Traveling Salesman Problem. Chichester: J.Wiley & Sons, 1985.
    9. J.H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, Michigan: Univ. of Michigan Press, 1975.
    10. D.E. Goldberg, Genetic Algorithm in Search, Optimization and Machine Learning. Mass: Addison-Wesley, Reading, 1989.
    11. M.R. Garey, and D.S. Johnson, Computers and Intractability. The Guide to the Theory of NP-Completeness. San-Francisco: W.H. Freeman and Company, 1979.
    12. E.G. Coffman, Jr. (ed.), Scheduling in Computer and Job Shop Systems, New York: J.Wiley & Sons, 1976.
    13. K. Deb, Multi-Objective Optimization using Evolutionary Algorithms. Wiley, Chichester, UK, 2001.
    14. M.Sh. Levin, Combinatorial Engineering of Decomposable Systems, Dordrecht: Kluwer, 1998.