Vehicle Routing

SC14.1 Routing of Railway Carriages

• Peter J. S. Brucker; University of Osnabrueck, Albrechtstr.28, Osnabrueck, D-49069 , Germany; peter@mathematik.uni-osnabrueck.de
• Johann Hurink; University of Twente, Fac. of Math. Sci., PO Box 217, Enschede, NL-7500 AE, The Netherlands; j.l.hurink@math.utwente.nl
• Thomas Rolfes; Univ. of Osnabrueck, FB 6, Osnabrueck, D-49069 , Germany;

A passenger train is composed of different types of carriages. To route the carriages of a set of regular trains, an integer multi-commodity flow problem with fixed cost objective function is formulated. We apply SA with restarts to solve this problem. Computational results are reported.

SC14.2 A Heuristic Dynamic Programming Approach for the Vehicle Routing Problem with Stochastic Demands

• Nicola Secomandi; University of Houston, DISC Room 260A, Coll. of Bus., 4800 Calhoun St., Houston, TX 77204-6282; nick@bau.cba.uh.edu

A version of the vehicle routing problem where customers' demands are uncertain is considered. A state space decomposition and a heuristic dynamic programming algorithm that exploits this structure are proposed.

SC14.3 An Algorithm for Detecting K-Optimal Independent Paths

• Vania Campos; Military Institute of Engineering, Praca Gen Tiburcio, 80-DE/2-Urca, Rio de Janeiro, 22290-270 , Brazil; d2vania@epq.ime.eb.br

We present an algorithm which aims toward an emergency transportation planning for vehicle flow allocation. This algorithm identifies these path sets in such a say that optimizes the number of vehicles to be delivered outside a region under menance of some catastrophic event in the least possible time.