New Model for the Railway Network Design Problem
Publication: Journal of Transportation Engineering, Part A: Systems
Volume 144, Issue 11
Abstract
In this paper, mixed-integer programming for the railway network design problem with a new objective function is proposed. The model considers development projects (new line construction and existing line improvement), available budget, block capacity, and origin-destination matrix demand. A standard code is used to calculate the capacity of the blocks. The objective function is to minimize the total cost of direct and indirect (external) costs. We add the effect of railway network development on the road network to the model. The proposed model is implemented for the railway network of Iran and solved by an exact method.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
We thank Hosein Jafari, railway engineering graduate ([email protected]) for assistance in part of the research. We thank all of the experts in Railways of Iran (RAI), who have provided the data needed for the research, especially Vahid Alighardashi, general manager ([email protected]), and Iman Ansari, head of Master Plan group in the Engineering Office ([email protected]).
References
Amiripour, S. M. M., A. Ceder, and A. S. Mohaymany. 2014. “Hybrid method for bus network design with high seasonal demand variation.” J. Transp. Eng. 140 (6): 04014015. https://doi.org/10.1061/(ASCE)TE.1943-5436.0000669.
Assad, A. A. 1980. “Models for rail transportation.” Transp. Res. Part A Gen. 14 (3): 205–220. https://doi.org/10.1016/0191-2607(80)90017-5.
Balakrishnan, A., T. L. Magnanti, and P. Mirchandani. 1997. “Network design.” In Annotated bibliographies in combinatorial optimization, 311–334. Chichester, UK: Wiley.
Canca, D., A. De-Los-Santos, G. Laporte, and J. A. Mesa. 2017. “An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem.” Comput. Oper. Res. 78: 1–14. https://doi.org/10.1016/j.cor.2016.08.008.
Crainic, T. G., P. Dejax, and L. Delorme. 1989. “Models for multimode multicommodity location problems with interdepot balancing requirements.” Ann. Oper. Res. 18 (1): 277–302. https://doi.org/10.1007/BF02097809.
García-Archilla, B., A. J. Lozano, J. A. Mesa, and F. Perea. 2013. “GRASP algorithms for the robust railway network design problem.” J. Heuristics 19 (2): 1–24. https://doi.org/10.1007/s10732-011-9185-z.
Gendron, B., T. G. Crainic, and A. Frangioni. 1999. “Multicommodity capacitated network design.” In Telecommunications network planning, 1–19. New York: Springer.
Iranian-Fuel-Conservation-Company. 2015. Transportation energy data book. [In Persian.] Tehran, Iran: Shahid Beheshti Univ.
Jayaraman, V., and A. Ross. 2003. “A simulated annealing methodology to distribution network design and management.” Eur. J. Oper. Res. 144 (3): 629–645. https://doi.org/10.1016/S0377-2217(02)00153-4.
Kermansshahi, S., M. Shafahi, Y. Mollanejad, and M. Zangui. 2010. “Rapid transit network design using simulated annealing.” In Proc., 12th WCTR, 1–15. Lisbon, Portugal: Elsevier.
Laporte, G., A. Marín, J. A. Mesa, and F. Perea. 2011. “Designing robust rapid transit networks with alternative routes.” J. Adv. Transp. 45 (1): 54–65. https://doi.org/10.1002/atr.132.
Laporte, G., Á. Marín, J. Mesa, and F. Ortega. 2007. “An integrated methodology for the rapid transit network design problem.” In Algorithmic methods for railway optimization, 187–199. Berlin: Springer.
Magnanti, T. L., and R. T. Wong. 1984. “Network design and transportation planning: Models and algorithms.” Transp. Sci. 18 (1): 1–55. https://doi.org/10.1287/trsc.18.1.1.
Marín, Á., and R. García-Ródenas. 2009. “Location of infrastructure in urban railway networks.” Comput. Oper. Res. 36 (5): 1461–1477. https://doi.org/10.1016/j.cor.2008.02.008.
Marín, Á., J. A. Mesa, and F. Perea. 2011. “Integrating robust railway network design and line planning under failures.” Robust and online large-scale optimization. Berlin: Springer.
Mathew, T. V., and S. Sharma. 2009. “Capacity expansion problem for large urban transportation networks.” J. Transp. Eng. 135 (7): 406–415. https://doi.org/10.1061/(ASCE)0733-947X(2009)135:7(406).
Minoux, M. 1989. “Networks synthesis and optimum network design problems: Models, solution methods and applications.” Networks 19 (3): 313–360. https://doi.org/10.1002/net.3230190305.
Minoux, M. 2001. “Discrete cost multicommodity network optimization problems and exact solution methods.” Ann. Oper. Res. 106 (1): 19–46. https://doi.org/10.1023/A:1014554606793.
Pazour, J. A., R. D. Meller, and L. M. Pohl. 2010. “A model to design a national high-speed rail network for freight distribution.” Transp. Res. Part A Policy Pract. 44 (3): 119–135. https://doi.org/10.1016/j.tra.2009.11.006.
Poorzahedy, H., and F. Abulghasemi. 2005. “Application of ant system to network design problem.” Transportation 32 (3): 251–273. https://doi.org/10.1007/s11116-004-8246-7.
Poorzahedy, H., and M. A. Turnquist. 1982. “Approximate algorithms for the discrete network design problem.” Transp. Res. Part B Methodol. 16 (1): 45–55. https://doi.org/10.1016/0191-2615(82)90040-6.
Santos, B., A. Antunes, and E. Miller. 2009. “Multiobjective approach to long-term interurban multilevel road network planning.” J. Transp. Eng. 135 (9): 640–649. https://doi.org/10.1061/(ASCE)TE.1943-5436.0000043.
Sullivan, W. G., E. M. Wicks, and J. T. Luxhoj. 2003. Engineering economy. Upper Saddle River, NJ: Prentice Hall.
Yaghini, M., H. R. Ahadi, E. Barati, and Z. Saghian. 2012. “Tabu search algorithm for the railroad blocking problem.” J. Transp. Eng. 139 (2): 216–222. https://doi.org/10.1061/(ASCE)TE.1943-5436.0000447.
Yaghini, M., M. Karimi, M. Rahbar, and R. Akhavan. 2013. “A hybrid simulated annealing and simplex method for fixed-cost capacitated multicommodity network design.” In Trends in developing metaheuristics, algorithms, and optimization approaches, 17–31. Hershey, PA: IGI Global.
Yamada, T., and Z. Febri. 2015. “Freight transport network design using particle swarm optimisation in supply chain-transport supernetwork equilibrium.” Transp. Res. Part E Logist. Transp. Rev. 75: 164–187. https://doi.org/10.1016/j.tre.2015.01.001.
Zarrinmehr, A., and Y. Shafahi. 2016. “Parallelization of the branch-and-bound algorithm in transportation discrete network design problem.” Sci. Iranica. Trans. A Civ. Eng. 23 (2): 407.
Information & Authors
Information
Published In
Journal of Transportation Engineering, Part A: Systems
Volume 144 • Issue 11 • November 2018
Copyright
©2018 American Society of Civil Engineers.
History
Received: Dec 4, 2017
Accepted: Apr 17, 2018
Published online: Aug 29, 2018
Published in print: Nov 1, 2018
Discussion open until: Jan 29, 2019
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.