Skip to main content
SpringerLink
Log in

Heuristics: An Overview

  • Living reference work entry
  • First Online:
Handbook of Formal Optimization

  • 39 Accesses

Abstract

There are many problems that still cannot be solved exactly in a reasonable time despite rapid increases in computing power, including the Travelling Salesman Problem and the Examination Timetabling Problem. Therefore, there is still a strong need for heuristics and this chapter demonstrates that the search for better heuristics remains a dynamic research topic. An overview is provided of many traditional heuristic methods including Simulated Annealing, Tabu Search, and Genetic Algorithms as well as more recently proposed methods including Harmony Search, Hyper-heuristics, and Matheuristics. Examples are provided for the Travelling Salesman Problem and the Examination Timetabling Problem showing that high-quality solutions can be produced in a reasonable time if a suitable heuristic method is applied appropriately.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • Aarts E, Korst J (1989) Simulated annealing and Boltzmann machines, Interscience series in discrete mathematics and optimisation. Wiley

    Google Scholar 

  • Ahmed Z (2010) Genetic algorithms for the travelling salesman problem using sequential constructive crossover operator. Int J Biom Bioinforma 3:6

    Google Scholar 

  • Al-Betar M, Khader A, Thomas J (2010) A combination of metaheuristic components based on search for the uncapacitated examination timetabling problem. 8th international conference on the practice and theory of automated timetabling, Belfast, pp 57–80

    Google Scholar 

  • Alia O, Mandava R (2011) The variants of the harmony search algorithm: an overview. Artif Intell Rev 36:49–68

    Article  Google Scholar 

  • Alzaqebah M, Abdullah S (2011) Artificial bee colony search algorithm for examination timetabling problems. Int J Phys Sci 6(17):4264–4272

    Google Scholar 

  • Antosiewicz, A, Koloch, G, B Kaminski B (2013) Choice of best possible metaheuristic algorithm for the travelling salesman problem with limited computational time: quality, uncertainty and speed. J Theor Appl Comput Sci 7(1):46–55

    Google Scholar 

  • Archetti C, Garcia Speranza M (2014) A survey on matheuristics for routing problems. EURO J Comput Optim 2(4):223–246

    Article  Google Scholar 

  • Ayob M, Burke E, Kendall G (2006) An iterative re-start variabe neighbourhood search for the examination timetabling problem. Practice and theory of automated timetabling, Brno, Czech Republic, pp 336–344

    Google Scholar 

  • Bargetto R, Della Croce F, Salassa F (2016) A matheuristic approach for the examination timetabling problem. 11th international conference on the practice and theory of automated timetabling, Udine, Italy, pp 467–471

    Google Scholar 

  • Basu S (2012) Tabu search implementation on travelling salesman problem and its variations: a literature survey. Am J Oper Res 2(2):163–173

    Google Scholar 

  • Bilgin B, Ozcan E, Korkmax E (2006) An experimental study on hyper-heuristics and exam timetabling. The third international conference on the practice and theory of automated timetabling, Brno, Czech Republic, pp 123–140

    Google Scholar 

  • Boloji A, Khader A, Al-Betar M, Awadallah M, Thomas J (2012) The effect of neighbourhood structures on examination timetabling with artificial bee colony. 9th international conference on the practice and theory of automated timetabling, Son, Norway, pp 131–144

    Google Scholar 

  • Brelaz D (1979) New methods to color the vertices of a graph. Commun Assoc Comput Machin 22:251–256

    MathSciNet  Google Scholar 

  • Bullnheimer B (1999) A new rank based version of the ant system: a computational study. Cent Eur J Oper Res 7:25–38

    MathSciNet  Google Scholar 

  • Burke E, Cowling P, Keuthen P (2001) Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem. Workshops on Applications of Evolutionary Computation, Berlin, pp 203–212

    Google Scholar 

  • Burke E, Petrovic S, Qu R (2006) Case based heuristic selection for examination timetabling. J Sched 9:115–132

    Article  Google Scholar 

  • Burke E, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176:177–192

    Article  MathSciNet  Google Scholar 

  • Burke E, Kendall G, Misir M, Ozcan E (2008) A study of simulated annealing hyper-heuristics. In: Proceedings of the international conference on the practice and theory of automated timetabling

    Google Scholar 

  • Burke E, Eckersley A, McCollum B, Petrovic S, Qu R (2010) Hybrid variable neighbourhood approaches to university exam timetabling. Eur J Ops Res 206:46–53

    Google Scholar 

  • Carter M, Laporte G, Lee S (1996) Examination timetabling: algorithmic strategies and applications. J Oper Res Soc 47(3):373–383

    Article  Google Scholar 

  • Casey S, Thompson J (2002) GRASPing the examination scheduling problem. Practice and theory of automated timetabling IV, Lecture notes in computer science 2740:232–246

    Google Scholar 

  • Cerny V (1985) Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45:41–51

    Article  MathSciNet  Google Scholar 

  • Christofides N (1976) Worst case analysis of a new heuristic for the travelling salesman problem, Report No. 338. Carnegie-Mellen University, Pittsburgh

    Google Scholar 

  • Clarke G, Wright J (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581

    Article  Google Scholar 

  • Dancubourg J, Aron A, Goss S, Pasteels J (1990) The self organising exploratory pattern of the Argentine ant. J Insect Behav 3:159–168

    Article  Google Scholar 

  • Dener M, Calp M (2018) Solving the exam scheduling problem in central exams with genetic algorithms. MuÄŸla J Sci Technol 4:102–115

    Google Scholar 

  • Di Gaspero L, Schaerf A (2001) Tabu search techniques for examination timetabling. In: Practice and theory of automated timetabling III, Konstanz, Germany, Selected Papers, pp 104–117

    Chapter  Google Scholar 

  • Dorigo M, Biratari M, Stutzle T (2006) Ant colony optimisation. IEEE Comput Intelli 1:28–39

    Article  Google Scholar 

  • Dowsland K, Thompson J (1996) Variants of simulated annealing for the examination timetabling problem. Ann Oper Res 63:105–128

    Article  Google Scholar 

  • Dowsland K, Thompson J (2005) Ant Colony optimisation for the examination scheduling problem. J Oper Res Soc 46:426–438

    Article  Google Scholar 

  • Dueck G (1993) New optimization heuristics: the great deluge algorithm and the record-to-record travel. J Comput Phys 104(1):86–92

    Article  MathSciNet  Google Scholar 

  • Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90(1):161–175

    Article  MathSciNet  Google Scholar 

  • Feo T, Resende M (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109–133

    Article  MathSciNet  Google Scholar 

  • Geem Z, Kim J, Loganathan J (2001) A new heuristic optimization algorithm: harmony search. Simulation 76:60–68

    Article  Google Scholar 

  • Glover F (1989) Tabu search – part 1. ORSA J Comput 1(3):190–206

    Article  MathSciNet  Google Scholar 

  • Gogos C, Alefragis P, Housos E (2012) An improved multi-staged algorithmic process for the solution of the examination timetabling problem. Ann Oper Res 194:203–221

    Article  MathSciNet  Google Scholar 

  • Hansen, P (1986) The steepest ascent mildest descent heuristic for combinatorial programming. Presented at the congress on numerical methods in combinatorial optimisation, Capri, Italy

    Google Scholar 

  • He Y, Qiu Y, Liu G, Lei K (2005) A parallel adaptive Tabu search approach for travelling salesman problems. International conference on natural language processing and knowledge engineering, IEEE, Jeju Island, Korea, pp 796–801

    Google Scholar 

  • Hlaing Z, Khine M (2011) Solving the traveling salesman problem by using improved ant colony optimisation algorithm. Int J Inf Educ Technol 1(5):404

    Google Scholar 

  • Holland J (1992) Genetic algorithms. Sci Am 267(1):66–73

    Article  Google Scholar 

  • Hore S, Chatterjee A, Dewanji A (2018) Improving variable neighbourhood search for the traveling salesman problem. Appl Soft Comput 68:83–91

    Google Scholar 

  • Jha S (2014) Exam timetabling using genetic algorithms. Int J Res J Eng Technol 3(5):649–654

    Article  Google Scholar 

  • Johnson D, McGeogh L (1995) The travelling salesman problem: a case study in local optimisation. Local search in combinatorial optimisation 1(1):215–310

    Google Scholar 

  • Karaboga D, Basturk B (2007) Artificial bee colony optimization algorithm for solving constrained optimisaton problems. In: Melin P, Castillo O, Aguilar L, Kacprzyk J, Pedrycz W (eds) Foundations of fuzzy logic and soft computing. Lecture notes in lecture science 4529. Heidelberg, Berlin

    Google Scholar 

  • Khan I, Maiti M (2019) A swap sequence based artificial bee colony algorithm for the travelling salesman problem. Swarm Evol Comput 44:428–438

    Article  Google Scholar 

  • Kirkpatrick S, Gelatt C Jr, Vecchi M (1983) Optimisation by simulated annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  • Leite N, Melicio F, Rosa A (2019) A fast simulated annealing algorithm for the examination timetabling problem. Expert Syst Appl 122:137–151

    Article  Google Scholar 

  • Mahdi W, Medjahed S, Ouali M (2017) Performance analysis of simulated annealing cooling schedules in the context of dense image matching. Comput Sist 21(3):493–501

    Google Scholar 

  • Malek M, Guruswamy M, Pandya M, Owens H (1989) Series and parallel simulated annealing and Tabu search algorithms for the travelling salesman problem. Ann Oper Res 21:59–84

    Article  MathSciNet  Google Scholar 

  • Masoud S, Aksen D, Salhi S (2020) Formulation and a 2-phase matheuristic for the roaming salesman problem: applications to election logistics. Eur J Oper Res 280(2):656–670

    Article  MathSciNet  Google Scholar 

  • Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087–1092

    Article  Google Scholar 

  • Morgernstern C (1989) Algorithms for general graph coloring. Doctoral dissertation. Department of Computer Science, University of New Mexico

    Google Scholar 

  • Salhi S, Thompson J (2022) The new era of hybridization and learning in heuristic search design. In: The Palgrave handbook of operational research, pp 501–538

    Chapter  Google Scholar 

  • Wang Y (2014) The hybrid genetic algorithm with two local optimization strategies for the travelling salesman problem. Comput Ind Eng 70:124–133

    Article  Google Scholar 

  • White G, Xie B, Zonjic S (2004) Using Tabu search with longer term memory and relaxation to create examination timetables. Eur J Oper Res 153:80–91

    Article  MathSciNet  Google Scholar 

  • Wong L, Low M, Chong C (2008) A bee colony optimization algorithm for the travelling salesman problem. Second Asia international conference on modelling and simulation, Kuala Lumpar, Malaysia, pp 818–823

    Google Scholar 

  • Yang Y, Petrovic S (2004) A novel similarity measure for heuristic selection in examination timetabling. Third international conference on the practice and theory of automated timetabling, Konstanz, Germany, pp 247–269

    Google Scholar 

  • Zhu M, Chen J (2017) Computational comparison of GRASP and DCTSP methods for the travelling salesman problem. 2nd international conference on image, vision and computing, IEEE, Chengdu, China, pp 1044–1048

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, Cardiff University, Cardiff, UK

    Jonathan Thompson

Authors
  1. Jonathan Thompson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jonathan Thompson .

Editor information

Editors and Affiliations

  1. Institute of Artificial Intelligence, MIT World Peace University, Pune, Pune, Maharashtra, India

    Anand J. Kulkarni

  2. Faculty of Engineering and IT, University of Technology Sydney, Ultimo, NSW, Australia

    Amir H. Gandomi

Section Editor information

  1. Institute of Artificial Intelligence, Dr Vishwanath Karad MIT World Peace University, Pune, India

    Anand J. Kulkarni

Rights and permissions

Reprints and permissions

Copyright information

© 2024 Springer Nature Singapore Pte Ltd.

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Thompson, J. (2024). Heuristics: An Overview. In: Kulkarni, A.J., Gandomi, A.H. (eds) Handbook of Formal Optimization. Springer, Singapore. https://doi.org/10.1007/978-981-19-8851-6_32-1

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-8851-6_32-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-8851-6

  • Online ISBN: 978-981-19-8851-6

  • eBook Packages: Springer Reference Intelligent Technologies and RoboticsReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation