Title :
Meta heuristics for the orienteering problem
Author :
Liang, Yun-Chia ; Kulturel-Konak, Sadan ; Smith, Alice E.
Author_Institution :
Dept. of Ind. Eng. & Manage., Yuan Ze Univ., Taoyuan, Taiwan
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
Keywords :
computational complexity; heuristic programming; search problems; travelling salesman problems; ant colony optimization; computational cost; industry; meta-heuristic techniques; orienteering problem; tabu search; traveling salesman problem; Ant colony optimization; Artificial neural networks; Chaos; Costs; Engineering management; Industrial engineering; Performance evaluation; Search methods; Testing; Traveling salesman problems;
Conference_Titel :
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location :
Honolulu, HI
Print_ISBN :
0-7803-7282-4
DOI :
10.1109/CEC.2002.1006265