IDEAS home Printed from https://ideas.repec.org/a/eee/soceps/v35y2001i3p175-188.html
   My bibliography  Save this article

Strategic analysis of public transport coverage

Author

Listed:
  • Murray, Alan T.

Abstract

No abstract is available for this item.

Suggested Citation

  • Murray, Alan T., 2001. "Strategic analysis of public transport coverage," Socio-Economic Planning Sciences, Elsevier, vol. 35(3), pages 175-188, September.
    • Handle: RePEc:eee:soceps:v:35:y:2001:i:3:p:175-188
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0038-0121(01)00004-0
    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. Constantine Toregas & Ralph Swain & Charles ReVelle & Lawrence Bergman, 1971. "The Location of Emergency Service Facilities," Operations Research, INFORMS, vol. 19(6), pages 1363-1373, October.
    2. Evans, A., 1990. "Competition And The Structure Of Local Bus Market," Papers 90-17, Flinders of South Australia - Discipline of Economics.
    3. R. Roth, 1969. "Computer Solutions to Minimum-Cover Problems," Operations Research, INFORMS, vol. 17(3), pages 455-465, June.
    4. Alberto Caprara & Matteo Fischetti & Paolo Toth, 1999. "A Heuristic Method for the Set Covering Problem," Operations Research, INFORMS, vol. 47(5), pages 730-743, October.
    5. Gleason, John M., 1975. "A set covering approach to bus stop location," Omega, Elsevier, vol. 3(5), pages 605-608, October.
    6. Alan T. Murray & Rex Davis, 2001. "Equity in Regional Service Provision," Journal of Regional Science, Wiley Blackwell, vol. 41(4), pages 557-600, November.
    7. Haddadi, Salim, 1997. "Simple Lagrangian heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 97(1), pages 200-204, February.
    Full references (including those not matched with items on IDEAS)

    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. Ran Wei & Alan Murray & Rajan Batta, 2014. "A bounding-based solution approach for the continuous arc covering problem," Journal of Geographical Systems, Springer, vol. 16(2), pages 161-182, April.
    2. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    3. Murray, Alan T., 2021. "Contemporary optimization application through geographic information systems," Omega, Elsevier, vol. 99(C).
    4. Guerriero, Francesca & Miglionico, Giovanna & Olivito, Filomena, 2016. "Location and reorganization problems: The Calabrian health care system case," European Journal of Operational Research, Elsevier, vol. 250(3), pages 939-954.
    5. Ablanedo-Rosas, José H. & Rego, César, 2010. "Surrogate constraint normalization for the set covering problem," European Journal of Operational Research, Elsevier, vol. 205(3), pages 540-551, September.
    6. Masashi Miyagawa, 2020. "Optimal number and length of point-like and line-like facilities of grid and random patterns," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 213-230, April.
    7. Shane N. Hall & Sheldon H. Jacobson & Edward C. Sewell, 2008. "An Analysis of Pediatric Vaccine Formulary Selection Problems," Operations Research, INFORMS, vol. 56(6), pages 1348-1365, December.
    8. Yijun Shi & Guofang Zhai & Lihua Xu & Quan Zhu & Jinyang Deng, 2019. "Planning Emergency Shelters for Urban Disasters: A Multi-Level Location–Allocation Modeling Approach," Sustainability, MDPI, vol. 11(16), pages 1-19, August.
    9. Bautista, Joaquín & Pereira, Jordi, 2006. "Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona," Omega, Elsevier, vol. 34(6), pages 617-629, December.
    10. Sergio Valdivia & Ricardo Soto & Broderick Crawford & Nicolás Caselli & Fernando Paredes & Carlos Castro & Rodrigo Olivares, 2020. "Clustering-Based Binarization Methods Applied to the Crow Search Algorithm for 0/1 Combinatorial Problems," Mathematics, MDPI, vol. 8(7), pages 1-42, July.
    11. Burkey, M.L. & Bhadury, J. & Eiselt, H.A., 2012. "A location-based comparison of health care services in four U.S. states with efficiency and equity," Socio-Economic Planning Sciences, Elsevier, vol. 46(2), pages 157-163.
    12. Alminana, Marcos & Pastor, Jesus T., 1997. "An adaptation of SH heuristic to the location set covering problem," European Journal of Operational Research, Elsevier, vol. 100(3), pages 586-593, August.
    13. Grubesic, Tony H. & Matisziw, Timothy C. & Murray, Alan T., 2012. "Assessing geographic coverage of the essential air service program," Socio-Economic Planning Sciences, Elsevier, vol. 46(2), pages 124-135.
    14. Yagiura, Mutsunori & Kishida, Masahiro & Ibaraki, Toshihide, 2006. "A 3-flip neighborhood local search for the set covering problem," European Journal of Operational Research, Elsevier, vol. 172(2), pages 472-499, July.
    15. Matisziw, Timothy C. & Murray, Alan T., 2009. "Siting a facility in continuous space to maximize coverage of a region," Socio-Economic Planning Sciences, Elsevier, vol. 43(2), pages 131-139, June.
    16. Li, Shengyin & Huang, Yongxi, 2014. "Heuristic approaches for the flow-based set covering problem with deviation paths," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 144-158.
    17. Gang Du & Chuanwang Sun, 2015. "Location Planning Problem of Service Centers for Sustainable Home Healthcare: Evidence from the Empirical Analysis of Shanghai," Sustainability, MDPI, vol. 7(12), pages 1-21, November.
    18. Lee, Chungmok & Han, Jinil, 2017. "Benders-and-Price approach for electric vehicle charging station location problem under probabilistic travel range," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 130-152.
    19. Martens, Karel & Golub, Aaron & Robinson, Glenn, 2012. "A justice-theoretic approach to the distribution of transportation benefits: Implications for transportation planning practice in the United States," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(4), pages 684-695.
    20. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.

    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:soceps:v:35:y:2001:i:3:p:175-188. 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/seps .

    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.