IDEAS home Printed from
   My bibliography  Save this article

Optimizing Train Network Routing Using Deterministic Search


  • KePing Li


  • ZiYou Gao
  • BaoHua Mao
  • ChengXuan Cao


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

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

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

    References listed on IDEAS

    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. 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.
    3. 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.
    4. 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.
    5. 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)


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

    Cited by:

    1. Bo Zou & Gurkaran Singh Buxi & Mark Hansen, 2016. "Optimal 4-D Aircraft Trajectories in a Contrail-sensitive Environment," Networks and Spatial Economics, Springer, vol. 16(1), pages 415-446, March.
    2. Mohsen Momeni & Mohammadreza Sarmadi, 2016. "A Genetic Algorithm Based on Relaxation Induced Neighborhood Search in a Local Branching Framework for Capacitated Multicommodity Network Design," Networks and Spatial Economics, Springer, vol. 16(2), pages 447-468, June.


    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.