期刊
TRANSPORTATION SCIENCE
卷 49, 期 2, 页码 295-310出版社
INFORMS
DOI: 10.1287/trsc.2013.0495
关键词
dial-a-ride problem; algorithms; dynamic programming
资金
- Finnish Funding Agency for Technology and Innovation
- Finnish Ministry of Transport and Communications
- Helsinki Region Transport
The dial-a-ride problem (DARP) involves the dispatching of a fleet of vehicles to transport customers requesting service and is one of the most challenging tasks of combinatorial optimization. We study the DARP as a constraint satisfaction problem, where the goal is to find a feasible solution with respect to the time, capacity, and precedence constraints, or to prove infeasibility. The main contribution of our work is a new robust method for this problem formulation. The algorithm is based on a dynamic subroutine that finds for any set of customers a maximum cluster, that is, a maximal set of customers that can be served by a single vehicle. The performance of the algorithm is analyzed and evaluated by means of computational experiments, justifying the efficiency of the solution method.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据