IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v30y2013i02ns0217595912500509.html
   My bibliography  Save this article

On Planar Medianoid Competitive Location Problems With Manhattan Distance

Author

Listed:
  • KE FU

    (Lingnan College, Sun Yat-sen University, Guangzhou 510275, China)

  • ZHAOWEI MIAO

    (School of Management, Xiamen University, Xiamen 361005, China)

  • JIAYAN XU

    (Lingnan College, Sun Yat-sen University, Guangzhou 510275, China)

Abstract

A medianoid problem is a competitive location problem that determines the locations of a number of new service facilities that are competing with existing facilities for service to customers. This paper studies the medianoid problem on the plane with Manhattan distance. For the medianoid problem with binary customer preferences, i.e., a case where customers choose the closest facility to satisfy their entire demand, we show that the general problem is NP-hard and present solution methods to solve various special cases in polynomial time. We also show that the problem with partially binary customer preferences can be solved with a similar approach we develop for the model with binary customer preferences.

Suggested Citation

  • Ke Fu & Zhaowei Miao & Jiayan Xu, 2013. "On Planar Medianoid Competitive Location Problems With Manhattan Distance," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 30(02), pages 1-13.
    • Handle: RePEc:wsi:apjorx:v:30:y:2013:i:02:n:s0217595912500509
    DOI: 10.1142/S0217595912500509
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595912500509
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595912500509?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.

    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:wsi:apjorx:v:30:y:2013:i:02:n:s0217595912500509. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.