Ant colony optimization for the traveling purchaser problem

Computers and Operations Research

Volumn 35, Issue 2, 2008, Pages 628-637

  Bontoux, Boris ^a   Feillet, Dominique ^a  

^a UNIVERSITY OF AVIGNON   (France)

Author keywords

Ant colony optimization; Traveling purchaser problem

Indexed keywords

BENCHMARKING; COST ACCOUNTING; MARKETING; OPTIMIZATION;

ANT COLONY OPTIMIZATION; TRAVELING PURCHASER PROBLEM;

PROBLEM SOLVING;

EID: 34447125697     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.03.023     Document Type: Article

References (20)

1. Ramesh T. Traveling purchaser problem. Opsearch 18 (1981) 78-91
2. Pearn W.L., and Chien R.C. Improved solutions for the traveling purchaser problem. Computers and Operations Research 25 (1998) 879-885
3. Ong HL. Approximate algorithms for the traveling purchaser problem. Operations Research Letters 1982; 201-205.
4. Singh K.N., and Oudheusden D.L.V. A branch and bound algorithm for the traveling purchaser problem. European Journal of Operational Research 97 (1997) 571-579
5. Golden B.L., Levy L., and Dahl R. Two generalizations of the traveling salesman problem. Omega 9 (1981) 439-445
6. Teeninga A., and Volgenant A. Improved heuristics for the traveling purchaser problem. Computers and Operations Research 31 (2004) 139-150
7. Voß S. Dynamic tabu search strategies for the traveling purchaser problem. Annals of Operational Research 63 (1996) 253-275
8. Boctor F.F., Laporte G., and Renaud J. Heuristics for the traveling purchaser problem. Computers and Operations Research 30 (2003) 491-504
9. Riera-Ledesma J., and Salazar-González J.J. A heuristic approach for the traveling purchaser problem. European Journal of Operational Research 162 (2005) 142-152
10. Laporte G., Riera-Ledesma J., and Salazar-Gonzáles J.J. A branch-and-cut algorithm for the undirected traveling purchaser problem. Operations Research 51 (2003) 940-951
11. Dorigo M, Maniezzo V, Colorni A. Positive feedback as a search strategy. Technical report 91-016, Dipartimento di Elettronica Politecnico di Milano, Italy; 1991.
12. Dorigo M., Maniezzo V., and Colorni A. The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26 1 (1996) 29-41
13. Bell J.E., and McMullen P.R. Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics 18 1 (2004) 41-48
14. Lessing L, Dumitrescu I, Stützle T. A comparison between aco algorithms for the set covering problem. ANTS Workshop 2004;1-12.
15. Costa D., and Hertz A. Ants can colour graphs. Journal of the Operational Research Society 48 (1997) 295-305
16. Dorigo M., and Stützle T. Ant colony optimization (2004), MIT Press/Bradford Books, Cambridge, MA
17. Lin S. Computer solutions of the traveling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
18. Feillet D., Dejax P., Gendreau M., and Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44 (2004) 216-229
19. Feillet D., Dejax P., and Gendreau M. Traveling salesman problems with profits. Transportation Science 39 2 (2005) 188-205
20. Renaud J., and Boctor F.F. An efficient composite heuristic for the symmetric generalized traveling salesman problem. European Journal of Operational Research 108 (1998) 571-584