An ant colony approach to the orienteering problem

Journal of the Chinese Institute of Industrial Engineers

Volumn 23, Issue 5, 2006, Pages 403-414

  Liang, Yun Chia ^a   Smith, Alice E ^b  

^a YUAN ZE UNIVERSITY   (Taiwan)

^b AUBURN UNIVERSITY   (United States)

Author keywords

Ant colony; Optimization; Orienteering problem; Routing; Traveling salesman problem

Indexed keywords

COMPUTATION THEORY; CONSTRAINT THEORY; PROBLEM SOLVING; ROUTERS; TRAVELING SALESMAN PROBLEM;

ANT COLONY; ORIENTEERING PROBLEM; PENALTY FUNCTION; SEQUENCED LOCAL SEARCH;

OPTIMIZATION;

EID: 33748972433     PISSN: 10170669     EISSN: 21517606     Source Type: Journal    
DOI: 10.1080/10170660609509336     Document Type: Article

References (39)

1. Bauer, A., Bullnheimer, B., Hartl, R. F., and Strauss, C., 2000. Minimizing Total Tardiness on a Single Machine Using Ant Colony Optimization. Central European Journal of Operations Research, 8 (2):125–141.
2. Bilchev, G., and Parmee, I. C., 1995. “ The Ant Colony Meta phor for Searching Continuous Design Spaces ”. In Lecture Notes in Computer Science Edited by:Fogarty, T., Vol. 933, 25–39. Springer Verlag.
3. Chao, I. M., Golden, B. L., and Wasil, E. A., 1996. A Fast and Effective Heuristic for the Orienteering. European Journal of Operational Research, 88:475–489.
4. Colorni, A., Dorigo, M., Maniezzo, V., and Trubian, M., 1994. Ant System for Job-Shop Scheduling. Belgian Journal of Operations Research, Statisticr and Computer Science (JORBEL), 34 (1):39–53.
5. Costa, D., and Hertz, A., 1997. Ants Can Colour Graphs. Journal of the Operational Research Society, 48:295–305.
6. Den Besten, M., Stützle, T., and Dorigo, M., 2000. “ Ant Colony Optimization for the Total Weighted Tardiness Problem ”. In Proceedings of the 6th International Conference on Parallel Problem Solving from Nature (PPSN VI) 611–620. Berlin:LNCS 1917.
7. Di Caro, G., and Dorigo, M., 1998. “ Ant Colonies for Adaptive Routing in Packet-Switched Communication Networks ”. In Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (PPSN V) 673–682. Amsterdam, The Netherlands
8. Dorigo, M., 1992. Optimization, Learning and Natural Algorithms Italy:Politecnico di Milano. Ph.D. Thesis
9. Dorigo, M., and Gambardella, L. M., 1997. Ant Colony System:A Cooperative Learning Approach to the Travelling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1 (1):53–66.
10. Fischetti, M., Gonzalez, J. J. S., and Toth, P., 1998. Solving the Orienteering Problem through Branch-and-Cut. INFORMS Journal on Computing, 10 (2):133–148.
11. Gambardella, L. M., and Dorigo, M., 2000. An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem. INFORMS Journal on Computing, 12 (3):237–255.
12. Gambardella, L. M., Taillard, E., and Agazzi, G., 1999. “ MACS-VRPTW A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows ”. In New Ideas in Optimization Edited by:Corne, D., Dorigo, M., and Glover, F., 63–76. McGraw-Hill.
13. Golden, B. L., Levy, L., and Vohra, R., 1987. The Orienteering Problem. Naval Research Logistics, 34:307–318.
14. Golden, B. L., Wang, Q., and Liu, L., 1988. A Multifaceted Heuristic for The Orienteering Problem. Naval Research Logistics, 35:359–366.
15. Hayes, M., and Norman, J. M., 1984. Dynamic Programming in Orienteering:Route Choice and the Siting of Controls. Journal of the Operational Research Society, 35 (9):791–796.
16. Keller, P. C., 1989. Algorithms to Solve the Orienteering Problem:A Comparison. European Journal of Operational Research, 41:224–231.
17. Laporte, G., and Martello, S., 1990. The Selective Traveling Salesman Problem. Discrete Applied Mathematics, 26:193–207.
18. Leguizamon, G., and Michalewicz, Z., 1999. “ A New Version of Ant System for Subset Problems ”. In Proceedings of the 1999 Congress on Evolutionary Computation 1459–1464. Washington, D.C.
19. Leifer, A. C., and Rosenwein, M. B., 1993. Strong Linear Programming Relaxations for the Orienteering Problem. European Journal of Operational Research, 73:517–523.
20. Liang, Y.-C., Lo, M.-H., and Chen, A. H. L., 2003. “ An Ant Colony Approach for the Vehicle Routing Problem under Distance and Capacity Constraints ”. In Proceedings of the 8th Annual International Conference on Industrial Engineering—Theory, Applications and Practice (IJIE2003) 600–605. Las Vegas, Nevada
21. Liang, Y.-C., and Smith, A. E., 2004. An Ant Colony Optimization Algorithm for the Redundancy Allocation Problem (RAP). IEEE Transactions on Reliability, 53 (3):417–423.
22. Maniezzo, V., and Colorni, A., 1999. The Ant System Applied to the Quadratic Assignment Problem. IEEE Transactions on Knowledge and Data Engineering, 11 (5):769–778.
23. Mariano, C. E., and Morales, E., 1999. “ MOAQ an Ant-Q Algorithm for Multiple Objective Optimization Problems ”. In Proceedings of the Genetic and Evolutionary Computation Conference Vol. 1, 894–901. Orlando, Florida
24. Merkle, D., and Middendorf, M., 2005. On Solving Permutation Scheduling Problems with Ant Colony Optimization. International Journal of Systems Science, 36 (5):255–266.
25. Michels, R., and Middendorf, M., 1998. “ An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem ”. In Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (PPSN V) 692–701. Amsterdam, The Netherlands
26. Michels, R., and Middendorf, M., 1999. “ An Ant System for the Shortest Common Supersequence Problem ”. In New Ideas in Optimization Edited by:Corne, D., Dorigo, M., and Glover, F., 51–61. McGraw-Hill.
27. Middendorf, M., Reischle, F., and Schmeck, H., 2002. Multi Colony Ant Algorithms. Journal of Heuristics, 8 (3):305–320.
28. Mladenovic, N., and Hansen, P., 1997. Variable Neighborhood Search. Computers and Operations Research, 24 (11):1097–1100.
29. Ramalhinho, H., and Serra, D., 1998. “ Adaptive Approach Heuristics for the Generalized Assignment Problem ”. In Economic Working Paper 288 Spain:Universitat Pompeu Fabra.
30. Ramesh, R., and Brown, K. M., 1991. An Efficient Four-Phase Heuristic for the Generalized Orienteering Problem. Computers and Operations Research, 18 (2):151–165.
31. Ramesh, R., Yoon, Y. S., and Karwan, M. H., 1992. An Optimal Algorithm for the Orienteering Tour Problem. ORSA Journal on Computing, 4 (2):155–165.
32. Schoofs, L., and Naudts, B., 2000. “ Ant Colonies are Good at Solving Constraint Satisfaction Problems ”. In Proceedings of the 2000 Congress on Evolutionary Computation 1190–1195. San Diego, CA
33. Stützle, T., and Dorigo, M., 1999. “ ACO Algorithms for the Quadratic Assignment Problem ”. In New Ideas in Optimization Edited by:Corne, D., Dorigo, M., and Glover, F., 33–50. McGraw-Hill.
34. Tasgetiren, M. F., and Smith, A. E., 2000. “ A Genetic Algorithm for the Orienteering Problem ”. In Proceedings of the 2000 Congress on Evolutionary Computation 1190–1195. San Diego, CA
35. Tsiligirides, T., 1984. Heuristic Methods Applied to Orienteering. Journal of Operational Research Society, 35 (9):797–809.
36. Wagner, I. A., and Bruckstein, A. M., 1999. “ Hamiltonian(t)-An Ant Inspired Heuristic for Recognizing Hamiltonian Graphs ”. In Proceedings of the 1999 Congress on Evolutionary Computation 1465–1469. Washington, D.C.
37. Wang, Q., Sun, X., Golden, B. L., and Jia, J., 1995. Using Artificial Neural Networks to Solve the Orienteering Problem. Annals of Operations Research, 61:111–120.
38. Wodrich, M., and Bilchev, G., 1997. Cooperative Distributed Search:The Ants' Way. Journal of Control and Cybernetics, 26 (3):413–446.
39. Wren, A., and Holiday, A., 1972. Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points. Operations Research Quarterly, 23:333–344.