Abstract
The p-centre problem is an important facility location problem. In this problem, the objective is to find a set Y of p vertices on an undirected weighted graph G = (V, E) in such a way that Y ⊆ V and the maximum distance over all the distances from vertices to their closest vertices in Y is minimised. The vertices in set Y are called centres. In this paper, we have proposed two swarm intelligence-based approaches for the p-centre problem. The first approach is based on artificial bee colony (ABC) algorithm, whereas the latter approach is based on invasive weed optimisation (IWO) algorithm. The ABC algorithm and IWO algorithm are relatively new metaheuristic techniques inspired respectively from collective intelligent behaviour shown by honeybees while foraging and the sturdy process of weed colonisation and dispersion in an ecosystem. Computational results on the well-known benchmark instances of p-centre problem show the effectiveness of our approaches in finding high quality solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
