A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances

Lauri Häme () and Harri Hakula ()
Additional contact information
Lauri Häme: Department of Mathematics and Systems Analysis, Aalto University School of Science, 00076 Aalto, Finland
Harri Hakula: Department of Mathematics and Systems Analysis, Aalto University School of Science, 00076 Aalto, Finland

Transportation Science, 2015, vol. 49, issue 2, 295-310

Abstract: 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.

Keywords: dial-a-ride problem; algorithms; dynamic programming (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2013.0495 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:49:y:2015:i:2:p:295-310

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().