Dynamic Vehicle Routing

SB35.1 Routing On-Line Service Orders Dynamically

• Buyang Cao; ESRI, Inc., 380 New York St., Redlands, CA 92373; bcao@esri.com
• Burcin Bozkaya; ESRI, 380 New York St., Redlands, CA 92373; bbozkaya@esri.com

We present an e-tailer system that accepts the on-line service orders, assigns the orders to the service persons and routes the service orders dynamically. The core algorithms of the system are discussed, and the system architecture is described.

SB35.2 withdrawn 10/27: Territory Planning & Vehicle Dispatching with Stochastic Custers & Demand

• Hongsheng Zhong; University of Southern California, Dept. ISE, Los Angeles, CA 90089-0193; hzhong@ups.com

SB35.3 Analysis of Day-to-Day Network Flow Evolution in Transportation Networks: Some Simulation Experiments

• Karthik Srinivasan; Vanderbilt University, Dept. of Civil & Environ. Eng., 206B Jacobs Hall, Nashville, TN 37235; karthik.k.srinivasan@vanderbilt.edu

We investigate the phenomenon day-to-day dynamics in transportation networks. In this study, realistic user-behavior rules (calibrated and validated in earlier studies) are used to simulate network evolution both within-day and day-to-day. The results are compared against conventional benchmarks: time-dependent user equilibrium and system optimal performance.

SB35.4 Dynamic Coordination for Load-Constrained Vehicle Routing with Uncertain Demands

• Alan L. Erera; Georgia Institute of Technology, Sch. of ISyE, Atlanta, GA 30332-0205; alan.erera@isye.gatech.edu
• Carlos F. Daganzo; University of California, Dept. of CEE, 109 McLaughlin Hall #1720, Berkeley, CA 94720-1720; daganzo@ce.berkeley.edu

We consider a single-period load-constrained VRP in which customer lot sizes are uncertain when planning. Operating strategies that utilize dynamic coordination can reduce costs (fleet and distance) substantially over traditional non-coordinated a priori strategies. We analyze coordinated strategies using an approximation approach, and verify results via simulation.