The Dynamic Dial-a-Ride Problem with Time Windows in a Competitive Multi-Company Environment

Master thesis (2010)

Authors

Contributors

H.M. Zargayouna (mentor)
M.M. De Weerdt (mentor)
Department
Software Technology (EEMCS) (TU Delft)
Copyright: © 2010 Grootenboers, F.
Transportation Dial-a-ride systems Insertion heuristic Mixed Integer Programming
More Info
expand_more

Published Date

13-01-2010

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Abstract

Door-to-door transportation for elderly and disabled people is for many governments an important instrument to increase the mobility of this group of people. Many issues arise in the implementation of such a system, which is often modeled as the Dynamic Dial-a-Ride System with Time Windows (DDARPTW). One of those issues is that taxi companies try to maximize their profit by combining as many rides as possible. This leads to longer travel times, a measure that is expressed in the service quality of a ride. Our main contribution is a system in which multiple companies compete on service quality to increase the average service quality of the rides. We use an auction mechanism to assign rides to companies and an on-line optimization technique to insert assigned rides into current schedules. To determine an offer for announced requests, we allow companies to use knowledge about the distribution of future requests by the use of a Monte Carlo simulation.