Sciweavers

Share
ENDM
2006

A Two-stage Model for a Day-ahead Paratransit Planning Problem

9 years 6 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
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.
Maria L. A. G. Cremers, Willem K. Klein Haneveld,
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where ENDM
Authors Maria L. A. G. Cremers, Willem K. Klein Haneveld, Maarten H. van der Vlerk
Comments (0)
books