Vehicle routing problems with alternative paths: An application to on-demand transportation

European Journal of Operational Research

Volumn 204, Issue 1, 2010, Pages 62-75

  Garaix, Thierry ^a   Artigues, Christian ^b   Feillet, Dominique ^c   Josselin, Didier ^d  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITÉ DE TOULOUSE   (France)

^c ECOLE DES MINES DE SAINT ETIENNE   (France)

^d UNIVERSITY OF AVIGNON   (France)

Author keywords

Dial a ride problem; Dynamic programming; Multigraph; On demand transportation; Shortest path problem with resource constraints; Vehicle routing

Indexed keywords

DIAL-A-RIDE PROBLEM; MULTIGRAPHS; ON-DEMAND; ON-DEMAND TRANSPORTATION; RESOURCE CONSTRAINT; SHORTEST PATH PROBLEM;

CAVITY RESONATORS; DYNAMIC PROGRAMMING; FLOW MEASUREMENT; MOTOR TRANSPORTATION; ROADS AND STREETS; ROUTING ALGORITHMS; SYSTEMS ENGINEERING; TRAFFIC CONTROL; VEHICLES;

FREIGHT TRANSPORTATION;

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

References (48)

1. Ahuja R.K., Hochbaum D.S., and Orlin J.B. Solving the convex cost integer dual network flow problem. Management Science 49 7 (2003) 950-964
2. Akbar M.M., Rahman M.S., Kaykobad M., Manning E.G., and Shoja G.C. Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls. Computers and Operations Research 33 (2004) 1259-1273
3. Baldacci R., Bodin L., and Mingozzi A. The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Computers and Operations Research 33 9 (2006) 2667-2702
4. Beasley J.E., and Christofides N. An algorithm for the resource constrained shortest path problem. Networks 19 (1989) 379-394
5. Bent R., and Van Henteryck P. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers and Operations Research 33 4 (2006) 875-893
6. Bielli M., Boulmakoul A., and Mouncif H. Object modeling and path computation for multimodal travel systems. European Journal of Operational Research 175 (2006) 1705-1730
7. Colorni A., Dorigo M., Maffioli F., Maniezzo V., Righini G., and Trubian M. Heuristics from nature for hard combinatorial optimization problems. International Transactions in Operational Research 3 (1996) 1-21
8. Cordeau J.-F. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research 54 (2006) 573-586
9. Cordeau J.-F., and Laporte G. The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. 4OR: A Quarterly Journal of Operations Research 1 (2003) 89-101
10. Cordeau J.-F., and Laporte G. A tabu search heuristic algorithm for the static multi-vehicle dial-a-ride problem. Transportation Research B 37 (2003) 579-594
11. Cordeau J.-F., and Laporte G. The dial-a-ride problem: Models and algorithms. Annals of Operations Research 153 1 (2007) 29-46
12. Coslovich L., Pesenti R., and Ukovich W. A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. European Journal of Operational Research 175 (2006) 1605-1615
13. Crainic T.G., and Laporte G. Fleet Management and Logistics (1998), Kluwer, Boston, USA
14. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F., 2002. VRP with pickup and delivery. In: Toth, P., Vigo, D. (Eds.), The Vehicle Routing Problem, Philadelphia, 2002, pp. 225-242.
15. In: Desaulniers G., Desrosiers J., and Solomon M.M. (Eds). Column Generation (2005), Springer
16. Desrochers M., and Soumis F. A generalized permanent labelling algorithm for the shortest path problem with time windows. Transportation Science 26 3 (1988) 191-212
17. Desrosiers J., Dumas Y., Solomon M.M., and Soumis F. Time constrained routing and scheduling. In: Ball M.O., Magnanti T.L., Monna C.L., and Nemhauser G.I. (Eds). Network Routing. Handbooks in Operations Research and Management Science (1995), North-Holland, Amsterdam 35-139
18. Dumas, Y., Desrosiers, J., Soumis, F., 1989. Large scale multi-vehicle dial-a-ride systems. In: GERAD, Ecole des Hautes Etudes Commerciales, Montréal, G-89-30.
19. Dumas Y., Desrosiers J., and Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research 54 (1991) 7-22
20. Ehrgott M., and Gandibleux X. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectrum 22 (2000) 425-460
21. 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 3 (2004) 216-229
22. Guerriero F., and Musmanno R. Label correcting methods to solve multicriteria shortest path problems. Journal of Optimization Theory and Applications 111 3 (2001) 589-613
23. Gutin G., and Punnen A.P. The Traveling Salesman Problem and Its Variations (2002), Kluwer Academic Publishers, Dordrecht
24. Hifi M., Michrafy M., and Sbihi A. A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem. Computational Optimization and Applications 33 (2006) 271-285
25. Horn M.E.T. Multi-modal and demand-responsive passenger transport systems: A modelling framework with embedded control systems. Transportation Research A 36 (2002) 167-188
26. Horn M.E.T. An extended model and procedural framework for planning multi-modal passenger journeys. Transportation Research B 37 (2003) 641-660
27. Irnich S., and Desaulniers G. Shortest path problems with resource constraints. In: Desaulniers G., Desrosiers J., and Solomon M.M. (Eds). Column Generation (2005), Springer 33-66
28. Jaw J.J., Odoni A.R., Psaraftis H.N., and Wilson N.H.M. A heuristic algorithm for the multi-vehicle many-to-many advance request dial-a-ride problem. Transportation Research B 20B (1986) 243-257
29. Jørgensen R.M., Larsen J., and Bergvinsdottir K.B. Solving the dial-a-ride problem using genetic algorithms. Journal of the Operational Research Society 58 (2007) 1321-1331
30. Josselin D., and Genre-Grandpierre C. Des transports à la demande pour répondre aux nouvelles formes de mobilité. le concept de modulobus. In: Montulet B., et al. (Ed). Mobilités et temporalités (2005), University of Saint-Louis, Bruxelles 151-164
31. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer
32. Li, H., Lim, A., 2001. A metaheuristic for the pickup and delivery problem with time windows. In: ICTAI 2001, Dallas, USA, 2001, pp. 160-170.
33. Lu Q., and Dessouky M.M. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science 38 (2004) 503-514
34. Madsen O.B.G., Ravn H.R., and Rygaard J.M. A heuristic algorithm for the a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 60 (1995) 193-208
35. Melachrinoudisa E., Ilhan A.B., and Min H. A dial-a-ride problem for client transportation in a health-care organization. Computers and Operations Research 34 (2007) 742-759
36. Rekiek B., Delchambre A., and Saleh H.A. Handicapped person transportation: An application of the grouping genetic algorithm. Engineering Application of Artificial Intelligence 19 (2006) 511-520
37. Ropke, S., 2005. Heuristic and exact algorithms for vehicle routing problems. PhD Thesis, University of Copenhagen (DIKU), 2005.
38. Ropke S., and Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40 4 (2006) 455-472
39. Ropke S., Cordeau J.-F., and Laporte G. Models and branch-and-cut algorithm for pick-up and delivery problems with time windows. Networks 49 4 (2007) 258-272
40. Savelsbergh M.W.P., and Sol M. DRIVE: Dynamic routing of independent vehicles. Operations Research 46 (1998) 474-490
41. Sbihi, A., 2003. Les méthodes hybrides en optimisation combinatoire: Algorithmes exacts et heuristiques. PhD Thesis, Université Paris 1, 2003.
42. Sexton T., and Bodin L.D. Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling. Transportation Science 19 (1985) 378-410
43. Sexton T., and Bodin L.D. Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing. Transportation Science 19 (1985) 411-435
44. Skriver A.J.V., and Andersen K.A. A label correcting approach for solving bicriterion shortest-path problems. Computers and Operations Research 27 (2000) 507-524
45. Toth, P., Vigo, D., 1996. Fast local search algorithms for the handicapped persons transportation problem. In: Osman, I.H., Kelly, J.P. (Eds.), Meta-heuristics: Theory and Applications, Boston, pp. 677-690.
46. Toth P., and Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 31 (1997) 60-71
47. Warburton A. Approximation of pareto optima in multiple-objective, shortest-path problems. Operations Research 35 (1987) 70-79
48. Xiang Z., Chu C., and Chen H. A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. European Journal of Operational Research 174 2 (2006) 1117-1139