On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm

European Journal of Operational Research

Volumn 206, Issue 1, 2010, Pages 93-103

  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 routing; Routing; Separate collection

Indexed keywords

COMPUTATIONAL RESULTS; GUIDED LOCAL SEARCH; KEY PROBLEMS; LOCAL SEARCH; META HEURISTICS; METAHEURISTIC; MULTIPLE COMPARTMENTS; SOLUTION QUALITY; SPEED-UPS; VEHICLE CAPACITY; VEHICLE ROUTING PROBLEMS;

AUTOMOBILES;

VEHICLES;

EID: 77950022935     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.02.020     Document Type: Article

References (30)

1. Apotheker S. Curbside collection: Complete separation versus commingled collection. Resource Recycling October (1990)
2. Avella P., Boccia M., and Sforza A. Solving a fuel delivery problem by heuristic and exact approaches. European Journal of Operational Research 152 (2004) 170-179
3. Bentley J.L. Fast algorithms for geometric travelling salesman problems. ORSA Journal on Computing 4 (1992) 387-411
4. 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
5. Brown G.G., and Graves W.G. Real-time dispatch of petroleum tank trucks. Management Science 27 (1981) 19-31
6. 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
7. Chajakis E.D., and Guignard M. Scheduling deliveries in vehicles with multiple compartments. Journal of Global Optimisation 26 (2003) 43-78
8. Christofides N., Mingozzi A., and Toth P. The vehicle routing problem. In: Christofides N., Mingozzi A., Toth P., and Sandi C. (Eds). Combinatorial Optimisation (1979), John Wiley and Sons, Chichester 315-338
9. 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
10. Cornillier F., Boctor F.F., Laporte G., and Renaud J. A heuristic for the multi-period petrol station replenishment problem. European Journal of Operational Research 191 (2008) 295-305
11. Dantzig G.B., and Ramser J.H. The truck dispatching problem. Management Science 6 (1959) 80-91
12. El Fallahi A., Prins C., and Wolfler Calvo R. A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers and Operations Research 35 (2008) 1725-1741
13. Golden B., Wasil E., Kelly J., and Chao I. The impact of meta-heuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. In: Crainic T.G., and Laporte G. (Eds). Fleet Management and Logistics (1998), Kluwer, Boston, MA 33-56
14. Jahre, M., 1995. Logistics systems for recycling-efficient collection of household waste. Ph.D. thesis, Chalmers University of Technology, Sweden.
15. Johnson D.S., and McGeoch L.A. The travelling salesman problem: A case study. In: Aarts E., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimisation (1997), John Wiley and Sons, Chichester 215-310
16. 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
17. Laporte G., Gendreau M., Potvin J.Y., and Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7 (2000) 285-300
18. Laporte, G., Semet, F., 2002. Classical heuristics for the capacitated vehicle routing problem. In: Toth, P., Vigo, D., (Eds.), The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA.
19. Latiffianti E., 2009. Parameter setting in a Guided Local Search Heuristic for the Capacitated Vehicle Routing Problem. M.Sc. Dissertation, Business School, Nottingham University, UK.
20. Li F., Golden B., and Wasil E. Very large scale vehicle routing: New test problems, algorithms, and results. Computers and Operations Research 32 (2005) 1165-1179
21. Lin S. Computer solutions for the travelling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
22. Mester, D., Bräysy, O., 2004. Active guided evolution strategies for large scale vehicle routing problems. Working Paper, University of Haifa, Israel.
23. 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
24. Platt, B., Zachary, J., 1992. Co-collection of recyclables and mixed waste: Problems and opportunities. Institute for Local Self-Reliance, ILSR Washington, DC.
25. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31 (2004) 1985-2002
26. Savelsbergh, M.W.P., 1988. Computer aided routing. Ph.D. thesis, Centrum voor Wiskunde en Informatica, Amsterdam.
27. Tarantilis C.D. Solving the vehicle routing problem with adaptive memory programming methodology. Computers and Operations Research 32 (2005) 2309-2327
28. Toth, P., Vigo, D., 2002. The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA.
29. Toth P., and Vigo D. The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing 15 (2003) 333-346
30. Voudouris C., and Tsang E. Guided local search and its application to the travelling salesman problem. European Journal of Operational Research 113 (1999) 469-499