Meta heuristics for the orienteering problem

Yun Chia Liang, Sadan Kulturel-Konak, Alice E. Smith

Research output: Contribution to conferencePaper

30 Scopus citations

Abstract

This paper presents two meta-heuristic techniques, ant colony optimization and tabu search, for the orienteering problem, a general version of the well-known traveling salesman problem with many relevant applications in industry. Both algorithms are compared to other heuristics in the literature. Results on 67 test problems show that the ant colony optimization method and tabu search method perform as well, or better, in all cases and do so at competitive computational cost.

Original languageEnglish (US)
Pages384-389
Number of pages6
DOIs
StatePublished - Jan 1 2002
Event2002 Congress on Evolutionary Computation, CEC 2002 - Honolulu, HI, United States
Duration: May 12 2002May 17 2002

Other

Other2002 Congress on Evolutionary Computation, CEC 2002
CountryUnited States
CityHonolulu, HI
Period5/12/025/17/02

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Meta heuristics for the orienteering problem'. Together they form a unique fingerprint.

  • Cite this

    Liang, Y. C., Kulturel-Konak, S., & Smith, A. E. (2002). Meta heuristics for the orienteering problem. 384-389. Paper presented at 2002 Congress on Evolutionary Computation, CEC 2002, Honolulu, HI, United States. https://doi.org/10.1109/CEC.2002.1006265