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

The 1-median and 1-highway problem

Author

Listed:
  • Díaz-Báñez, J.M.
  • Korman, M.
  • Pérez-Lantero, P.
  • Ventura, I.

Abstract

In this paper we study a facility location problem in the plane in which a single point (median) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time of the clients to the facility, using the L1 or Manhattan metric. The highway is an alternative transportation system that can be used by the clients to reduce their travel time to the facility. We represent the highway by a line segment with fixed length and arbitrary orientation. This problem was introduced in [Computers & Operations Research 38(2) (2011) 525–538]. They gave both a characterization of the optimal solutions and an algorithm running in O(n3logn) time, where n represents the number of clients. In this paper we show that the previous characterization does not work in general. Moreover, we provide a complete characterization of the solutions and give an algorithm solving the problem in O(n3) time.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:225:y:2013:i:3:p:552-557
    DOI: 10.1016/j.ejor.2012.09.028
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712006923
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.09.028?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. Durier, Roland & Michelot, Christian, 1985. "Geometrical properties of the Fermat-Weber problem," European Journal of Operational Research, Elsevier, vol. 20(3), pages 332-343, 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. 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.
    2. 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.

    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. 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.
    2. Jack Brimberg & Robert Love & Nenad Mladenović, 2009. "Extension of the Weiszfeld procedure to a single facility minisum location model with mixed ℓ p norms," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 70(2), pages 269-283, October.
    3. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    4. Emilio Carrizosa & Frank Plastria, 2008. "Optimal Expected-Distance Separating Halfspace," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 662-677, August.
    5. Pawel Kalczynski & Atsuo Suzuki & Zvi Drezner, 2023. "Obnoxious facility location in multiple dimensional space," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 331-354, July.
    6. Carrizosa, E. J. & Puerto, J., 1995. "A discretizing algorithm for location problems," European Journal of Operational Research, Elsevier, vol. 80(1), pages 166-174, January.
    7. H. Martini & K.J. Swanepoel & G. Weiss, 2002. "The Fermat–Torricelli Problem in Normed Planes and Spaces," Journal of Optimization Theory and Applications, Springer, vol. 115(2), pages 283-314, November.
    8. 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.
    9. Carrizosa, Emilio & Conde, Eduardo, 2002. "A fractional model for locating semi-desirable facilities on networks," European Journal of Operational Research, Elsevier, vol. 136(1), pages 67-80, January.
    10. Brazil, M. & Ras, C.J. & Thomas, D.A., 2014. "A geometric characterisation of the quadratic min-power centre," European Journal of Operational Research, Elsevier, vol. 233(1), pages 34-42.
    11. Nickel, Stefan, 1998. "Restricted center problems under polyhedral gauges," European Journal of Operational Research, Elsevier, vol. 104(2), pages 343-357, January.
    12. E. Carrizosa & J. B. G. Frenk, 1998. "Dominating Sets for Convex Functions with Some Applications," Journal of Optimization Theory and Applications, Springer, vol. 96(2), pages 281-295, February.
    13. Frank Plastria, 2021. "Using the power of ideal solutions: simple proofs of some old and new results in location theory," 4OR, Springer, vol. 19(3), pages 449-467, September.
    14. J. Fliege, 1997. "Nondifferentiability Detection and Dimensionality Reduction in Minisum Multifacility Location Problems," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 365-380, August.
    15. Conde, Eduardo, 2007. "Minmax regret location-allocation problem on a network under uncertainty," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1025-1039, June.
    16. H Younies & G O Wesolowsky, 2007. "Planar maximal covering location problem under block norm distance measure," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 740-750, June.
    17. Romero-Morales, Dolores & Carrizosa, Emilio & Conde, Eduardo, 1997. "Semi-obnoxious location models: A global optimization approach," European Journal of Operational Research, Elsevier, vol. 102(2), pages 295-301, October.
    18. Stefan Nickel & Justo Puerto & Antonio M. Rodriguez-Chia, 2003. "An Approach to Location Models Involving Sets as Existing Facilities," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 693-715, November.
    19. Carrizosa, E. & Frenk, J.B.G., 1996. "Dominating Sets for Convex Functions with some Applications," Econometric Institute Research Papers EI 9657-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. Kafer, Barbara & Nickel, Stefan, 2001. "Error bounds for the approximative solution of restricted planar location problems," European Journal of Operational Research, Elsevier, vol. 135(1), pages 67-85, 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:eee:ejores:v:225:y:2013:i:3:p:552-557. 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.