Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation

Computers and Operations Research

Volumn 38, Issue 10, 2011, Pages 1435-1442

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

^a POLITECNICO DI TORINO   (Italy)

^b LAAS CNRS   (France)

^c UNIVERSITÉ DE TOULOUSE   (France)

^d ECOLE DES MINES DE SAINT ETIENNE   (France)

^e UNIVERSITY OF AVIGNON   (France)

Author keywords

Column generation; Dial a ride problem; Linear fractional program; On demand transportation; Vehicle routing

Indexed keywords

COLUMN GENERATION; COLUMN GENERATION APPROACH; DIAL-A-RIDE PROBLEM; LINEAR FRACTIONAL PROGRAM; LINEAR FRACTIONAL PROGRAMMING; OBJECTIVE FUNCTIONS; OCCUPANCY RATE; ON-DEMAND TRANSPORTATION; SET PARTITIONING; TIME OPTIMIZATION; TRANSPORTATION SYSTEM;

OPTIMIZATION;

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

References (29)

1. Josselin D, Genre-Grandpierre C. Les transports la demande pour rpondre aux nouvelles formes de mobilit. le concept de modulobus. In: Montulet B, Hubert M, Jemelin C, Schmitz S, editors. Mobilits et temporalits. Bruxelles: Facults Universitaires Saint-Louis; 2005. p. 15164.
2. J.-F. Cordeau, and G. Laporte The dial-a-ride problem (DARP): variants, modeling issues and algorithms 4OR 1 2003 89 101
3. J.-F. Cordeau, and G. Laporte The dial-a-ride problem: models and algorithms Annals of Operations Research 153 1 2007 29 46
4. G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems: a classification scheme and survey TOP 15 2007 1 31
5. S.N. Parragh, K.F. Doerner, and R.F. Hartl A survey on pickup and delivery problems. Part I: transportation between customers and depot Journal fr Betriebswirtschaft 58 1 2008 21 51
6. S.N. Parragh, K.F. Doerner, and R.F. Hartl A survey on pickup and delivery problems. Part II: transportation between pickup and delivery locations Journal fr Betriebswirtschaft 58 2 2008 81 117
7. Golden B, Raghavan S, Wasil E. The vehicle routing problem: latest advances and new challenges OR/CS interfaces, vol. 43. Springer; 2008.
8. Desaulniers G, Desrosiers J, Erdmann A, Solomon MM, Soumis F. VRP with pickup and delivery. In: Toth P, Vigo D, editors. The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Philadelphia; 2002. p. 22542.
9. T.G. Crainic, and G. Laporte Fleet management and logistics 1998 Kluwer Boston, USA
10. M.A. Boschetti, A. Mingozzi, and S. Ricciardelli A dual ascent procedure for the set partitioning problem Discrete Optimization 5 2008 735 747
11. S. Ropke, and J.-F. Cordeau Branch-and-cut-and-price for the pickup and delivery problem with time windows Transportation Science 43 3 2009 267 286
12. Parragh SN, Cordeau J-F, Doerner KF, Hartl RF. Models and algorithms for the heterogeneous previous termdial-a-ridenext term problem with driver related constraints. Technical Report, University of Vienna, Faculty of Business, Economics and Statistics, 2009.
13. J.-F. Cordeau, and G. Laporte A tabu search heuristic algorithm for the static multi-vehicle dial-a-ride problem Transportation Research B 37 2003 579 594 (Pubitemid 36586371)
14. J.-F. Cordeau A branch-and-cut algorithm for the dial-a-ride problem Operations Research 54 3 2006 573 586 (Pubitemid 43838367)
15. Dumas Y, Desrosiers J, Soumis F. Large scale multi-vehicle dial-a-ride systems. Technical Report, GERAD, cole des Hautes tudes Commerciales, Montral; 1989.
16. M.W.P. Savelsbergh, and M. Sol DRIVE: dynamic routing of independent vehicles Operations Research 46 1998 474 490 (Pubitemid 128665758)
17. G. Desaulniers, J. Desrosiers, and M.M. Solomon Column generation 2005 Springer
18. T. Garaix, C. Artigues, D. Feillet, and D. Josselin Vehicle routing problems with alternative paths: an application to on-demand transportation European Journal of Operational Research 204 1 2010 62 75
19. D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems Networks 44 3 2004 216 229 (Pubitemid 39301560)
20. Sol M. Column generation techniques for pickup and delivery problems. PhD thesis, Technische Universitet Eindhoven; 1994.
21. A. Charnes, and W.W. Cooper Programming with linear fractional functions Naval Research Logistics Quart 9 1962 181 186
22. W. Dinkelbach On nonlinear fractional programming Management Science 13 7 1967 492 498
23. M.S. Bazaraa, H.D. Sherali, and C.M. Shetty Nonlinear programming: theory and algorithms 3rd ed 2006 Wiley-interscience Hoboken, New Jersey
24. B. Jaumard, P. Hansen, and M. Poggi de Aragao Column generation methods for probabilistic logic ORSA Journal on Computing 3 1991 135 148
25. P.C. Gilmore, and R.E. Gomory A linear programming approach to the cutting stock problempart II Operations Research 11 6 1963 863 888
26. Lasdon LS. Optimization Theory for Large Systems. MacMillan Series in Operations Research; 1970.
27. Li H, Lim A. A metaheuristic for the pickup and delivery problem with time windows. In: 13th IEEE international conference on tools with artificial intelligence (ICTAI) 2001, Dallas, USA, 2001. p. 16070.
28. S. Ropke, J.-F. Cordeau, and G. Laporte Models and branch-and-cut algorithm for pick-up and delivery problems with time windows Networks 49 4 2007 258 272 (Pubitemid 47324734)
29. Garaix T, Josselin D, Feillet D, Artigues C, Castex E. Point-to-point on-demand transportation in a rural areas. A route optimisation method. Cybergeo, 2007. A Selection of the best Articles (SAGEO 2005). Article 396 online: 〈 http://www.cybergeo.eu/index11373.html 〉.