Applying metaheuristic approaches on the single facility location problem with polygonal barriers
by Hossein Gharehmeshk Gharravi; Mohammad Saleh Farham
International Journal of Metaheuristics (IJMHEUR), Vol. 3, No. 4, 2014

Abstract: In this paper, we describe, improve, and compare the performance of four metaheuristic algorithms on the single facility location problem with barriers. The barriers are polygonal regions on a plane where neither facility location nor travelling is permitted. The objective function in this problem is non-convex justifying the application of metaheuristics and their robustness. We argue that this problem has interesting geometric properties such as size and distribution of barriers on the plane which can affect the choice of metaheuristics. Various test instances which reflect these geometric properties are designed in this paper. Through computational experiments, we discuss the effect of these properties on different variants of metaheuristics and propose the suitable metaheuristic and parameter setting for the single facility location problem with barriers.

Online publication date: Sat, 25-Apr-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 Metaheuristics (IJMHEUR):
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