Real-time information for improved efficiency of commercial vehicle operations

Intelligent Transportation Systems (ITS) harness advanced communications and computation technologies in order to make transportation systems more efficient. This work is concerned with the application of ITS to commercial vehicle operations and freight mobility; it identifies and investigates potential uses of real-time information for the efficient management of carrier operations. In truckload and less-than-truckload operations, carriers typically know only a portion of the loads that must be moved more than a few hours before the moves must take place. Therefore, the assignment of an available driver to a load takes place in real-time or shortly after the request is received. The load acceptance decision made by a carrier must also be executed in real-time, and may have a significant impact on the carrier's ability to accept other loads requested in the near future. In this context vehicle to load assignments as well as the sequence in which loads are to be served may be revisited as demands unfold and traffic network conditions change. Because of the speed with which decisions must be made, the number of possible choices and the fact that the system is changing dynamically and often, unpredictably, locally oriented decision rules offer a promising alternative to approaches seeking global optimality or those which take into account long term or forecast information. The main hypotheses examined are, that real-time information on vehicle locations and demands can increase the efficiency of carrier fleet operations with respect to measures of trucking company profitability and responsiveness to customer requests, and, that real-time operational strategies perform well, compared to those requiring less real-time information, under certain conditions with respect to fleet size, level of demand and service deadlines. Operational strategies which take advantage of real-time information and, which include methods to perform load acceptance, assignment and re-assignment are examined both analytically, and in simulation framework developed to test these and related strategies under a variety of operating assumptions. Quantitative estimates of the benefits of real-time information for vehicle assignment and routing decisions for trucking operations are developed.

[1]  Nicos Christofides,et al.  EXPECTED DISTANCES IN DISTRIBUTION PROBLEMS , 1969 .

[2]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[3]  Linos F. Frantzeskakis,et al.  A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems , 1990, Transp. Sci..

[4]  Garrett van Ryzin,et al.  Optimal Control of a Multiclass, Flexible Queueing System , 1997, Oper. Res..

[5]  S. A. Nozaki,et al.  Approximations in finite-capacity multi-server queues by Poisson arrivals , 1978, Journal of Applied Probability.

[6]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[7]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[8]  Thomas M. Corsi Motor carrier industry structure and operations , 1994 .

[9]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

[10]  Bruce L. Golden,et al.  OR Forum - Perspectives on Vehicle Routing: Exciting New Developments , 1986, Oper. Res..

[11]  K. W. Knight,et al.  Vehicle Scheduling with Timed and Connected Calls: A Case Study , 1968 .

[12]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[13]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

[14]  Warren B. Powell,et al.  A COMPARATIVE REVIEW OF ALTERNATIVE ALGORITHMS FOR THE DYNAMIC VEHICLE ALLOCATION PROBLEM , 1988 .

[15]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

[16]  Warren B. Powell,et al.  A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers , 1996, Transp. Sci..

[17]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[18]  Irwin M. Jacobs,et al.  The application of a novel two-way mobile satellite communications and vehicle tracking system to the transportation industry , 1991 .

[19]  Michel Gendreau,et al.  Dynamic and Stochastic Models for the Allocation of Empty Containers , 1993, Oper. Res..

[20]  F. Tillman The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[21]  N A Glaskowsky EFFECTS OF DEREGULATION ON MOTOR CARRIERS , 1986 .

[22]  Warren B. Powell,et al.  Stochastic and dynamic networks and routing , 1995 .

[23]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[24]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[25]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[26]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[27]  Warren B. Powell,et al.  Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities , 1994, Transp. Sci..

[28]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[29]  Warren B. Powell,et al.  An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..