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

Optimizing Train Network Routing Using Deterministic Search

Author

Listed:
  • KePing Li
  • ZiYou Gao
  • BaoHua Mao
  • ChengXuan Cao

Abstract

No abstract is available for this item.

Suggested Citation

  • KePing Li & ZiYou Gao & BaoHua Mao & ChengXuan Cao, 2011. "Optimizing Train Network Routing Using Deterministic Search," Networks and Spatial Economics, Springer, vol. 11(2), pages 193-205, June.
  • Handle: RePEc:kap:netspa:v:11:y:2011:i:2:p:193-205
    DOI: 10.1007/s11067-009-9098-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-009-9098-7
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11067-009-9098-7?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. Roanes-Lozano, Eugenio & Roanes-Macı́as, Eugenio & Laita, Luis M., 2002. "A computer algebra approach to the design of routes and the study of their compatibility in a railway interlocking," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 58(3), pages 203-214.
    2. Winnie Daamen & Rob Goverde & Ingo Hansen, 2009. "Non-Discriminatory Automatic Registration of Knock-On Train Delays," Networks and Spatial Economics, Springer, vol. 9(1), pages 47-61, March.
    3. Ghoseiri, Keivan & Szidarovszky, Ferenc & Asgharpour, Mohammad Jawad, 2004. "A multi-objective train scheduling model and solution," Transportation Research Part B: Methodological, Elsevier, vol. 38(10), pages 927-952, December.
    4. Dejan Jovanović & Patrick T. Harker, 1991. "Tactical Scheduling of Rail Operations: The SCAN I System," Transportation Science, INFORMS, vol. 25(1), pages 46-64, February.
    5. Peter J. Zwaneveld & Leo G. Kroon & H. Edwin Romeijn & Marc Salomon & Stéphane Dauzère-Pérès & Stan P. M. Van Hoesel & Harrie W. Ambergen, 1996. "Routing Trains Through Railway Stations: Model Formulation and Algorithms," Transportation Science, INFORMS, vol. 30(3), pages 181-194, August.
    6. Jon M. Kleinberg, 2000. "Navigation in a small world," Nature, Nature, vol. 406(6798), pages 845-845, August.
    7. Blum, Jeremy & Eskandarian, Azim, 2002. "Enhancing intelligent agent collaboration for flow optimization of railroad traffic," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(10), pages 919-930, December.
    8. Haghani, Ali E., 1989. "Formulation and solution of a combined train routing and makeup, and empty car distribution model," Transportation Research Part B: Methodological, Elsevier, vol. 23(6), pages 433-452, December.
    9. Keaton, Mark H., 1989. "Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches," Transportation Research Part B: Methodological, Elsevier, vol. 23(6), pages 415-431, December.
    10. Rodriguez, Joaquín, 2007. "A constraint programming model for real-time train scheduling at junctions," Transportation Research Part B: Methodological, Elsevier, vol. 41(2), pages 231-245, February.
    11. Assad, Arjang A., 1980. "Modelling of rail networks: Toward a routing/makeup model," Transportation Research Part B: Methodological, Elsevier, vol. 14(1-2), pages 101-114.
    Full references (including those not matched with items on IDEAS)

    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. Chen, Chongshuang & Dollevoet, Twan & Zhao, Jun, 2018. "One-block train formation in large-scale railway networks: An exact model and a tree-based decomposition algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 1-30.
    2. Zhimei Wang & Avishai Ceder, 2017. "Efficient design of freight train operation with double-hump yards," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(12), pages 1600-1619, December.
    3. Lin, Bo-Liang & Wang, Zhi-Mei & Ji, Li-Jun & Tian, Ya-Ming & Zhou, Guo-Qing, 2012. "Optimizing the freight train connection service network of a large-scale rail system," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 649-667.
    4. Marin, Angel & Salmeron, Javier, 1996. "Tactical design of rail freight networks. Part I: Exact and heuristic methods," European Journal of Operational Research, Elsevier, vol. 90(1), pages 26-44, April.
    5. Khaled, Abdullah A. & Jin, Mingzhou & Clarke, David B. & Hoque, Mohammad A., 2015. "Train design and routing optimization for evaluating criticality of freight railroad infrastructures," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 71-84.
    6. Jin, Jian Gang & Zhao, Jun & Lee, Der-Horng, 2013. "A column generation based approach for the Train Network Design Optimization problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 1-17.
    7. Enrique Castillo & Inmaculada Gallego & José Ureña & José Coronado, 2009. "Timetabling optimization of a single railway track line with sensitivity analysis," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(2), pages 256-287, December.
    8. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    9. Ruf, Moritz & Cordeau, Jean-François, 2021. "Adaptive large neighborhood search for integrated planning in railroad classification yards," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 26-51.
    10. Richard Lusby & Jesper Larsen & David Ryan & Matthias Ehrgott, 2011. "Routing Trains Through Railway Junctions: A New Set-Packing Approach," Transportation Science, INFORMS, vol. 45(2), pages 228-245, May.
    11. Nie, Wei & Li, Hao & Xiao, Na & Yang, Hao & Jiang, Zhishu & Buhigiro, Nsabimana, 2021. "Modeling and solving the last-shift period train scheduling problem in subway networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 569(C).
    12. Michael F. Gorman, 1998. "Santa Fe Railway Uses an Operating-Plan Model to Improve Its Service Design," Interfaces, INFORMS, vol. 28(4), pages 1-12, August.
    13. Julia Lange & Frank Werner, 2018. "Approaches to modeling train scheduling problems as job-shop problems with blocking constraints," Journal of Scheduling, Springer, vol. 21(2), pages 191-207, April.
    14. Xin Wang & Teodor Gabriel Crainic & Stein W. Wallace, 2019. "Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 153-170, February.
    15. Chen, C. & Dollevoet, T.A.B. & Zhao, J., 2017. "One-block train formation in large-scale railway networks: An exact model and a tree-based decomposition algorithm," Econometric Institute Research Papers EI-2017-32, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    16. Xiao, Jie & Pachl, Joern & Lin, Boliang & Wang, Jiaxi, 2018. "Solving the block-to-train assignment problem using the heuristic approach based on the genetic algorithm and tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 148-171.
    17. 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.
    18. Rajnish Kumar & Goutam Sen & Samarjit Kar & Manoj Kumar Tiwari, 2018. "Station Dispatching Problem for a Large Terminal: A Constraint Programming Approach," Interfaces, INFORMS, vol. 48(6), pages 510-528, November.
    19. Lee, Yusin & Chen, Chuen-Yih, 2009. "A heuristic for the train pathing and timetabling problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 837-851, September.
    20. Sels, P. & Dewilde, T. & Cattrysse, D. & Vansteenwegen, P., 2016. "Reducing the passenger travel time in practice by the automated construction of a robust railway timetable," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 124-156.

    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:11:y:2011:i:2:p:193-205. 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.