An O(m² + mn²) algorithm for the bi-objective location problem on a network with mixed metrics
by Emanuel Melachrinoudis; Emre Yavuz; Ruhollah Heydari
International Journal of Operational Research (IJOR), Vol. 23, No. 4, 2015

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.

Online publication date: Sun, 28-Jun-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com