IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-540-73312-6_20.html
   My bibliography  Save this book chapter

A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem

In: Computer-aided Systems in Public Transport

Author

Listed:
  • Wei Fan

    (University of Texas at Austin)

  • Randy B. Machemehl

    (University of Texas at Austin)

Abstract

Systematic tabu search based meta-heuristic algorithms are designed and implemented for the transit route network design problem. A multi-objective nonlinear mixed integer model is formulated. Solution methodologies based on three variations of tabu search methods are proposed and tested using a small experimental network as a pilot study. Sensitivity analysis is performed, a comprehensive characteristics analysis is conducted and numerical results indicate that the preferred tabu search method outperforms the genetic algorithm used as a benchmark.

Suggested Citation

  • Wei Fan & Randy B. Machemehl, 2008. "A Tabu Search Based Heuristic Method for the Transit Route Network Design Problem," Lecture Notes in Economics and Mathematical Systems, in: Mark Hickman & Pitu Mirchandani & Stefan Voß (ed.), Computer-aided Systems in Public Transport, pages 387-408, Springer.
    • Handle: RePEc:spr:lnechp:978-3-540-73312-6_20
    DOI: 10.1007/978-3-540-73312-6_20
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    2. Mahmoud Owais & Abdou S. Ahmed & Ghada S. Moussa & Ahmed A. Khalil, 2020. "An Optimal Metro Design for Transit Networks in Existing Square Cities Based on Non-Demand Criterion," Sustainability, MDPI, vol. 12(22), pages 1-28, November.
    3. Wencheng Huang & Bin Shuai & Eric Antwi, 2019. "A two-stage optimization approach for subscription bus services network design: the China case," Public Transport, Springer, vol. 11(3), pages 589-616, October.
    4. Ahern, Zeke & Paz, Alexander & Corry, Paul, 2022. "Approximate multi-objective optimization for integrated bus route design and service frequency setting," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 1-25.
    5. Jen-Jia Lin & Chia-Jung Yu, 2013. "A bikeway network design model for urban areas," Transportation, Springer, vol. 40(1), pages 45-68, January.
    6. Roca-Riu, Mireia & Estrada, Miquel & Trapote, César, 2012. "The design of interurban bus networks in city centers," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(8), pages 1153-1165.

    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:spr:lnechp:978-3-540-73312-6_20. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.