Parragh Sophie N, Schmid Verena
Department of Business Administration, University of Vienna, Vienna, Austria.
Comput Oper Res. 2013 Jan;40(1):490-497. doi: 10.1016/j.cor.2012.08.004.
Demographic change towards an ever aging population entails an increasing demand for specialized transportation systems to complement the traditional public means of transportation. Typically, users place transportation requests, specifying a pickup and a drop off location and a fleet of minibuses or taxis is used to serve these requests. The underlying optimization problem can be modeled as a dial-a-ride problem. In the dial-a-ride problem considered in this paper, total routing costs are minimized while respecting time window, maximum user ride time, maximum route duration, and vehicle capacity restrictions. We propose a hybrid column generation and large neighborhood search algorithm and compare different hybridization strategies on a set of benchmark instances from the literature.
人口结构向老龄化转变，对专门的交通系统的需求日益增加，以补充传统公共交通方式。通常，用户提交交通请求，指定接送地点，然后使用小型巴士或出租车车队来满足这些请求。潜在的优化问题可以建模为一个电话预约出行问题。在本文所考虑的电话预约出行问题中，在遵守时间窗、最大用户乘车时间、最大路线时长和车辆容量限制的同时，使总路线成本最小化。我们提出了一种混合列生成和大邻域搜索算法，并在一组来自文献的基准实例上比较了不同的混合策略。
