A Fast, Auction-Based Algorithm for Paratransit Vehicle Assignment

Abstract

A problem based on the actual passenger transportation operations of two community disability service organizations in St. Paul is presented. The problem is to minimize the number of routes needed to serve all the passengers subject to spatial and temporal constraints on the routing of vehicles. Additional problem characteristics include heterogeneous vehicle and passenger classes, multiple destinations, separate "runs" defined by service time windows, and rules governing the embarkment as well as maximum travel times. Here we develop a method able to generate a good problem solution within a reasonable amount of time to guide these companies' operations.

Early attempts at problem solution reveal facets of its structure and illuminate an inherent trade-off between vehicle capacity and uninhibited vehicle operating time. To address this, the method proposed uses high-capacity vehicles to serve routes in both runs while allotting easily served passengers to these vehicles to relieve temporal constraints. This heuristic carries the additional advantage of partitioning the rest of the solution into two single-run problems, and the decrementing adaptive memory program (DAMP) is devised as a way of discovering solution components and promoting those more effective at producing good solutions to be used in future attempts. When applied to a data set provided by the organizations, the algorithm improved the current benchmark solution, generated by hand, by over 12% in reasonable operating time, serving 574 passengers with 64 routes in 53 vehicles. Its absolute measure of quality, in light of lower bounds that were constructed, is also considered good.