On Decision Model Adaptation in Online Optimization of a Transport System

This article is about the enhancement of myopic online decision approaches for considering longer term planning goals in the management of logistic processes in a dynamically varying environment. By means of a demand peak we simulate a severe disruption of the environment of a transport system and show that a pure myopic scheduling strategy is not able to ensure an acceptable service level in such a situation. As a remedy, we propose to adapt automatically the short term decision behaviour of the used decision making algorithm. We anticipate the instantiation of a reasonable number of decision variables in a model pre-processing step in order to break the rule of selecting the least cost but also low quality decision alternatives. Within several numerical experiments we prove the applicability and suitability of our approach.

[1]  Harilaos N. Psaraftis,et al.  Dynamic vehicle routing: Status and prospects , 1995, Ann. Oper. Res..

[2]  Jörn Schönberger Operational Freight Carrier Planning: Basic Concepts, Optimization Models and Advanced Memetic Algorithms , 2005 .

[3]  Dimitris Bertsimas,et al.  The probabilistic vehicle routing problem , 1988 .

[4]  A R Odoni,et al.  THE PROBABILISTIC VEHICLE ROUTING PROBLEM. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[5]  Roberto Musmanno,et al.  Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies , 2003, Eur. J. Oper. Res..

[6]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[7]  Gilbert Laporte,et al.  Ambulance location and relocation models , 2000, Eur. J. Oper. Res..

[8]  Mikkel T. Jensen,et al.  Robust and Flexible Scheduling with Evolutionary Computation , 2001 .

[9]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[10]  Sven O. Krumke,et al.  Online Optimization: Competitive Analysis and Beyond , 2002 .

[11]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[12]  Michel Gendreau,et al.  DYNAMIC VEHICLE ROUTING AND DISPATCHING , 1998 .

[13]  Bernhard Fleischmann,et al.  Dynamic Vehicle Routing Based on Online Traffic Information , 2004, Transp. Sci..

[14]  Xin Yao,et al.  Fast Evolution Strategies , 1997, Evolutionary Programming.

[15]  Ilias P. Tatsiopoulos,et al.  Design of an IT-driven decision support system for vehicle routing and scheduling , 2004, Eur. J. Oper. Res..

[16]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

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

[18]  Stefan Voß,et al.  Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem , 2004, Transp. Sci..

[19]  Sandy Irani,et al.  On-Line Algorithms for the Dynamic Traveling Repair Problem , 2002, SODA '02.

[20]  Gilbert Laporte,et al.  Waiting strategies for the dynamic pickup and delivery problem with time windows , 2004 .

[21]  Alan Slater,et al.  Specification for a dynamic vehicle routing and scheduling system , 2002 .

[22]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[23]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[24]  Dimitris Bertsimas,et al.  The dynamic traveling repairman problem , 1989 .