IDEAS home Printed from https://ideas.repec.org/a/ags/ndjtrf/206963.html
   My bibliography  Save this article

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.
    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. 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.
    2. Hachicha, Wafik & Ammeri, Ahmed & Masmoudi, Faouzi & Chachoub, Habib, 2010. "A comprehensive literature classification of simulation optimisation methods," MPRA Paper 27652, University Library of Munich, Germany.
    3. 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).
    4. Inayatullah Shah & Mohammed El Affendi & Basit Qureshi, 2020. "SRide: An Online System for Multi-Hop Ridesharing," Sustainability, MDPI, vol. 12(22), pages 1-29, November.
    5. 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.
    6. 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.
    7. Marco Pozzoni & Giulia Ceccarelli & Andrea Gorrini & Lorenza Manenti & Luigi Sanfilippo, 2023. "TomTom Data Applications for the Assessment of Tactical Urbanism Interventions: The Case of Bologna," Sustainability, MDPI, vol. 15(17), pages 1-32, August.
    8. Li, Yuanyuan & Liu, Yang & Xie, Jun, 2020. "A path-based equilibrium model for ridesharing matching," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 373-405.
    9. Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
    10. Suman, Hemant K. & Bolia, Nomesh B., 2019. "Improvement in direct bus services through route planning," Transport Policy, Elsevier, vol. 81(C), pages 263-274.
    11. 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.
    12. Siripirote, Treerapot & Sumalee, Agachai & Ho, H.W. & Lam, William H.K., 2015. "Statistical approach for activity-based model calibration based on plate scanning and traffic counts data," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 280-300.
    13. 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.
    14. 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.
    15. 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.
    16. Pierre-Léo Bourbonnais & Catherine Morency & Martin Trépanier & Éric Martel-Poliquin, 2021. "Transit network design using a genetic algorithm with integrated road network and disaggregated O–D demand data," Transportation, Springer, vol. 48(1), pages 95-130, February.
    17. Souilah, Abdelghani, 1995. "Simulated annealing for manufacturing systems layout design," European Journal of Operational Research, Elsevier, vol. 82(3), pages 592-614, May.
    18. Yuanhao Zhang & Jiabao Zhao, 2022. "A Novel Coordination Mechanism for Connected and Automated Vehicles in the Multi-Intersection Road Network," Energies, MDPI, vol. 15(14), pages 1-16, July.
    19. Zvyagina, Tatiana & Zvyagin, Petr, 2022. "A model of multi-objective route optimization for a vessel in drifting ice," Reliability Engineering and System Safety, Elsevier, vol. 218(PB).
    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

    Public Economics;

    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.