Ants can solve the team orienteering problem

Computers and Industrial Engineering

Volumn 54, Issue 3, 2008, Pages 648-665

  Ke, Liangjun ^a   Archetti, Claudia ^b   Feng, Zuren ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b UNIVERSITY OF BRESCIA   (Italy)

Author keywords

Ant colony optimization; Ant system; Heuristics; Team orienteering problem

Indexed keywords

HEURISTIC ALGORITHMS; OPTIMIZATION; SET THEORY;

ANT COLONY OPTIMIZATION; ANT SYSTEM; HEURISTICS; TEAM ORIENTEERING PROBLEM;

PROBLEM SOLVING;

EID: 38849090016     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.10.001     Document Type: Article

References (22)

1. Archetti C., Hertz A., and Speranza M.G. Metaheuristics for the team orienteering problem. Journal of Heuristics 13 (2007) 49-76
2. Ballou R., and Chowdhury M. MSVS: An extended computer model for transport mode selection. The Logistics and Transportation Review 16 (1980) 325-338
3. Diaby M., and Ramesh R. The distribution problem with carrier service: A dual based penalty approach. ORSA Journal on Computing 7 (1995) 24-35
4. Blum C., and Dorigo M. The hyper-cube framework for ant colony optimization. IEEE Transactions on System Man, and Cybernetics - Part B 34 (2004) 1161-1172
5. Boussier, S., Feillet, D., Gendreau, M. (2006). An exact algorithm for team orienteering problems. 4OR.
6. Butt S.E., and Cavalier T.M. A Heuristic for the multiple path maximum collection problem. Computers and Operations Research 21 (1994) 101-111
7. Butt S., and Ryan D. An optimal solution procedure for the multiple path maximum collection problem using column generation. Computer and Operations Research 26 (1999) 427-441
8. Chao I.-M., Golden B., and Wasil E.A. The team orienteering problem. European Journal of Operational Research 88 (1996) 464-474
9. Chao I.-M., Golden B., and Wasil E.A. A fast and effective heuristic for the orienteering problem. European Journal of Operational Research 88 (1996) 475-489
10. Dorigo M., Maniezzo V., and Colorni A. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on System Man, and Cybernetics-Part B 26 (1996) 29-41
11. Dorigo M., Di Caro G., and Gambardella L.M. Ant algorithms for distributed discrete optimization. Artificial Life 5 (1999) 137-172
12. Dorigo M., and Stützle T. The ant colony optimization metaheuristic: Algorithms, applications, and advances. In: Glover F., and Kochenberger G. (Eds). Handbook of metaheuristics (2002), Kluwer Academic Publishers., Norwell, MA, USA 251-285
13. Dorigo M., and Stützle T. Ant colony optimization: MA (2004), MIT Press, Cambridge
14. Dorigo M., and Blum C. Ant colony optimization theory: A survey. Theoretical Computer Science 344 (2005) 243-278
15. Golden B., Levy L., and Vohra R. The orienteering problem. Naval Research Logistics 34 (1987) 307-318
16. Hall R., and Racer M. Transportation with common carrier and private fleets: System assignment and shipment frequency optimization. IIE Transactions 27 (1995) 217-225
17. Levine J., and Ducatelle F. Ant colony optimization and local search for bin packing and cutting stock problems. Journal of the Operational Research Society 55 (2004) 705-716
18. Solnon C. Ants can solve constraint satisfaction problems. IEEE Transaction on Evolutionary Computation 6 (2002) 347-357
19. Solnon C., and Fenet S. A study of ACO capabilities for solving the maximum clique problem. Journal of Heuristics 12 (2006) 155-180
20. Stützle T., and Hoos H.H. Max-min ant system. Future Generation Computer Systems 16 (2000) 889-914
21. Tang H., and Miller-Hooks E. A tabu search heuristic for the team orienteering problem. Computers and Operations Research 32 (2005) 1379-1407
22. Tsiligirides T. Heuristic methods applied to orienteering. Journal of the Operational Research Society 35 (1984) 797-809