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.

中文翻译：

---

混合列生成和大型邻域搜索解决拨号问题

人口不断老龄化的人口变化导致对专业交通系统的需求不断增加，以补充传统的公共交通方式。通常，用户会提出交通请求，指定接送地点，然后使用小巴或出租车车队来满足这些请求。潜在的优化问题可以建模为拨号问题。在本文考虑的拨号乘车问题中，在考虑时间窗口、最长用户乘车时间、最长路线持续时间和车辆容量限制的同时，总路线成本最小化。我们提出了一种混合列生成和大型邻域搜索算法，并在文献中的一组基准实例上比较了不同的混合策略。