A dynamic day-ahead paratransit planning problem
Abstract We consider a dynamic planning problem for the transport of elderly and disabled people. The focus is on a decision to make one day ahead: which requests to serve with own vehicles, and which ones to assign to subcontractors, under uncertainty of late requests which are gradually revealed during the day of operation. We call this problem the Dynamic Day-ahead Paratransit Planning problem. The developed model is a nonstandard two-stage recourse model in which ideas from stochastic programming and online optimization are combined: in the first stage clustered requests are assigned to vehicles, and in the dynamic second-stage problem an event-driven approach is used to cluster the late requests once they are revealed and subsequently assign them to vehicles. A genetic algorithm is used to solve the model. Computational results are presented for randomly generated data sets. Furthermore, a comparison is made to a similar problem we studied earlier in which the simplifying but unrealistic assumption has been made that all late requests are revealed at the beginning of the day of operation.
|Date of creation:||2007|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +31 50 363 7185
Fax: +31 50 363 3720
Web page: http://som.eldoc.ub.rug.nl/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
When requesting a correction, please mention this item's handle: RePEc:dgr:rugsom:07010. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joke Bulthuis)
If references are entirely missing, you can add them using this form.