Routing

SB25.1 Solving Vehicle Routing Problems with Soft Time Windows

• Robert A. Russell; University of Tulsa, Finance & OM Dept., 600 South College Ave., Tulsa, OK 74104-3189; rrussell@utulsa.edu
• Wen-Chyuan Chiang; University of Tulsa, Finance & OM Dept., 600 South College Ave., Tulsa, OK 74104-3189; wen-chyuan-chiang@utulsa.edu

We examines VRPs with soft time windows. We compare the effectiveness of classic ejection chain techniques with a TS metaheuristic employing advanced recovery strategies. We also explore the applicability of smoothing transformations to time window problems.

SB25.2 A Heuristic Approach to the Period Vehicle Routing Problem

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

We present a model and a heuristic algorithm for solving the period vehicle routing problem. We develop a two-phase cluster-and-schedule where we implement TS in both phases. We integrate this algorithm with a client-server DSS and develop visit schedules for a major elevator manufacturer.

SB25.3 Capacity-Sharing Strategies for Stochastic Vehicle Routing Problems

• Alan L. Erera; University of California, 109 McLaughlin Hall #1720, Berkeley, CA 94720-1720; alerera@ieor.berkeley.edu

A new family of operating strategies for single-period stochastic VRPs based on capacity sharing is proposed and preliminary analysis is reported. The estimation of expected operating costs and near-optimal configuration of systems is discussed.

SB25.4 withdrawn - author request of 10/8

• Anulark Pinnoi; Asian Institute of Technology, ISE Program, PO Box 4, Klongluang, Patumtani, 12120 , Thailand; anulark@ait.ac.th
• Ha Dang Son; Asian Institute of Technology, ISE Program, PO Box 4, Klongluang, Patumtani, 12120 , Thailand;