IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v23y2015i4p427-450.html
   My bibliography  Save this article

An O(m² + mn²) algorithm for the bi-objective location problem on a network with mixed metrics

Author

Listed:
  • Emanuel Melachrinoudis
  • Emre Yavuz
  • Ruhollah Heydari

Abstract

In this paper, we formulate the Euclidean maximin with the network minisum bi-objective location model for a semi-obnoxious facility on a transportation network that is embedded into the Euclidean plane. The Euclidean distance metric is used in modelling the undesirable characteristics of the facility, using the maximin objective, while the network shortest path distance metric is used for modelling the transportation cost to these facilities using the minisum objective. After identifying the problem properties, we develop an O(m2 + mn2) algorithm for generating the efficient set and implement this algorithm in a realistic example involving the location of a semi-obnoxious facility in the province of Bursa in Turkey.

Suggested Citation

  • Emanuel Melachrinoudis & Emre Yavuz & Ruhollah Heydari, 2015. "An O(m² + mn²) algorithm for the bi-objective location problem on a network with mixed metrics," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 23(4), pages 427-450.
    • Handle: RePEc:ids:ijores:v:23:y:2015:i:4:p:427-450
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=70144
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:ijores:v:23:y:2015:i:4:p:427-450. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.