A two ant colony approaches for the multi-depot capacitated arc routingproblem

2009 International Conference on Computers and Industrial Engineering, CIE 2009

Volumn , Issue , 2009, Pages 1040-1045

  Kansou, Ali ^a   Yassine, Adnan ^a  

^a UNIVERSITÉ DU HAVRE   (France)

Author keywords

Ant colony optimization; Arc routing problem; Multiple depots

Indexed keywords

HEURISTIC METHODS; NETWORK ROUTING;

ANT COLONIES; ARC ROUTING PROBLEMS; CAPACITATED ARC ROUTING PROBLEM; COMPUTATIONAL EXPERIMENT; HYBRID APPROACH; MULTI DEPOTS; MULTIPLE DEPOT; SPLITTING METHOD;

ANT COLONY OPTIMIZATION;

EID: 77956111579     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccie.2009.5223923     Document Type: Conference Paper

References (26)

1. Amberg A., Domscheke W., Voß S., "Multiple center capacitatedare routing problem: A tabu search algorithm using capacitated trees", 124,360-376 (2000).
2. Bautista J., Fernandez E., Pereira J., "Solving an urban wastecollection problem using ants heuristics", Computers and OperationsResearch, 35(9), 3020-3033 (2008).
3. Belenguer J.M., Benavent E., Lacomme P., Prins C., "Lower and upperbounds for the mixed capacitated arc routing problem", Computers andOperations Research, 33(12), 3363-3383 (2006).
4. Belenguer J.M., "Directory of CARP instances",http://www.uv.es/ belengue/carp.html, (1997).
5. Bouhafs L., Hajjam A., Koukam A., "A combination of simulatedannealing and ant colony for the capacitated location-routing problem", KES(1), 409-416 (2006).
6. Brando J. and Eglese R., "A Deterministic Tabu Search Algorithm forthe Capacitated Are Routing Problem", Computers and Operations Research,35(4), 1112-1126(2008). (Pubitemid 47558960)
7. Colorni A., Dorigo M., Maniezzo V., "Distributed optimization by antcolonies", Proceedings of the first European, Conference on artificiallife. Cambridge, USA: The MIT Press, 134-142 (1992).
8. Cordeau J.F., Gendreau M., Laporte G., "A tabu search heuristic forthe periodic and Multi-depot vehicle routing problems", Networks, 30,105-119 (1997). (Pubitemid 127360996)
9. Crevier B., Cordeau J.F., Laporte G., "The multi-depot vehiclerouting problem with inter-depot routes", 176, 756-773 (2005).
10. Ghiani G., Guerriero F., Laporte G., Musmanno R., "The capacitatedarc routing problem with intermediate facilities", Networks, 37(3), 134-143(2001).
11. Ghiani G., Guerriero F., Laporte G., Musmanno R., "Tabu searchheuristics for the arc routing problem with intermediate facilities undercapacity and lenth restrictions", Journal of Mathematical Modelling andAlgorithms, 3, 209-223 (2004).
12. Golden B.L. and Wong R.T., "Capacitated arc routing problems",Networks 11, 305-315 (1981).
13. Greistorfer P., "A tabu scatter search metaheuristic for the arcrouting problem", Computers and Industrial Engineering, 44(2), 249-266(2003).
14. Hertz A., Laporte G., Mittaz M., "A Tabu search heuristic for thecapacitated arc routing problem", Operations Research, 48, 129-135 (2000).
15. Ho W., George T.S. Ho, Ji P., Henry C.W. Lau, "A hybrid geneticalgorithm for the multi-depot vehicle routing problem", EngineeringApplications of Artificial Intelligence, 21(4), 548-557 (2008).
16. Lacomme P., Prins C., Ramdane-Chérif W., "Competitive MemeticAlgorithms for Arc Routing Problems", Annals of Operations Research, 131,159-185 (2004). (Pubitemid 39187378)
17. Lacomme P., Prins C. and Tanguy A., "First Competitive Ant ColonyScheme for the CARP", Research Report LIMOS/RR-04-21, (2004).
18. Laporte G., Nobert Y., Taillefer S., "Solving a Family ofMulti-Depot Vehicle Routing and Location-Routing Problems", TransportationScience, 22, 161-172(1988).
19. Levine J. and Ducatelle F., "Ant Colony optimization and localsearch for bin packing and cutting stock problems", Journal of OperationalResearch Society, 55, 705-716(2004).
20. Mazzeo S., Loiseau I., "An Ant Colony Algorithm for the CapacitatedVehicle Routing Problem", Electronic Notes in Discrete Mathematics, 18,181-186 (2004).
21. Polacek M., Doerner K.F., Hartl R.F., Maniezzo V., "A variableneignborhood search for the capacitated arc routing problem with intermediatefacilities", (2007).
22. Renaud J., Laporte G., Boctor F.F., "A tabu search heuristic for themulti-depot vehicle routing problem", Computers and Operations Research,23(3), 229-235 (1995).
23. Ulusoy G., "The Fleet Size and Mix Problem for Capacitated ArcRouting", European Journal of Operational Research, 22, 329-337 (1985).
24. Wøhlk S., "Contributions to Arc Routing", PhD thesis,University of Southern Denmark, 2005.
25. Wøhlk S., "New lower bound for the Capacitated Arc RoutingProblem", Computers and Operations Research, 33(12), 3458-3472 (2006).
26. Yalaoui A., Chu C., "Optimisation par Colonies de fourmis hybride :Decoupe à deux dimentions 2BP/0/G", MOSIM'06-Rabat-Maroc, (2006).