Abstract
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which requests to subcontract to taxis? We call this problem the day-ahead paratransit planning problem. The developed model is a non-standard two-stage integer recourse model. Both stages consist of two consecutive optimization problems: the clustering of requests into routes, and the assignment of these routes to vehicles. To solve this model, a genetic algorithm approach is used. Computational results are presented for randomly generated data sets.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Attanasio A, Cordeau JF, Ghiani G, Laporte G (2004) Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30: 377–387
Baker B, Ayechew M (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30(5): 787–800
Birge J, Louveaux F (1997) Introduction to stochastic programming. Springer, New York
Borndörfer R, Grötschel M, Klostermeier F, Küttner C (1997) Telebus Berlin: vehicle scheduling in a dial-a-ride system. ZIB Report 97-23
Chu P, Beasley J (1997) A genetic algorithm for the generalized assignment problem. Comput Oper Res 24(1): 17–23
Chu P, Beasley J (1998) A genetic algorithm for the multidimensional knapsack problem. J Heurist 4(1): 63–86
Cordeau JF, Laporte G (2003) The dial-a-ride problem (DARP): variants, modeling issues and algorithms. Q J Belgian French Ital Oper Res Soc 1: 89–101
Cordeau JF, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transport Res Part B 37(6): 579–594
Dawande M, Kalagnanam J, Keskinocak P, Ravi P, Salman F (2000) Approximation algorithnms for the multiple knapsack problem with assignment restrictions. J Combin Optim 4: 171–186
Desrosiers J, Dumas Y, Soumis F, Taillefer S, Villeneuve D (1991) An algorithm for mini-clustering in handicapped transport. Les Cahiers du GERAD, G-91-02, École des Hautes Études Commerciales, Montréal
Feltl H, Raidl G (2004) An improved hybrid genetic algorithm for the generalized assignment problem. In: Proceedings of the 2004 ACM symposium on applied computing, pp 990–995
Gavish B, Pirkul H (1991) Algorithms for the multi-resource generalized assignment problem. Manage Sci 37(6): 695–713
Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading
Holland J (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press
Ioachim I, Desrosiers J, Dumas Y, Solomon M, Villeneuve D (1995) A request clustering algorithm for door-to-door handicapped transportation. Transport Sci 29: 63–78
Jaw JJ, Odoni A, Psaraftis H, Wilson N (1986) A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transport Res Part B 20(3): 243–257
Jørgensen R, Larsen J, Bergvinsdottir K (2007) Solving the dial-a-ride problem using genetic algorithms. J Oper Res Soc 58: 1321–1331
Kall P, Mayer J (2005) Stochastic linear programming: models, theory, and computation. Kluwer, New York
Madsen O, Ravn H, Rygaard J (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann Oper Res 60: 193–208
Mazzola J, Wilcox S (2001) Heuristics for the multi-resource generalized assignment problem. Naval Res Logist 48: 468–483
Reeves C (1993) Modern heuristic techniques for combinatorial problems. Blackwell, New York
Ruszczynski A, Shapiro A (eds) (2003) Stochastic programming, handbooks in operations research and management science, vol 10. North-Holland, Amsterdam
Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transport Sci 31(1): 60–71
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Cremers, M.L.A.G., Klein Haneveld, W.K. & van der Vlerk, M.H. A two-stage model for a day-ahead paratransit planning problem. Math Meth Oper Res 69, 323–341 (2009). https://doi.org/10.1007/s00186-008-0262-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-008-0262-5