Modeling the railway network design problem: A novel approach to considering carbon emissions reduction

Abstract In recent years, air pollution has become a severe environmental problem. Many countries are seeking effective methods to reduce carbon emissions. Among the sources of air pollution, the transportation industry is a large one. Thus, developing low carbon emissions transportation is a new trend. Since railway transport possesses the advantages of high volume and low emissions, a new idea for transportation development is to divert truck freights to railway by improving the capacity of the railway. Based on this situation, this paper analyzes the carbon emissions of railway and highway transport and estimates the environmental benefit of building a railway. Next, a bi-level programming model for railway network design is recommended. Different from the classical model, the opportunity cost and carbon emissions of the infeasible flows, which cannot be transported by railway and will be served by highway, are considered in the objective function, enabling the model to balance the investment and carbon emissions. To comply with the practice of railway planning, we introduced the method to deal with passenger flow, empty car flow and relationships among the links in a corridor. In the end, a numerical example is conducted to test the model and compare the final decisions when different weights are set on the carbon emissions.

[1]  Hai Yang,et al.  Global optimization methods for the discrete network design problem , 2013 .

[2]  Bernard Gendron,et al.  Decomposition Methods for Network Design , 2011 .

[3]  M. Chen,et al.  A capacity scaling heuristic for the multicommodity capacitated network design problem , 2009, J. Comput. Appl. Math..

[4]  Lin Bo An optimization model to railroad network designing , 2002 .

[5]  Ziyou Gao,et al.  Solution algorithm for the bi-level discrete network design problem , 2005 .

[6]  D. Z. Wang,et al.  Global optimization method for network design problem with stochastic user equilibrium , 2015 .

[7]  Xiaodong Xie,et al.  Railway network design with multiple project stages and time sequencing , 2001, J. Geogr. Syst..

[8]  Antonio Frangioni,et al.  0-1 Reformulations of the Multicommodity Capacitated Network Design Problem , 2009, Discret. Appl. Math..

[9]  S. Minner,et al.  Benders Decomposition for Discrete–Continuous Linear Bilevel Problems with application to traffic network design , 2014 .

[10]  Zvi Drezner,et al.  NETWORK DESIGN: SELECTION AND DESIGN OF LINKS AND FACILITY LOCATION , 2003 .

[11]  Russell D. Meller,et al.  A model to design a national high-speed rail network for freight distribution , 2010 .

[12]  Mehdi Ghatee,et al.  Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion , 2016 .

[13]  M. Sepehri,et al.  A Single-Level Mixed Integer Linear Formulation for a Bi-Level Discrete Network Design Problem , 2011 .

[14]  Qiang Sun,et al.  Multi-period Bi-level Programming Model for Regional Comprehensive Transport Network Design with Uncertain Demand , 2011 .

[15]  Hong Kam Lo,et al.  Global Optimum of the Linearized Network Design Problem with Equilibrium Flows , 2010 .

[16]  M. Janić Modelling the full costs of an intermodal and road freight transport network , 2007 .

[17]  Franklin Farell Roadmap to a Single European Transport Area: Towards a competitive and resource efficient transport system , 2014 .

[18]  Dominique Peeters,et al.  Modelling a rail/road intermodal transportation system , 2004 .

[19]  W. Y. Szeto,et al.  A novel discrete network design problem formulation and its global optimization solution algorithm , 2015 .

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

[21]  Liang Dong An Optimization Model of Railroad Network Design and Investment Including Multiple Projects in Several Five-year Plans , 2007 .

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