A guided local search procedure for the multi-compartment capacitated arc routing problem

Computers and Operations Research

Volumn 37, Issue 9, 2010, Pages 1662-1673

  Muyldermans, L ^a   Pang, G ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b NORTHUMBRIA UNIVERSITY   (United Kingdom)

Author keywords

Co collection; Guided local search; Meta heuristics; Multi compartment capacitated arc routing; Separate collection

Indexed keywords

ARC ROUTING; CAPACITATED ARC ROUTING PROBLEM; COMPUTATIONAL EXPERIMENT; GUIDED LOCAL SEARCH; HIGH-QUALITY SOLUTIONS; KEY PROBLEMS; LOCAL SEARCH ALGORITHM; META HEURISTICS; METAHEURISTIC; SPEED-UPS; VEHICLE CAPACITY;

AUTOMOBILES; HEURISTIC METHODS; LEARNING ALGORITHMS; ONLINE SEARCHING; SEPARATION;

CAVITY RESONATORS;

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

References (33)

1. Golden B.L., and Wong R.T. Capacitated arc routing problems. Networks 11 (1981) 305-315
2. Dror M. Arc routing: theory, solutions and applications (2000), Kluwer Academic Publishers, Boston
3. Wøhlk S. A decade of capacitated arc routing. In: Golden B.L., Raghavan S., and Wasil E. (Eds). The vehicle routing problem: latest advances and new challenges. Operations Research/Computer Science Interfaces (2008), Springer, Berlin 29-48
4. Hertz A., Laporte G., and Mittaz M. A tabu search heuristic for the capacitated arc routing problem. Operations Research 48 (2000) 129-135
5. Greistorfer P. A tabu search metaheuristic for the arc routing problem. Computers & Industrial Engineering 44 (2003) 249-266
6. Brandão J., and Eglese R. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research 3 (2008) 1112-1126
7. Hertz A., and Mittaz M. A variable neighbourhood descent algorithm for the undirected arc routing problem. Transportation Science 35 (2001) 425-434
8. Polacek M., Doerner K.F., Hartl R.F., and Maniezzo V. A variable neighbourhood search for the capacitated arc routing problem with intermediate facilities. Journal of Heuristics 14 (2008) 405-423
9. Lacomme P., Prins C., and Ramdane-Cherif W. A genetic algorithm for the capacitated arc routing problem and its extensions. In: Boers E.J.W., et al. (Ed). Applications of evolutionary computing. Lecture Notes in Computer Science Vol. 2037 (2001), Springer, Berlin 473-483
10. Lacomme P., Prins C., and Ramdane-Cherif W. Competitive memetic algorithms for arc routing problems. Annals of Operations Research 131 (2004) 159-185
11. Beullens P., Muyldermans L., Cattrysse D., and Van Oudheusden D. A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research 147 (2003) 629-643
12. Santos L, Coutinho-Rodrigues J, Current JR. An improved ant colony optimization based algorithm for the capacitated arc routing problem. Transportation Research Part B 2010; 44:246-66.
13. Brown G.G., and Graves W.G. Real-time dispatch of petroleum tank trucks. Management Science 27 (1981) 19-31
14. Brown G.G., Ellis C.J., Graves W.G., and Ronen D. Real-time, wide area dispatch of mobil tank trucks. Interfaces 17 (1987) 107-120
15. Avella P., Boccia M., and Sforza A. Solving a fuel delivery problem by heuristic and exact approaches. European Journal of Operations Research 152 (2004) 170-179
16. Cornillier F., Boctor F.F., Laporte G., and Renaud J. A heuristic for the multi-period petrol station replenishment problem. European Journal of Operations Research 191 (2008) 295-305
17. Chajakis E.D., and Guignard M. Scheduling deliveries in vehicles with multiple compartments. Journal of Global Optimization 26 (2003) 43-78
18. Ruiz R., Maroto C., and Alcaraz J. A decision support system for a real vehicle routing problem. European Journal of Operational Research 153 (2004) 593-606
19. El Fallahi A., Prins C., and Wolfer Calvo R. A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers and Operations Research 35 (2008) 1725-1741
20. Apotheker S. Curbside collection: complete separation versus commingled collection. Resource Recycling, October 1990.
21. Platt B., and Zachary J. Co-collection of recyclables and mixed waste: problems and opportunities. (1992), Institute for Local Self-Reliance, DC
22. Jahre M. Logistics systems for recycling-efficient collection of household waste. Ph.D. thesis, Chalmers University of Technology, Sweden, 1995.
23. Muyldermans L, Pang G. On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm. Under review for European Journal of Operations Research 2008.
24. Derigs U, Gottlieb J, Kalkoff J, Piesche M, Rothlauf F, Vogel U. Vehicle routing with compartments: applications, modelling and heuristics. Working paper, University of Cologne, 2008.
25. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
26. Voudouris C., and Tsang E. Guided local search and its application to the travelling salesman problem. European Journal of Operations Research 113 (1999) 469-499
27. Golden B.L., DeArmon J.S., and Baker E.K. Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 10 (1983) 47-59
28. Belenguer J.M., Benavent E., Lacomme P., and Prins C. Lower and upper bounds for the mixed capacitated arc routing problem. Computers and Operations Research 33 (2006) 3363-3383
29. Laporte G, Semet F. Classical heuristics for the capacitated vehicle routing problem. In: Toth P, Vigo D, editors. The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Philadelphia, PA, 2002.
30. Lin S. Computer solutions for the travelling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
31. Muyldermans L., Beullens P., Cattrysse D., and Van Oudheusden D. Exploring variants of 2-opt and 3-opt for the general routing problem. Operations Research 53 (2005) 982-995
32. Kilby P., Prosser P., and Shaw P. Guided local search for the vehicle routing problem. In: Voss S., Martello S., Osman H., and Roucairol C. (Eds). Meta-heuristics: advances and trends in local search paradigms for optimisation (1999), Kluwer Academic Publishers, Boston 473-486
33. Eglese R.W. Routing winter gritting vehicles. Discrete Applied Mathematics 48 (1994) 231-244