IDEAS home Printed from https://ideas.repec.org/a/ags/ndjtrf/206963.html

Some Computational Insights on the Optimal Bus Transit Route Network Design Problem

Author

Listed:
  • Fan, Wei
  • Machemehl, Randy B.
  • Lownes, Nicholas E.

Abstract

The objective of this paper is to present some computational insights based on previous extensive research experiences on the optimal bus transit route network design problem (BTRNDP) with zonal demand aggregation and variable transit demand. A multi-objective, nonlinear mixed integer model is developed. A general meta-heuristics-based solution methodology is proposed. Genetic algorithms (GA), simulated annealing (SA), and a combination of the GA and SA are implemented and compared to solve the BTRNDP. Computational results show that zonal demand aggregation is necessary and combining metaheuristic algorithms to solve the large scale BTRNDP is very promising.

Suggested Citation

  • Fan, Wei & Machemehl, Randy B. & Lownes, Nicholas E., 2008. "Some Computational Insights on the Optimal Bus Transit Route Network Design Problem," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 47(3).
  • Handle: RePEc:ags:ndjtrf:206963
    DOI: 10.22004/ag.econ.206963
    as

    Download full text from publisher

    File URL: https://ageconsearch.umn.edu/record/206963/files/2116-4171-1-PB.pdf
    Download Restriction: no

    File URL: https://libkey.io/10.22004/ag.econ.206963?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
    ---><---

    References listed on IDEAS

    as
    1. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    2. LeBlanc, Larry J., 1988. "Transit system network design," Transportation Research Part B: Methodological, Elsevier, vol. 22(5), pages 383-390, October.
    3. Eglese, R. W., 1990. "Simulated annealing: A tool for operational research," European Journal of Operational Research, Elsevier, vol. 46(3), pages 271-281, June.
    4. G. F. Newell, 1979. "Some Issues Relating to the Optimal Design of Bus Routes," Transportation Science, INFORMS, vol. 13(1), pages 20-35, February.
    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. Pternea, Moschoula & Kepaptsoglou, Konstantinos & Karlaftis, Matthew G., 2015. "Sustainable urban transit network design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 77(C), pages 276-291.

    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. 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. Luca Quadrifoglio & Randolph W. Hall & Maged M. Dessouky, 2006. "Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity," Transportation Science, INFORMS, vol. 40(3), pages 351-363, August.
    3. Aldaihani, Majid M. & Quadrifoglio, Luca & Dessouky, Maged M. & Hall, Randolph, 2004. "Network design for a grid hybrid transit service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(7), pages 511-530, August.
    4. Suman, Hemant K. & Bolia, Nomesh B., 2019. "Improvement in direct bus services through route planning," Transport Policy, Elsevier, vol. 81(C), pages 263-274.
    5. Sandeepan Roy & Avijit Maji, 2019. "A Station Location Identification Model for an Integrated Interoperable High-Speed Rail System," ADBI Working Papers 956, Asian Development Bank Institute.
    6. Javier Duran & Lorena Pradenas & Victor Parada, 2019. "Transit network design with pollution minimization," Public Transport, Springer, vol. 11(1), pages 189-210, June.
    7. Verbas, İ. Ömer & Mahmassani, Hani S., 2015. "Exploring trade-offs in frequency allocation in a transit network using bus route patterns: Methodology and application to large-scale urban systems," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 577-595.
    8. Liang, Mingzhang & Xu, Min & Wang, Shuaian, 2025. "A novel multi-objective evolutionary algorithm for transit network design and frequency-setting problem considering passengers’ choice behaviors under station congestion," Transportation Research Part B: Methodological, Elsevier, vol. 197(C).
    9. Arbex, Renato Oliveira & da Cunha, Claudio Barbieri, 2015. "Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 355-376.
    10. Maria da Conceição Cunha, 1999. "On Solving Aquifer Management Problems with Simulated Annealing Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 13(3), pages 153-170, June.
    11. Xianmin Wang & Shuwang Wu & Zixiang Zhao & Haixiang Guo & Wenxue Chen, 2025. "Optimization of emergency rescue routes after a violent earthquake," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 121(4), pages 4585-4613, March.
    12. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    13. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    14. Anthony Karahalios & Sridhar Tayur & Ananth Tenneti & Amirreza Pashapour & F. Sibel Salman & Barış Yıldız, 2025. "A Quantum-Inspired Bilevel Optimization Algorithm for the First Responder Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 37(1), pages 172-188, January.
    15. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    16. Katarzyna Kalinowska-Górska & Fernando Solano Donado, 2014. "Constructing Fair Destination‐Oriented Directed Acyclic Graphs for Multipath Routing," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    17. Cao, Pengliang & Zheng, Yujing & Yuen, Kum Fai & Ji, Yuxiong, 2023. "Inter-terminal transportation for an offshore port integrating an inland container depot," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 178(C).
    18. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    19. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    20. Luss, Hanan & Wong, Richard T., 2005. "Graceful reassignment of excessively long communications paths in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 395-415, January.

    More about this item

    Keywords

    ;

    Statistics

    Access and download statistics

    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:ags:ndjtrf:206963. 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: AgEcon Search (email available below). General contact details of provider: http://www.trforum.org/journal/ .

    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.