Sample Average Approximation Technique for Flexible Network Design Problem

Finding an optimal investment strategy to use scarce resources efficiently is challenging, since the transportation network parameters such as demand, capacity, and travel cost are uncertain. Sequencing investments over time can give flexibility to the planner so as to change, delay, or even abandon the future investment based on system realization. This paper presents a stochastic mathematical program with equilibrium constraints (STOCH-MPEC) formulation for a multistage network design problem, flexible network design problem (FNDP), accounting for demand stochasticity and demand elasticity. STOCH-MPEC problems can be computationally intractable, if the number of scenarios is large and/or the study network is large-scale. To reduce the associated complexity of FNDP, we develop a sample average approximate method (SAA) to efficiently solve the flexible network design problem. We implement the SAA on a test network and compare the performance of SAA with different sample sizes. We show that SAA can produce solutions that are close to the true solutions with considerably fewer scenarios and hence can be a viable computational technique for the stochastic network design problem.

[1]  Terry L. Friesz,et al.  A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints , 1992, Transp. Sci..

[2]  Larry J. LeBlanc,et al.  CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS , 1979 .

[3]  Søren L. Buhl,et al.  How (In)accurate Are Demand Forecasts in Public Works Projects?: The Case of Transportation , 2005, 1303.6654.

[4]  Gül Gürkan,et al.  Solving stochastic mathematical programs with complementarity constraints using simulation , 2004, Proceedings of the 2004 Winter Simulation Conference, 2004..

[5]  Gui-Hua Lin,et al.  A class of stochastic mathematical programs with complementarity constraints: reformulations and algorithms , 2005 .

[6]  Terry L. Friesz,et al.  An overview of nontraditional formulations of static and dynamic equilibrium network design , 2001 .

[7]  Tony E. Smith,et al.  A NONLINEAR COMPLEMENTARITY FORMULATION AND SOLUTION PROCEDURE FOR THE GENERAL DERIVED DEMAND NETWORK EQUILIBRIUM PROBLEM , 1983 .

[8]  Alexander Shapiro,et al.  On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs , 2000, SIAM J. Optim..

[9]  Satish V. Ukkusuri,et al.  Robust Transportation Network Design Under Demand Uncertainty , 2007, Comput. Aided Civ. Infrastructure Eng..

[10]  Hai Yang,et al.  Models and algorithms for road network design: a review and some new developments , 1998 .

[11]  Integration among unequals , 1993 .

[12]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[13]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[14]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[15]  Attahiru Sule Alfa,et al.  A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach , 1991, Transp. Sci..

[16]  Michael Patriksson,et al.  Stochastic mathematical programs with equilibrium constraints , 1999, Oper. Res. Lett..

[17]  Marc Goetschalckx,et al.  A stochastic programming approach for supply chain network design under uncertainty , 2004, Eur. J. Oper. Res..

[18]  Satish V. Ukkusuri,et al.  Multi-period transportation network design under demand uncertainty , 2009 .

[19]  Satish V. Ukkusuri,et al.  Single-Point Approximations for Traffic Equilibrium Problem under Uncertain Demand , 2006 .

[20]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

[21]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[22]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..

[23]  Michael C. Ferris,et al.  Engineering and Economic Applications of Complementarity Problems , 1997, SIAM Rev..

[24]  Clermont Dupuis,et al.  An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs , 1984, Transp. Sci..

[25]  Terry L. Friesz,et al.  Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem , 1987, Transp. Sci..

[26]  Athanasios K. Ziliaskopoulos,et al.  Stochastic Dynamic Network Design Problem , 2001 .

[27]  A. Shapiro,et al.  On rate of convergence of Monte Carlo approximations of stochastic programs , 1998 .

[28]  Andrew R. Goetz,et al.  Revisiting transportation planning and decision making theory: The case of Denver International Airport , 1997 .