A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city

Expert Systems with Applications

Volumn 40, Issue 14, 2013, Pages 5516-5531

  Muelas, Santiago ^a   Latorre, Antonio ^a,b   Peña, José María ^a  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b INSTITUTO CAJAL   (Spain)

Author keywords

Demand responsive transport; Dial a ride problem; Metaheuristic; Transportation; Variable neighborhood search

Indexed keywords

DEMAND-RESPONSIVE TRANSPORT; DIAL-A-RIDE PROBLEM; METAHEURISTIC; PICKUP AND DELIVERY; PUBLIC TRANSPORTATION COMPANIES; STATE-OF-THE-ART ALGORITHMS; TRANSPORTATION SERVICES; VARIABLE NEIGHBORHOOD SEARCH;

ALGORITHMS; CUSTOMER SATISFACTION; OPTIMIZATION; TRANSPORTATION;

PROBLEM SOLVING;

EID: 84877853461     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2013.04.015     Document Type: Article

References (19)

1. Borndörfer, R., Grötschel, M., Klostermeier, M., & Küttner, C. (1997). Telebus Berlin: Vehicle scheduling in a dial-a-ride system SC 97-23. Technical Report Konrad-Zuse-Zentrum für Informationstechnik Berlin.
2. F. Carrabs, J.-F. Cordeau, and G. Laporte Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading INFORMS Journal on Computing 19 2007 618 632
3. J.-F. Cordeau A branch-and-cut algorithm for the dial-a-ride problem Operations Research 54 2006 573 586 (Pubitemid 43838367)
4. J.F. Cordeau, and G. Laporte A tabu search heuristic for the static multi-vehicle dial-a-ride problem Transportation Research Part B: Methodological 37 2003 579 594 (Pubitemid 36586371)
5. Cordeau, J. -F., Laporte, G., Potvin, J. -Y., & Savelsbergh, M. (2007). Transportation on demand, Handbooks in operations research and management science (Vol. 14, pp. 429-466). Elsevier B. V.
6. F. Cullen, J. Jarvis, and H. Ratliff Set partitioning based heuristics for interactive routing Networks 11 1981 125 143 (Pubitemid 13506978)
7. C. D'Souza, S. Omkar, and J. Senthilnath Pickup and delivery problem using metaheuristics techniques Expert Systems with Applications 39 2012 328 334
8. R.M. Jorgensen, J. Larsen, and K.B. Bergvinsdottir Solving the dial-a-ride problem using genetic algorithms Journal of the Operational Research Society 58 2006 1321 1331
9. 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 für Betriebswirtschaft 58 2008 81 117
10. S.N. Parragh, K.F. Doerner, and R.F. Hartl Variable neighborhood search for the dial-a-ride problem Computers & Operations Research 37 2010 1129 1138
11. S.N. Parragh, K.F. Doerner, R.F. Hartl, and X. Gandibleux A heuristic two-phase solution approach for the multi-objective dial-a-ride problem Networks 54 2009 227 242
12. A. Raghavendra, T. Krishnakumar, R. Muralidhar, D. Sarvanan, and B. Raghavendra A practical heuristic for a large scale vehicle routing problem European Journal of Operational Research 57 1992 32 38
13. K. Rebibo A computer controlled dial-a-ride system. traffic control and transportation systems Proceedings of 2nd IFAC/IFIP/IFORS Symposium Monte Carlo 1974 North-Holland Amsterdam
14. 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)
15. M.W.P. Savelsbergh The vehicle routing problem with time windows: Minimizing route duration INFORMS Journal on Computing 4 1992 146 154
16. G. Taguchi, S. Chowdhury, and Y. Wu Taguchi's quality engineering handbook 2005 John Wiley
17. Wilson, H. J. S., Wang, H., & Higonnet, B. (1971). Scheduling algorithms for dial-a-ride system USL TR-70-13. Technical Report Urban Systms Laboratory, MIT Cambridge, MA.
18. Wilson, H., & Weissberg, H. (1967). Advanced dial-a-ride algorithms research project: Final report R76-20. Technical Report Department of Civil Engineering. MIT Cambridge, MA.
19. J. Xu, and Z. Huang An intelligent model for urban demand-responsive transport system control Journal of Software 4 2009 766 776