Mixed-Integer Nonlinear Problems in Transportation Applications

We give a short introduction to mixed-integer nonlinear programming from a linear programming perspective. In this approach, all nonlinearities are approximated by linear inequalities and spatial branching, such that in the end only linear programs remain that can be solved efficiently. We present two transportation applications from rather different fields: Railway freight on one side, and natural gas on the other. Both deal with service network design and naturally lead to MINLP formulations. We demonstrate how the nonlinear part can be approximated in a linear way.

[1]  Hong Jin,et al.  Railroad Blocking: A Network Design Application , 2000, Oper. Res..

[2]  Laurence A. Wolsey,et al.  A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..

[3]  Jean-Marc Rousseau,et al.  A Tactical Planning Model for Rail Freight Transportation , 1984, Transp. Sci..

[4]  Andrzej J. Osiadacz,et al.  Optimization of Pipe Sizes For Distribution Gas Network Design , 1995 .

[5]  Manfred W. Padberg,et al.  Classical Cuts for Mixed-Integer Programming and Branch-and-Cut , 2005, Ann. Oper. Res..

[6]  Patrick D. Surry,et al.  Constrained Gas Network Pipe Sizing with Genetic Algorithms , 2003 .

[7]  Luis A. Castillo,et al.  Distribution network optimization: Finding the most economic solution by using genetic algorithms , 1998, Eur. J. Oper. Res..

[8]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[9]  Harry N. Newton.  Network Design Under Budget Constraints With Application To The Railroad Blocking Problem. , 1997 .

[10]  Nikolaos V. Sahinidis,et al.  Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .

[11]  Jian Liu,et al.  Solving Real-Life Railroad Blocking Problems , 2007, Interfaces.

[12]  Yves Smeers,et al.  Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks , 1996, Oper. Res..

[13]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[14]  Mark H. Keaton,et al.  Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches , 1989 .

[15]  Arjang A. Assad,et al.  Analysis Of Rail Classification Policies , 1983 .

[16]  Cynthia Barnhart,et al.  Constructing Railroad Blocking Plans to Minimize Handling Costs , 1998, Transp. Sci..

[17]  Martin Grötschel,et al.  On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..

[18]  Edward M. B. Smith,et al.  A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs , 1999 .

[19]  Nikolaos V. Sahinidis,et al.  Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..

[20]  Teodor Gabriel Crainic,et al.  Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem , 1986 .

[21]  F. Ancillai,et al.  Design Of A Gas Pipeline: Optimal Configuration , 1997 .

[22]  Arjang A. Assad,et al.  Analytical Models In Rail Transportation: An Annotated Bibliography , 1981 .

[23]  Lawrence Bodin,et al.  A model for the blocking of trains , 1980 .