This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Yang, J. Articles by Mahmassani, H. Search for Related Content

Real-Time Multivehicle Truckload Pickup and Delivery Problems

Department of Industrial and Manufacturing Engineering, New Jersey Institute of Technology, Newark, New Jersey 07102
Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
Department of Civil and Environmental Engineering, The University of Maryland, College Park, Maryland 20742
yang{at}adm.njit.edu
jaillet{at}mit.edu
masmah{at}umd.edu

In this paper we formally introduce a generic real-time multivehicle truckload pickup and delivery problem. The problem includes the consideration of various costs associated with trucks' empty travel distances, jobs' delayed completion times, and job rejections. Although very simple, the problem captures most features of the operational problem of a real-world trucking fleet that dynamically moves truckloads between different sites according to customer requests that arrive continuously.

We propose a mixed-integer programming formulation for the offline version of the problem. We then consider and compare five rolling horizon strategies for the real-time version. Two of the policies are based on a repeated reoptimization of various instances of the offline problem, while the others use simpler local (heuristic) rules. One of the reoptimization strategies is new, while the other strategies have recently been tested for similar real-time fleet management problems.

The comparison of the policies is done under a general simulation framework. The analysis is systematic and considers varying traffic intensities, varying degrees of advance information, and varying degrees of flexibility for job-rejection decisions. The new reoptimization policy is shown to systematically outperform the others under all these conditions.

Key Words: truckload trucking; vehicle routing; real-time fleet management; intelligent transportation systems
History: Received: December 2000; revised: November 2001; revised: January 2002; revised: June 2002; revised: November 2002; accepted: December 2002.

This article has been cited by other articles:

				M. A. Figliozzi, H. S. Mahmassani, and P. Jaillet Pricing in Dynamic Vehicle Routing Problems Transportation Science, August 1, 2007; 41(3): 302 - 318. [Abstract] [PDF]

				Z.-L. Chen and H. Xu Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows Transportation Science, February 1, 2006; 40(1): 74 - 88. [Abstract] [PDF]