A dynamic day-ahead paratransit planning problem
| Autor: | Willem K. Klein Haneveld, Maria L. A. G. Cremers, Maarten H. van der Vlerk |
|---|---|
| Přispěvatelé: | Research programme OPERA, Faculty of Economics and Business |
| Jazyk: | angličtina |
| Rok vydání: | 2010 |
| Předmět: |
Mathematical optimization
Focus (computing) paratransit transport Operations research Computer science TIME WINDOWS Applied Mathematics Strategy and Management ALGORITHMS Disabled people Management Science and Operations Research Cluster (spacecraft) Stochastic programming Management Information Systems Dynamic planning TRANSPORTATION stochastic programming Online optimization Modeling and Simulation Genetic algorithm A-RIDE PROBLEM Paratransit General Economics Econometrics and Finance online optimization |
| Zdroj: | IMA Journal of Management Mathematics, 21(2), 195-211 |
| DOI: | 10.1093/imaman/dpp007 |
| Popis: | 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 that 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 simulation 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|