In the context of door-to-door transportation of people with disabilities, service quality considerations such as maximum ride time and service time consistency are critical requirements. To identify a good trade-off between these considerations and economic objectives, we define a new variant of the multiperiod dial-a-ride problem called the time-consistent dial-a-ride problem. A transportation planning is supposed to be time consistent if for each passenger, the same service time is used all along the planning horizon. However, considering the numerous variations in transportation demands over a week, designing consistent plans for all passengers can be too expensive. It is therefore necessary to find a compromise solution between costs and time-consistency objectives. The time-consistent dial-a-ride problem is solved using an epsilon-constraint approach to illustrate the trade-off between these two objectives. It computes an approximation of the Pareto front, using a matheuristic framework that combines a large neighbourhood search with the solution of set partitioning problems. This approach is benchmarked on time-consistent vehicle routing problem literature instances. Experiments are also conducted in the context of door-to-door transportation for people with disabilities, using real data. These experiments support managerial insights regarding the inter-relatedness of costs and quality of service.

中文翻译：

---

时间一致的拨号问题

在残疾人门到门运输的背景下，诸如最长乘车时间和服务时间一致性等服务质量考虑是关键要求。为了确定这些考虑因素和经济目标之间的良好权衡，我们定义了多周期拨号问题的一个新变体，称为时间一致拨号问题。如果对于每个乘客，在整个计划范围内使用相同的服务时间，则运输计划应该是时间一致的。然而，考虑到一周内交通需求的众多变化，为所有乘客设计一致的计划可能过于昂贵。因此，有必要在成本和时间一致性目标之间找到一个折中的解决方案。使用 epsilon 约束方法解决了时间一致的拨号问题，以说明这两个目标之间的权衡。它使用将大型邻域搜索与集合划分问题的解决方案相结合的数学框架来计算帕累托前沿的近似值。这种方法以时间一致的车辆路线问题文献实例为基准。还使用真实数据在残疾人门到门运输的背景下进行了实验。这些实验支持有关成本和服务质量相互关联的管理见解。使用将大型邻域搜索与集合划分问题的解决方案相结合的数学框架。这种方法以时间一致的车辆路线问题文献实例为基准。还使用真实数据在残疾人门到门运输的背景下进行了实验。这些实验支持有关成本和服务质量相互关联的管理见解。使用将大型邻域搜索与集合划分问题的解决方案相结合的数学框架。这种方法以时间一致的车辆路线问题文献实例为基准。还使用真实数据在残疾人门到门运输的背景下进行了实验。这些实验支持有关成本和服务质量相互关联的管理见解。