| edoc-Server der Humboldt-Universität zu Berlin |
| Author(s): |
Maria L.A.G. Cremers, University of Groningen Willem K. Klein Haneveld, University of Groningen Maarten H. van der Vlerk, University of Groningen | Title: | A dynamic day-ahead paratransit planning problem |
| Date of Acceptance: | 06.03.2008 |
| Submission Date: | 04.10.2007 |
| Series Title: |
Stochastic Programming E-Print Series (SPEPS) |
| Editors: | Julie L. Higle; Werner Römisch; Surrajeet Sen |
| Complete Preprint: | pdf (urn:nbn:de:kobv:11-10086937) |
| Keywords (eng): | stochastic programming, paratransit transport, online optimization |
| Metadata export:
|
Endnote Bibtex |
| print on demand:
|
|
| Diese Seite taggen:
|
| Abstract (eng): | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| 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 non- standard 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. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Access Statistics:
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly. To see the detailled access numbers please move the mouse pointer over the single bars of the digaram. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Gesamtzahl der Zugriffe seit May 2011:
|
|
| |||