An artificial bee colony algorithm for the p-median facility location problem
by Mehmet Basti; Mehmet Sevkli
International Journal of Metaheuristics (IJMHEUR), Vol. 4, No. 1, 2015

Abstract: Artificial bee colony (ABC) algorithm is one of the recent meta-heuristics used for solving combinatorial optimisation problems. In this paper, an ABC algorithm model is employed for solving the p-median problem, which is an important type of the facility location problems and belongs to the class of NP-hard problems. The algorithm has been tested and widely used. The OR-Library and Galvao p-median benchmarking problems were compared with other meta-heuristic methods from the literature. The experimentation reveals that the employed algorithm gives promising results when comparing with other meta-heuristic methods.

Online publication date: Thu, 17-Sep-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