IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v14y2014i3p317-333.html
   My bibliography  Save this article

Capacity Consumption Analysis Using Heuristic Solution Method for Under Construction Railway Routes

Author

Listed:
  • Masoud Yaghini
  • Mohammadreza Sarmadi
  • Nariman Nikoo
  • Mohsen Momeni

Abstract

In this paper, a compressed timetable is generated to calculate capacity consumption for under construction railway routes using an optimization approach. Since the detailed timetable for under construction routes does not exist, the timetable is not required in the applied model. The model generates a compressed timetable based on UIC 406 method. The capacity consumption problem is formulated as a multicommodity network design model on a space-discrete time network. A local branching heuristic algorithm is proposed to solve the model. The main idea underlining the local branching algorithm is the utilization of a general mixed integer programming solver to explore neighborhoods and locally search around the best-known solution by employing tree search. The parameters of the algorithm are tuned by using design of experiments. The proposed method is implemented in Iran Railways and the results are reported. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Masoud Yaghini & Mohammadreza Sarmadi & Nariman Nikoo & Mohsen Momeni, 2014. "Capacity Consumption Analysis Using Heuristic Solution Method for Under Construction Railway Routes," Networks and Spatial Economics, Springer, vol. 14(3), pages 317-333, December.
    • Handle: RePEc:kap:netspa:v:14:y:2014:i:3:p:317-333
    DOI: 10.1007/s11067-014-9223-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-014-9223-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-014-9223-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gabrio Caimi & Dan Burkolter & Thomas Herrmann & Fabian Chudak & Marco Laumanns, 2009. "Design of a Railway Scheduling Model for Dense Services," Networks and Spatial Economics, Springer, vol. 9(1), pages 25-46, March.
    2. Mussone, Lorenzo & Wolfler Calvo, Roberto, 2013. "An analytical approach to calculate the capacity of a railway system," European Journal of Operational Research, Elsevier, vol. 228(1), pages 11-23.
    3. Carey, Malachy, 1994. "A model and strategy for train pathing with choice of lines, platforms, and routes," Transportation Research Part B: Methodological, Elsevier, vol. 28(5), pages 333-353, October.
    4. U. Brännlund & P. O. Lindberg & A. Nõu & J.-E. Nilsson, 1998. "Railway Timetabling Using Lagrangian Relaxation," Transportation Science, INFORMS, vol. 32(4), pages 358-369, November.
    5. Harrod, Steven, 2009. "Capacity factors of a mixed speed railway network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(5), pages 830-841, September.
    6. Cacchiani, Valentina & Caprara, Alberto & Toth, Paolo, 2010. "Scheduling extra freight trains on railway networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 215-231, February.
    7. Paul Berglund & Changhyun Kwon, 2014. "Robust Facility Location Problem for Hazardous Waste Transportation," Networks and Spatial Economics, Springer, vol. 14(1), pages 91-116, March.
    8. de Kort, A. F. & Heidergott, B. & Ayhan, H., 2003. "A probabilistic (max, +) approach for determining railway infrastructure capacity," European Journal of Operational Research, Elsevier, vol. 148(3), pages 644-661, August.
    9. Mu, Shi & Dessouky, Maged, 2011. "Scheduling freight trains traveling on complex networks," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1103-1123, August.
    10. Belarmino Adenso-Díaz & Manuel Laguna, 2006. "Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search," Operations Research, INFORMS, vol. 54(1), pages 99-114, February.
    11. Abril, M. & Barber, F. & Ingolotti, L. & Salido, M.A. & Tormos, P. & Lova, A., 2008. "An assessment of railway capacity," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(5), pages 774-806, September.
    12. Andrea D’Ariano & Marco Pranzo, 2009. "An Advanced Real-Time Train Dispatching System for Minimizing the Propagation of Delays in a Dispatching Area Under Severe Disturbances," Networks and Spatial Economics, Springer, vol. 9(1), pages 63-84, March.
    13. Byung Chung & Tao Yao & Chi Xie & Andreas Thorsen, 2011. "Robust Optimization Model for a Dynamic Network Design Problem Under Demand Uncertainty," Networks and Spatial Economics, Springer, vol. 11(2), pages 371-389, June.
    14. D'Ariano, Andrea & Pacciarelli, Dario & Pranzo, Marco, 2007. "A branch and bound algorithm for scheduling trains in a railway network," European Journal of Operational Research, Elsevier, vol. 183(2), pages 643-657, December.
    15. Alex Landex, 2009. "Evaluation of Railway Networks with Single Track Operation Using the UIC 406 Capacity Method," Networks and Spatial Economics, Springer, vol. 9(1), pages 7-23, March.
    16. Burdett, R.L. & Kozan, E., 2006. "Techniques for absolute capacity determination in railways," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 616-632, September.
    17. Higgins, A. & Kozan, E. & Ferreira, L., 1996. "Optimal scheduling of trains on a single line track," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 147-161, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tatsuaki Kuroda, 2015. "A Model of Stratified Production Process and Spatial Risk," Networks and Spatial Economics, Springer, vol. 15(2), pages 271-292, June.
    2. Abramovic Borna & Zitricky Vladislav & Mesko Pavol, 2017. "Draft Methodology to Specify the Railway Sections Capacity," LOGI – Scientific Journal on Transport and Logistics, Sciendo, vol. 8(1), pages 1-10, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Li, Feng & Gao, Ziyou & Wang, David Z.W. & Liu, Ronghui & Tang, Tao & Wu, Jianjun & Yang, Lixing, 2017. "A subjective capacity evaluation model for single-track railway system with δ-balanced traffic and λ-tolerance level," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 43-66.
    2. Burdett, RL, 2016. "Optimisation models for expanding a railway's theoretical capacity," European Journal of Operational Research, Elsevier, vol. 251(3), pages 783-797.
    3. Zhang, Yongxiang & Peng, Qiyuan & Yao, Yu & Zhang, Xin & Zhou, Xuesong, 2019. "Solving cyclic train timetabling problem through model reformulation: Extended time-space network construct and Alternating Direction Method of Multipliers methods," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 344-379.
    4. Talebian, Ahmadreza & Zou, Bo, 2015. "Integrated modeling of high performance passenger and freight train planning on shared-use corridors in the US," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 114-140.
    5. Steven Harrod, 2011. "Modeling Network Transition Constraints with Hypergraphs," Transportation Science, INFORMS, vol. 45(1), pages 81-97, February.
    6. Ortega Riejos, Francisco A. & Barrena, Eva & Canca Ortiz, J. David & Laporte, Gilbert, 2016. "Analyzing the theoretical capacity of railway networks with a radial-backbone topology," Transportation Research Part A: Policy and Practice, Elsevier, vol. 84(C), pages 83-92.
    7. Meng, Lingyun & Zhou, Xuesong, 2014. "Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 208-234.
    8. Meng, Lingyun & Zhou, Xuesong, 2011. "Robust single-track train dispatching model under a dynamic and stochastic environment: A scenario-based rolling horizon solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1080-1102, August.
    9. Li, Feng & Sheu, Jiuh-Biing & Gao, Zi-You, 2014. "Deadlock analysis, prevention and train optimal travel mechanism in single-track railway system," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 385-414.
    10. Xiaoming Xu & Keping Li & Lixing Yang & Ziyou Gao, 2019. "An efficient train scheduling algorithm on a single-track railway system," Journal of Scheduling, Springer, vol. 22(1), pages 85-105, February.
    11. Burdett, R.L. & Kozan, E., 2010. "A disjunctive graph model and framework for constructing new train schedules," European Journal of Operational Research, Elsevier, vol. 200(1), pages 85-98, January.
    12. Line Blander Reinhardt & David Pisinger & Richard Lusby, 2018. "Railway capacity and expansion analysis using time discretized paths," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 712-739, December.
    13. Cacchiani, Valentina & Furini, Fabio & Kidd, Martin Philip, 2016. "Approaches to a real-world Train Timetabling Problem in a railway node," Omega, Elsevier, vol. 58(C), pages 97-110.
    14. Bettinelli, Andrea & Santini, Alberto & Vigo, Daniele, 2017. "A real-time conflict solution algorithm for the train rescheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 237-265.
    15. Yu-Jun Zheng, 2018. "Emergency Train Scheduling on Chinese High-Speed Railways," Transportation Science, INFORMS, vol. 52(5), pages 1077-1091, October.
    16. E. Ursavas & Stuart X. Zhu, 2018. "Integrated Passenger and Freight Train Planning on Shared-Use Corridors," Service Science, INFORMS, vol. 52(6), pages 1376-1390, December.
    17. Min, Yun-Hong & Park, Myoung-Ju & Hong, Sung-Pil & Hong, Soon-Heum, 2011. "An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network," Transportation Research Part B: Methodological, Elsevier, vol. 45(2), pages 409-429, February.
    18. Wenliang Zhou & Junli Tian & Jin Qin & Lianbo Deng & TangJian Wei, 2015. "Optimization of Multiperiod Mixed Train Schedule on High-Speed Railway," Discrete Dynamics in Nature and Society, Hindawi, vol. 2015, pages 1-14, April.
    19. Zhou, Wenliang & Teng, Hualiang, 2016. "Simultaneous passenger train routing and timetabling using an efficient train-based Lagrangian relaxation decomposition," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 409-439.
    20. Matthew E. H. Petering & Mojtaba Heydar & Dietrich R. Bergmann, 2016. "Mixed-Integer Programming for Railway Capacity Analysis and Cyclic, Combined Train Timetabling and Platforming," Transportation Science, INFORMS, vol. 50(3), pages 892-909, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:14:y:2014:i:3:p:317-333. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.