An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays

Discrete Applied Mathematics

Volumn 159, Issue 9, 2011, Pages 883-895

  Heilporn, Graldine ^a   Cordeau, Jean Franois ^a   Laporte, Gilbert ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

Dial a Ride Problem; Integer L shaped algorithm; Stochastic programming

Indexed keywords

ACTUAL COST; COMPUTATIONAL EXPERIMENT; CPU TIME; DIAL-A-RIDE PROBLEM; EXPECTED COSTS; HAMILTONIAN TOUR; L-SHAPED; OPTIMAL SOLUTIONS; STOCHASTIC DELAY; TOTAL COSTS;

COSTS; CUSTOMER SATISFACTION; OPTIMAL SYSTEMS; OPTIMIZATION; SALES; STOCHASTIC PROGRAMMING; STOCHASTIC SYSTEMS; TAXICABS;

ALGORITHMS;

EID: 79953220398     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2011.01.021     Document Type: Article

References (24)

1. E. Bartolini, Algorithms for Network Design and Routing Problems, Ph.D. Thesis, Universit di Bologna, 2009.
2. J.F. Benders Partitioning procedures for solving mixed-variables programming problems Numerische Mathematik 4 1962 238 252
3. A.M. Campbell, and B.W. Thomas Probabilistic traveling salesman problem with deadlines Transportation Science 42 2008 1 21
4. A.M. Campbell, and B.W. Thomas Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines Computers & Operations Research 36 2009 1231 1248
5. J.-F. Cordeau A branch-and-cut algorithm for the dial-a-ride problem Operations Research 54 2006 573 586 (Pubitemid 43838367)
6. J.-F. Cordeau, and G. Laporte The dial-a-ride problem: models and algorithms Annals of Operations Research 153 2007 29 46
7. J.-F. Cordeau, G. Laporte, J.-Y. Potvin, and M.W.P. Savelsbergh Transportation on demand C. Barnhart, G. Laporte, Handbook in Operations Research & Management Science vol. 14 2007 Elsevier Amsterdam 429 466
8. J.-F. Cordeau, G. Laporte, M.W.P. Savelsbergh, and D. Vigo Vehicle routing C. Barnhart, G. Laporte, Handbook in Operations Research & Management Science, vol. 14 2007 Elsevier Amsterdam 367 428
9. M. Desrochers, and G. Laporte Improvements and extensions to the MillerTuckerZemlin subtour elimination constraints Operations Research Letters 10 1991 27 36
10. J. Desrosiers, Y. Dumas, and F. Soumis A dynamic programming solution of the large scale single-vehicle dial-a-ride problem with time windows American Journal of Mathematical Management Science 6 1986 301 325 (Pubitemid 17605969)
11. M. Gendreau, G. Laporte, and R. Sguin An exact algorithm for the vehicle routing problem with stochastic demands and customers Transportation Science 29 1995 143 155
12. M. Gendreau, G. Laporte, and R. Sguin Stochastic vehicle routing European Journal of Operational Research 88 1996 3 12 (Pubitemid 126367087)
13. C. Hjorring, and J. Holt New optimality cuts for a single-vehicle stochastic routing problem Annals of Operations Research 86 1999 569 584
14. P. Jaillet, Probabilistic Traveling Salesman Problems, Ph.D. Thesis, Massachusetts Institute of Technology, 1985.
15. P. Jaillet A priori solution of a traveling salesman problem in which a random subset of the customers are visited Operations Research 36 1988 929 936
16. G. Laporte, and F.V. Louveaux The integer L-shaped method for stochastic integer programs with complete recourse Operations Research Letters 13 1993 133 142
17. G. Laporte, F.V. Louveaux, and H. Mercure A priori optimization of the probabilistic traveling salesman problem Operations Research 42 1994 543 549
18. G. Laporte, F.V. Louveaux, and L. Van Hamme An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands Operations Research 50 2002 415 423
19. H.N. Psaraftis A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-a-ride problem Transportation Science 14 1980 130 154
20. H.N. Psaraftis An exact algorithm for the single-vehicle many-to-many dial-a-ride problem with time windows Transportation Science 17 1983 351 357
21. S. Ropke, and J.-F. Cordeau Branch-and-cut-and-price for the pickup and delivery problem with time windows Transportation Science 43 2009 267 286
22. S. Ropke, J.-F. Cordeau, and G. Laporte Models and branch-and-cut algorithms for pickup and delivery problems with time windows Networks 49 2007 258 272 (Pubitemid 47324734)
23. M.W.P. Savelsbergh The vehicle routing problem with time windows: minimizing route duration ORSA Journal on Computing 4 1992 146 154
24. R.M. Van Slyke, and R.J.-B. Wets L-shaped linear programs with applications to optimal control and stochastic programming SIAM Journal of Applied Mathematics 17 1969 638 663