Dynamic truckload truck routing and scheduling in oversaturated demand situations.

Author(s)
Kim, Y. Mahmassani, H.S. & Jaillet, P.
Year
Abstract

The problem considered is dynamic online truckload routing and scheduling with time windows operating in oversaturated conditions, that is, when the demand for service exceeds the system's average capacity. The relationship between computation time and the solution quality, measured by system efficiency and response time, is discussed. A dynamic operation process for implementing various algorithms and procedures is described, with the aim of fully utilizing computational resources without wasting available time between successive demand requests. In addition, particularly when demand arrival rates result in oversaturated system conditions, application of intelligent acceptance and filtering decision procedures that consider system status and demand characteristics can result in significant operational benefits. Simulation experiments conducted to evaluate the relative performance of the proposed approaches confirm the existence of significant improvement potential in terms of both system efficiency and response time over previous approaches.

Request publication

7 + 5 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
C 28179 (In: C 28170 S [electronic version only]) /72 / ITRD E820532
Source

In: Transportation network modeling 2002, Transportation Research Record TRR 1783, p. 66-71, 13 ref.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.