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

Emanuel Melachrinoudis, Emre Yavuz and Ruhollah Heydari

International Journal of Operational Research, 2015, vol. 23, issue 4, 427-450

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(m² + mn²) 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.

Keywords: semi-obnoxious facility; bi-objective location; Euclidean maximin; minisum; transport networks; modelling; transports costs; Turkey. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=70144 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:23:y:2015:i:4:p:427-450

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().