IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v246y2016i1d10.1007_s10479-015-1790-z.html
   My bibliography  Save this article

The 1-Center and 1-Highway problem revisited

Author

Listed:
  • J. M. Díaz-Báñez

    (Universidad de Sevilla)

  • M. Korman

    (National Institute of Informatics
    JST, ERATO, Kawarabayashi Large Graph Project)

  • P. Pérez-Lantero

    (Universidad de Valparaíso)

  • I. Ventura

    (Universidad de Sevilla)

Abstract

In this paper we extend the Rectilinear 1-center problem as follows: given a set $$S$$ S of $$n$$ n demand points in the plane, simultaneously locate a facility point $$f$$ f and a rapid transit line (i.e. highway) $$h$$ h that together minimize the expression $$\max _{p\in S}T_{h}(p,f)$$ max p ∈ S T h ( p , f ) , where $$T_{h}(p,f)$$ T h ( p , f ) denotes the travel time between $$p$$ p and $$f$$ f . A point of $$S$$ S uses $$h$$ h to reach $$f$$ f if $$h$$ h saves time: every point $$p\in S$$ p ∈ S moves outside $$h$$ h at unit speed under the $$L_1$$ L 1 metric, and moves along $$h$$ h at a given speed $$v>1$$ v > 1 . We consider two types of highways: (1) a turnpike in which the demand points can enter/exit the highway only at the endpoints; and (2) a freeway problem in which the demand points can enter/exit the highway at any point. We solve the location problem for the turnpike case in $$O(n^2)$$ O ( n 2 ) or $$O(n\log n)$$ O ( n log n ) time, depending on whether or not the highway’s length is fixed. In the freeway case, independently of whether the highway’s length is fixed or not, the location problem can be solved in $$O(n\log n)$$ O ( n log n ) time.

Suggested Citation

  • J. M. Díaz-Báñez & M. Korman & P. Pérez-Lantero & I. Ventura, 2016. "The 1-Center and 1-Highway problem revisited," Annals of Operations Research, Springer, vol. 246(1), pages 167-179, November.
  • Handle: RePEc:spr:annopr:v:246:y:2016:i:1:d:10.1007_s10479-015-1790-z
    DOI: 10.1007/s10479-015-1790-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-1790-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-015-1790-z?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
    ---><---

    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. Díaz-Báñez, J.M. & Korman, M. & Pérez-Lantero, P. & Ventura, I., 2013. "The 1-median and 1-highway problem," European Journal of Operational Research, Elsevier, vol. 225(3), pages 552-557.
    2. Carrizosa, Emilio & Rodriguez-Chia, Antonio M., 1997. "Weber problems with alternative transportation systems," European Journal of Operational Research, Elsevier, vol. 97(1), pages 87-93, February.
    3. 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.
    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. 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.
    2. Gilbert Laporte & Juan Mesa & Francisco Ortega & Ignacio Sevillano, 2005. "Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment," Annals of Operations Research, Springer, vol. 136(1), pages 49-63, April.
    3. Frank Plastria, 2009. "Asymmetric distances, semidirected networks and majority in Fermat–Weber problems," Annals of Operations Research, Springer, vol. 167(1), pages 121-155, March.
    4. Díaz-Báñez, J.M. & Korman, M. & Pérez-Lantero, P. & Ventura, I., 2014. "Locating a single facility and a high-speed line," European Journal of Operational Research, Elsevier, vol. 236(1), pages 69-77.
    5. Mari'n, Alfredo & Canovas, Lazaro & Landete, Mercedes, 2006. "New formulations for the uncapacitated multiple allocation hub location problem," European Journal of Operational Research, Elsevier, vol. 172(1), pages 274-292, July.
    6. Zhong Wang & Fengmin Lan & Zijing Lin & Lian Lian, 2021. "A Heuristic Method for Bus Rapid Transit Planning Based on the Maximum Trip Service," Sustainability, MDPI, vol. 13(11), pages 1-12, June.
    7. 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.
    8. Franco, L. & Velasco, F. & Gonzalez-Abril, L. & Mesa, Juan A., 2018. "Single-facility location problems in two regions with ℓ1- and ℓq-norms separated by a straight line," European Journal of Operational Research, Elsevier, vol. 269(2), pages 577-589.
    9. 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.
    10. Laporte, G. & Mesa, J.A. & Ortega, F.A. & Perea, F., 2011. "Planning rapid transit networks," Socio-Economic Planning Sciences, Elsevier, vol. 45(3), pages 95-104, September.
    11. Pazour, Jennifer A. & Meller, Russell D. & Pohl, Letitia M., 2010. "A model to design a national high-speed rail network for freight distribution," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(3), pages 119-135, March.
    12. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
    13. Frank Plastria & Mohamed Elosmani, 2008. "On the convergence of the Weiszfeld algorithm for continuous single facility location–allocation problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(2), pages 388-406, December.
    14. Luis Cadarso & Ángel Marín, 2017. "Improved rapid transit network design model: considering transfer effects," Annals of Operations Research, Springer, vol. 258(2), pages 547-567, November.
    15. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    16. Marco Botte, 2021. "Fixed gate point location problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 547-582, July.
    17. Franco, L. & Velasco, F. & Gonzalez-Abril, L., 2012. "Gate points in continuous location between regions with different ℓp norms," European Journal of Operational Research, Elsevier, vol. 218(3), pages 648-655.
    18. López-de-los-Mozos, M.C. & Mesa, Juan A. & Schöbel, Anita, 2017. "A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances," European Journal of Operational Research, Elsevier, vol. 260(1), pages 108-121.
    19. Mark-Christoph Körner & Juan Mesa & Federico Perea & Anita Schöbel & Daniel Scholz, 2014. "A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 227-253, April.
    20. 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.

    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:annopr:v:246:y:2016:i:1:d:10.1007_s10479-015-1790-z. 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: 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.