A swarm intelligence approach for the p-median problem
by B. Jayalakshmi; Alok Singh
International Journal of Metaheuristics (IJMHEUR), Vol. 5, No. 2, 2016

Abstract: p-median problem is a well-known facility location problem which aims at locating p number of facilities over n demand points in such a way that the sum of distances from all the demand points to their respective closest facilities is minimised. In this paper, we have proposed an artificial bee colony (ABC) algorithm-based approach for solving this NP-hard problem. The ABC algorithm is a recently proposed metaheuristic technique that has been used successfully for solving numerous NP-hard combinatorial optimisation problems. We have tested the proposed algorithm on the OR-Library and Galvao p-median benchmark test instances, and the results are compared with those obtained with some other approaches available in the literature. The computational results show that the proposed algorithm outperforms other methods.

Online publication date: Wed, 09-Nov-2016

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