首页> 外文期刊>Expert systems with applications >The balanced dispatching problem in passengers transport services on demand
【24h】

The balanced dispatching problem in passengers transport services on demand

机译:乘客运输服务的平衡调度问题按需

获取原文
获取原文并翻译 | 示例

摘要

In the passengers' transport services on demand, such as taxi services, a dispatching solution determines the service quality level and the incomes received by both drivers and the transport company. In the last years, related work has been mainly focused on improving the service quality. However, the drivers' incomes balancing is still a challenge, especially for emerging economies. To address this situation, we introduce the balanced dispatching problem in passengers transport services (BDP-PTS) on demand, which seeks a dispatching solution that aims to minimize the variance of the incomes per unit of working time among the drivers. We propose five easy-to-implement online dispatching algorithms, which rely on dispatching rules obtained from the variance analysis and explore the performance measures for a dispatching solution provided by them. Those algorithms consider the BDP-PTS under an offline scenario, where all the information is revealed beforehand, and the maximum number of solicited transport services is performed. We are focused on a specific set of instances, called complete, which admit at least a feasible solution where all requested transport services are performed. Consequently, we prove the NP-completeness in the strong sense of the BDP-PTS under an offline scenario for these instances, and formulate a mixed integer quadratic programming (MIQP) model to solve it. This complexity computation status implies that no polynomial or pseudo time algorithms exist for solving it, unless P = NP, involving an important quantity of running time and memory resources to model and to resolve it in an empirical computation. Finally, computational experiments are carried out to compare the proposed online dispatching algorithms and the MIQP model on datasets of real complete instances from a Chilean transport company. The obtained results show that the proposed online dispatching algorithm based on the dispatching rule, called SRV, is able to reduce more efficiently the income dispersion among drivers within reduced running times, assigning over a 98% of total solicited transport service and allowing a practical implementation into an automated dispatching system on a basic hardware infrastructure, as it is the case of the transport companies in developing countries.
机译:在对需求的旅客运输服务,如出租车服务,调度解决方案来确定的服务质量水平,由司机和运输公司获得的收入。在过去的几年中,相关工作已主要集中在提高服务质量。然而,司机的收入平衡仍然是一个挑战,特别是对新兴经济体。为了应对这种情况,我们在旅客运输服务(BDP-PTS)的需求,从而寻求一个解决方案调度,旨在收入的方差最小化工作的动力之一时间单位引入平衡调度问题。我们提出五个简单到实行网上调度算法,依靠调度从方差分析得到的规则和探索绩效措施,由他们提供的调度方案。这些算法考虑BDP-PTS离线情况下,所有的信息事先透露下,进行的应征运输服务的最大数量。我们专注于一组特定的情况下,所谓的完整,其承认至少在执行所有请求的运输服务可行的解决方案的。因此,我们证明了在BDP-PTS感强的NP完全性的这些实例脱机的情况下,制定一个混合整数二次规划(MIQP)模式来解决它。这种复杂的计算状态意味着,解决它,除非P = NP,涉及运行时间和内存资源模型的一个重要的量不存在多项式或伪时间算法和经验计算来解决这个问题。最后,计算实验都进行了真实完整的实例数据集所提出的在线调度算法和模型MIQP从智利运输公司进行比较。得到的结果表明,基于该调度规则,称为SRV提出的在线调度算法,能够减少缩短运行时间内更有效地驱动器之间的收入差别,分配在总应征运输服务的98%,并允许实际执行到自动化的基本硬件基础设施调度系统,因为它是运输公司在发展中国家的情况。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号