The Dynamic Dial-a-Ride Problem with Time Windows in a Competitive Multi-Company Environment
The Dynamic Dial-a-Ride Problem with Time Windows in a Competitive Multi-Company Environment
复制标题
竞争性多公司环境中时间窗的动态叫车问题
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
F. Grootenboers
中科院分区：
文献类型：
--
作者：
F. Grootenboers
对许多政府来说，老年人和残疾人的门到门交通是增加这一群体流动性的重要手段。在实现这样一个系统的过程中会出现许多问题，该系统通常被建模为带有时间窗口的动态拨乘系统（DDARPTW）。其中一个问题是，出租车公司试图通过组合尽可能多的班次来实现利润最大化。这导致了更长的旅行时间，这一衡量标准体现在乘车的服务质量上。我们的主要贡献是一个系统，在这个系统中，多家公司在服务质量上竞争，以提高乘车的平均服务质量。我们使用拍卖机制为公司分配游乐设施，并使用在线优化技术将分配的游乐设施插入当前时间表。为了确定已宣布请求的报价，我们允许公司通过使用蒙特卡罗模拟来使用有关未来请求分布的知识。
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.