Log in

+34 977 759833sigef@urv.cat


ISSN (print) 1136-0593 · ISSN (online) 2445-4192

Solving p-median problems using bee foraging

J. Goddard, S. G. de-los-Cobos-Silva, M. A. Gutiérrez Andrade. Universidad Autónoma Metropolitana


In this paper the well-known p-median problem is tackled using a version of a heuristic bee algorithm. The proposed bee algorithm is explained and applied to eight different data sets. The results obtained are then compared to a classical, but effective, heuristic algorithm called the vertex substitution heuristic. The results on these data sets show that the proposed algorithm is competitive with the vertex substitution heuristic.



You must be a member to download the full article.

Log in or Sign up

Cron Job Starts