IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v171y2006i2p661-673.html
   My bibliography  Save this article

Strategic route extension in transit networks

Author

Listed:
  • Matisziw, Timothy C.
  • Murray, Alan T.
  • Kim, Changjoo

Abstract

No abstract is available for this item.

Suggested Citation

  • Matisziw, Timothy C. & Murray, Alan T. & Kim, Changjoo, 2006. "Strategic route extension in transit networks," European Journal of Operational Research, Elsevier, vol. 171(2), pages 661-673, June.
    • Handle: RePEc:eee:ejores:v:171:y:2006:i:2:p:661-673
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00657-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Current, J. R. & Re Velle, C. S. & Cohon, J. L., 1985. "The maximum covering/shortest path problem: A multiobjective network design and routing formulation," European Journal of Operational Research, Elsevier, vol. 21(2), pages 189-199, August.
    2. Brian Boffey & Subhash Narula, 1998. "Models for multi-path covering-routing problems," Annals of Operations Research, Springer, vol. 82(0), pages 331-342, August.
    3. Murray, Alan T. & Church, Richard L., 1997. "Facets for node packing," European Journal of Operational Research, Elsevier, vol. 101(3), pages 598-608, September.
    4. Gilbert Laporte & Yves Nobert & Serge Taillefer, 1988. "Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems," Transportation Science, INFORMS, vol. 22(3), pages 161-172, August.
    5. Laporte, Gilbert & Mesa, Juan A. & Ortega, Francisco A., 2000. "Optimization methods for the planning of rapid transit systems," European Journal of Operational Research, Elsevier, vol. 122(1), pages 1-10, April.
    6. S. C. Wirasinghe & Nadia S. Ghoneim, 1981. "Spacing of Bus-Stops for Many to Many Travel Demand," Transportation Science, INFORMS, vol. 15(3), pages 210-221, August.
    7. Alan T. Murray & Rex Davis, 2001. "Equity in Regional Service Provision," Journal of Regional Science, Wiley Blackwell, vol. 41(4), pages 557-600, November.
    8. Current, John R. & Schilling, David A., 1994. "The median tour and maximal covering tour problems: Formulations and heuristics," European Journal of Operational Research, Elsevier, vol. 73(1), pages 114-126, February.
    9. Murray, Alan T., 2001. "Strategic analysis of public transport coverage," Socio-Economic Planning Sciences, Elsevier, vol. 35(3), pages 175-188, September.
    10. Alan Murray, 2003. "A Coverage Model for Improving Public Transit System Accessibility and Expanding Access," Annals of Operations Research, Springer, vol. 123(1), pages 143-156, October.
    11. John R. Current & David A. Schilling, 1989. "The Covering Salesman Problem," Transportation Science, INFORMS, vol. 23(3), pages 208-213, August.
    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. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
    2. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
    3. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
    4. Kamruzzaman, Md. & Hine, Julian & Gunay, Banihan & Blair, Neale, 2011. "Using GIS to visualise and evaluate student travel behaviour," Journal of Transport Geography, Elsevier, vol. 19(1), pages 13-32.
    5. Zhao, Fang & Zeng, Xiaogang, 2008. "Optimization of transit route network, vehicle headways and timetables for large-scale transit networks," European Journal of Operational Research, Elsevier, vol. 186(2), pages 841-855, April.
    6. Murawski, Lisa & Church, Richard L., 2009. "Improving accessibility to rural health services: The maximal covering network improvement problem," Socio-Economic Planning Sciences, Elsevier, vol. 43(2), pages 102-110, June.
    7. Nkurunziza, Alphonse & Zuidgeest, Mark & Brussel, Mark & Van den Bosch, Frans, 2012. "Spatial variation of transit service quality preferences in Dar-es-Salaam," Journal of Transport Geography, Elsevier, vol. 24(C), pages 12-21.
    8. Alan Murray, 2010. "Advances in location modeling: GIS linkages and contributions," Journal of Geographical Systems, Springer, vol. 12(3), pages 335-354, September.
    9. Saghapour, Tayebeh & Moridpour, Sara & Thompson, Russell G., 2016. "Public transport accessibility in metropolitan areas: A new approach incorporating population density," Journal of Transport Geography, Elsevier, vol. 54(C), pages 273-285.
    10. Danwen Bao & Shijia Tian & Rui Li & Tianxuan Zhang & Ting Zhu, 2022. "Multi-Objective Decision Method for Airport Landside Rapid Transit Network Design," Networks and Spatial Economics, Springer, vol. 22(4), pages 767-801, December.
    11. Leo Bont & Hans Heinimann & Richard Church, 2015. "Concurrent optimization of harvesting and road network layouts under steep terrain," Annals of Operations Research, Springer, vol. 232(1), pages 41-64, September.

    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. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
    2. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
    3. Roy, Sandeepan & Maji, Avijit, 2019. "A Station Location Identification Model for an Integrated Interoperable High-Speed Rail System," ADBI Working Papers 956, Asian Development Bank Institute.
    4. Hugo M. Repolho & António P. Antunes & Richard L. Church, 2013. "Optimal Location of Railway Stations: The Lisbon-Porto High-Speed Rail Line," Transportation Science, INFORMS, vol. 47(3), pages 330-343, August.
    5. Russell Halper & S. Raghavan, 2011. "The Mobile Facility Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 413-434, August.
    6. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    7. Eusebio Angulo & Ricardo García-Ródenas & José Luis Espinosa-Aranda, 2016. "A Lagrangian relaxation approach for expansion of a highway network," Annals of Operations Research, Springer, vol. 246(1), pages 101-126, November.
    8. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    9. Hawas, Yaser E. & Hassan, Mohammad Nurul & Abulibdeh, Ammar, 2016. "A multi-criteria approach of assessing public transport accessibility at a strategic level," Journal of Transport Geography, Elsevier, vol. 57(C), pages 19-34.
    10. Renaud, Jacques & Boctor, Fayez F., 1998. "An efficient composite heuristic for the symmetric generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 571-584, August.
    11. Murawski, Lisa & Church, Richard L., 2009. "Improving accessibility to rural health services: The maximal covering network improvement problem," Socio-Economic Planning Sciences, Elsevier, vol. 43(2), pages 102-110, June.
    12. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    13. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    14. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    15. Prashant Singh & Ankush R. Kamthane & Ajinkya N. Tanksale, 2021. "Metaheuristics for the distance constrained generalized covering traveling salesman problem," OPSEARCH, Springer;Operational Research Society of India, vol. 58(3), pages 575-609, September.
    16. Kamruzzaman, Md. & Hine, Julian & Gunay, Banihan & Blair, Neale, 2011. "Using GIS to visualise and evaluate student travel behaviour," Journal of Transport Geography, Elsevier, vol. 19(1), pages 13-32.
    17. Cheng, Han & Mao, Chao & Madanat, Samer & Horvath, Arpad, 2018. "Minimizing the total costs of urban transit systems can reduce greenhouse gas emissions: The case of San Francisco," Transport Policy, Elsevier, vol. 66(C), pages 40-48.
    18. J. Beasley & E. Nascimento, 1996. "The Vehicle Routing-Allocation Problem: A unifying framework," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(1), pages 65-86, June.
    19. Eduardo Álvarez-Miranda & Markus Sinnl, 2020. "A branch-and-cut algorithm for the maximum covering cycle problem," Annals of Operations Research, Springer, vol. 284(2), pages 487-499, January.
    20. Ceder, Avishai (Avi) & Butcher, Matthew & Wang, Lingli, 2015. "Optimization of bus stop placement for routes on uneven topography," Transportation Research Part B: Methodological, Elsevier, vol. 74(C), pages 40-61.

    More about this item

    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:eee:ejores:v:171:y:2006:i:2:p:661-673. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.