Stochastic Programming in Transportation and Logistics

Freight transportation is characterized by highly dynamic information processes: customers call in orders over time to move freight; the movement of freight over long distances is subject to random delays; equipment failures require last minute changes; and decisions are not always executed in the field according to plan. The high-dimensionality of the decisions involved has made transportation a natural application for the techniques of mathematical programming, but the challenge of modeling dynamic information processes has limited their success. In this chapter, we explore the use of concepts from stochastic programming in the context of resource allocation problems that arise in freight transportation. Since transportation problems are often quite large, we focus on the degree to which some techniques exploit the natural structure of these problems. Experimental work in the context of these applications is quite limited, so we highlight the techniques that appear to be the most promising.

[1]  G. Cohen,et al.  Decomposition/coordination algorithms in stochastic optimization , 1990 .

[2]  Warren B. Powell,et al.  Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems , 2004, Math. Oper. Res..

[3]  Michel Gendreau,et al.  Dynamic and Stochastic Models for the Allocation of Empty Containers , 1993, Oper. Res..

[4]  William C. Jordan,et al.  A STOCHASTIC, DYNAMIC NETWORK MODEL FOR RAILROAD CAR DISTRIBUTION , 1983 .

[5]  Andrew G. Barto,et al.  Reinforcement learning , 1998 .

[6]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[7]  Warrren B Powell,et al.  An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution , 2001 .

[8]  H Herren.  THE DISTRIBUTION OF EMPTY WAGONS BY MEANS OF COMPUTER. AN ANALYTICAL MODEL OF THE SWISS FEDERAL RAILWAYS , 1974 .

[9]  Julia L. Higle,et al.  Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse , 1991, Math. Oper. Res..

[10]  S C Misra.  LINEAR PROGRAMMING OF EMPTY WAGON DISPOSITION , 1972 .

[11]  Warren B. Powell,et al.  An Adaptive Dynamic Programming Algorithm for the Heterogeneous Resource Allocation Problem , 2002, Transp. Sci..

[12]  Mark A. Turnquist,et al.  MODEL FOR MANAGEMENT OF EMPTY FREIGHT CARS , 1982 .

[13]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[14]  Veena B. Mendiratta.  A dynamic optimization model of the empty car distribution process , 1981 .

[15]  Ali E. Haghani,et al.  Formulation and solution of a combined train routing and makeup, and empty car distribution model , 1989 .

[16]  Warren B. Powell,et al.  A network recourse decomposition method for dynamic networks with random arc capacities , 1994, Networks.

[17]  Warren B. Powell,et al.  An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management , 1996, Oper. Res..

[18]  Warren B. Powell,et al.  A Multiplier Adjustment Method for Dynamic Resource Allocation Problems , 2000, Transp. Sci..

[19]  Linos F. Frantzeskakis,et al.  A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems , 1990, Transp. Sci..

[20]  Warren B. Powell,et al.  Dynamic Control of Logistics Queueing Networks for Large-Scale Fleet Management , 1998, Transp. Sci..

[21]  Warren B. Powell,et al.  Stochastic programs over trees with random arc capacities , 1994, Networks.

[22]  William W. White,et al.  Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers , 1972, Networks.

[23]  William W. White,et al.  A Network Algorithm for Empty Freight Car Allocation , 1969, IBM Syst. J..

[24]  Warren B. Powell,et al.  An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times , 2002, Transp. Sci..

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

[26]  T G Crainic,et al.  A DYNAMIC STOCHASTIC MODEL FOR THE ALLOCATION OF EMPTY CONTAINERS , 1991 .

[27]  J. Blum.  Multidimensional Stochastic Approximation Methods , 1954 .

[28]  Teodor Gabriel Crainic,et al.  Survey Paper - A Review of Empty Flows and Fleet Management Models in Freight Transportation , 1987, Transp. Sci..

[29]  R. Wets,et al.  Stochastic programming , 1989 .

[30]  G. Infanger,et al.  Planning under uncertainty solving large-scale stochastic linear programs , 1992 .

[31]  Warren B. Powell,et al.  Shape - a Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs , 2000, Oper. Res..

[32]  Yuri Ermoliev,et al.  Stochastic quasigradient methods. Numerical techniques for stochastic optimization , 1988 .

[33]  Warren B. Powell,et al.  Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities , 1994, Transp. Sci..

[34]  E. G. Gladyshev.  On Stochastic Approximation , 1965 .

[35]  George B. Dantzig,et al.  Linear Programming Under Uncertainty , 2004, Manag. Sci..

[36]  F. Downton.  Stochastic Approximation , 1969, Nature.

[37]  Yu. M. Ermol'ev,et al.  Planning of shipping empty seaborne containers , 1976 .

[38]  Warren B. Powell,et al.  A COMPARATIVE REVIEW OF ALTERNATIVE ALGORITHMS FOR THE DYNAMIC VEHICLE ALLOCATION PROBLEM , 1988 .

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