Competitive Performance Assessment of Dynamic Vehicle Routing Technologies Using Sequential Auctions

Technologies for a dynamic truckload pickup-and-delivery problem in a competitive environment by use of sequential auctions are compared. In this environment, demands arrive randomly over time and are described by pickup-and-delivery locations and hard time windows. On demand arrival, carriers compete for the loads in a second-price auction. Four fleet assignment technologies with different degrees of sophistication are tested with simulations. The technologies differ in how they deal with the combinatorial and stochastic elements of the online problem. A one-step look-ahead dynamic vehicle routing technology that tries to estimate the impacts of current decisions on serving future loads (not yet arrived) is introduced. The performance of each technology is analyzed in relation to different demand characteristics.

[1]  Warren B. Powell,et al.  A Stochastic Model of the Dynamic Vehicle Allocation Problem , 1986, Transp. Sci..

[2]  Jian Yang,et al.  Real-Time Multivehicle Truckload Pickup and Delivery Problems , 2004, Transp. Sci..

[3]  Hani S. Mahmassani,et al.  Modeling Carrier Behavior in Sequential Auction Transportation Markets , 2003 .

[4]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[5]  Hani S. Mahmassani,et al.  Dynamic Decision Making for Commercial Fleet Operations Using Real-Time Information , 1996 .

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

[7]  Hani S. Mahmassani,et al.  Evaluation of Dynamic Fleet Management Systems: Simulation Framework , 1998 .

[8]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[9]  Hani S. Mahmassani,et al.  DYNAMIC DISPATCHING STRATEGIES UNDER REAL-TIME INFORMATION FOR CARRIER FLEET MANAGEMENT , 1996 .

[10]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

[11]  Hani S. Mahmassani,et al.  Dynamic Truckload Truck Routing and Scheduling in Oversaturated Demand Situations , 2002 .

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

[13]  Hani S. Mahmassani,et al.  On-Line Algorithms for Truck Fleet Assignment and Scheduling Under Real-Time Information , 1999 .

[14]  Hani S. Mahmassani,et al.  Local Optimization Approaches to Solve Dynamic Commercial Fleet Management Problems , 2000 .

[15]  E. Maasland,et al.  Auction Theory , 2021, Springer Texts in Business and Economics.

[16]  Amelia C. Regan,et al.  Freight Operators’ Perceptions of Congestion Problems and the Application of Advanced Technologies: Results from a 1998 Survey of 1200 Companies Operating in California , 1999 .

[17]  Warren B. Powell,et al.  On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance , 2000, Transp. Sci..

[18]  Hani S. Mahmassani,et al.  Framework for Study of Carrier Strategies in Auction-Based Transportation Marketplace , 2003 .

[19]  Warren B. Powell,et al.  Adaptive Labeling Algorithms for the Dynamic Assignment Problem , 2000, Transp. Sci..

[20]  Warren B. Powell,et al.  THE DYNAMIC VEHICLE ALLOCATION PROBLEM WITH UNCERTAIN DEMANDS , 1987 .