A General Vehicle Routing Problem

European Journal of Operational Research

Volumn 191, Issue 3, 2008, Pages 650-660

  Goel, Asvin ^a,b   Gruhn, Volker ^b  

^a MIT Zaragoza International Logistics Program   (Spain)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Large Neighbourhood Search; Pickup and Delivery Problem; Variable Neighbourhood Search; Vehicle Routing Problem

Indexed keywords

CONSTRAINT THEORY; COSTS; GROUND VEHICLES; VEHICLE ROUTING;

LARGE NEIGHBOURHOOD SEARCH; PICKUP AND DELIVERY PROBLEMS; VARIABLE NEIGHBOURHOOD SEARCH; VEHICLE ROUTING PROBLEMS;

PROBLEM SOLVING;

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

References (24)

1. Antes, J., Derigs, U., 1995. A new parallel tour construction algorithm for the vehicle routing problem with time windows. Department of Information Systems and Operations Research, University of Cologne, Cologne, Germany.
2. Bräysy O., and Gendreau M. Vehicle routing problem with time windows. Part I: Route construction and local search algorithms. Transportation Science 39 1 (2005) 104-118
3. Bräysy O., and Gendreau M. Vehicle routing problem with time windows. Part II: Metaheuristics. Transportation Science 39 1 (2005) 119-139
4. Campbell A., and Savelsbergh M. Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science 38 3 (2004) 369-378
5. Cordeau J.-F., Desaulniers G., Desrosiers J., Solomon M., and Soumis F. VRP with time windows. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem (2002), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia 157-193
6. Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.-S., 2004. New heuristics for the vehicle routing problem. Les Cahiers du GERAD, G-2004-33, HEC Montréal, Canada.
7. Feillet D., Dejax P., and Gendreau M. Traveling Salesman Problems with Profits. Transportation Science 39 2 (2005) 188-205
8. Fleischmann B., Gnutzmann S., and Sandvoß E. Dynamic vehicle routing based on on-line traffic information. Transportation Science 38 4 (2004) 420-433
9. Hansen, P., Mladenović, N., 2003. A tutorial on Variable Neighborhood Search. Les Cahiers du GERAD, G-2003-46, HEC Montréal, Canada.
10. Hasle, G., 2003. Heuristics for rich VRP models. Presented at the Seminar at GERAD, 30.10.2003, Montréal, Canada.
11. Heckmann, M., 2002. DV-gestütztes Geschäftsprozeßmanagement in der Luftfrachtlogistik. Dissertation, Shaker Verlag Aachen.
12. Kilby P., Prosser P., and Shaw P. A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Constraints 5 (2000) 389-414
13. Laporte G., and Semet F. Classical heuristics for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem (2002), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia 109-128
14. Mitrović-Minić, S., 1998. Pickup and delivery problem with time windows: A survey. Technical report TR 1998-12, School of Computing Science, Simon Fraser University, Burnaby, BC, Canada.
15. Mladenović N., and Hansen P. Variable Neighborhood Search. Computers and Operations Research 24 (1997) 1097-1100
16. Polacek M., Hartl R., Doerner K., and Reimann M. A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics 10 (2004) 613-627
17. Powell W., Snow W., and Cheung R. Adaptive labeling algorithms for the dynamic assignment problem. Transportation Science 34 1 (2000) 50-66
18. Psaraftis H. Dynamic vehicle routing problems. In: Golden B., and Assad A. (Eds). Vehicle routing: Methods and studies (1988), North-Holland, Amsterdam 233-248
19. Psaraftis H. Dynamic vehicle routing: Status and prospects. Annals of Operations Research 61 (1995) 143-164
20. Savelsbergh M., and Sol M. The general pickup and delivery problem. Transportation Science 29 1 (1995) 17-30
21. Savelsbergh M., and Sol M. DRIVE: Dynamic routing of independent vehicles. Operations Research 46 (1998) 474-490
22. Schönberger J., Kopfer H., and Mattfeld H. A combined approach to solve the pickup and delivery selection problem. Operations Research Proceedings 2002 (2002), Springer 150-155
23. Shaw, P., 1997. A new local search algorithm providing high quality solutions to vehicle routing problems. Technical report, APES group, Department of Computer Sciences, University of Strathclyde, Glasgow, Scottland.
24. Yang J., Jaillet P., and Mahmassani H. Real-time multi-vehicle truckload pickup-and-delivery problems. Transportation Science 38 2 (2004) 135-148