Bee colony optimization for the p-center problem

  • Authors:

  • Tatjana Davidović;Dušan Ramljak;Milica Šelmić;Dušan Teodorović

  • Affiliations:

  • Mathematical Institute, Serbian Academy of Sciences and Arts, Kneza Mihaila 36, P.O. Box 367, 11001 Belgrade, Serbia;Center for Information Science and Technology, Temple University, 322 Wachman Hall, 1805 North Broad Street, Philadelphia, PA 19122, USA;Faculty of Transport and Traffic Engineering, University of Belgrade, Vojvode Stepe 305, 11010 Belgrade, Serbia;Faculty of Transport and Traffic Engineering, University of Belgrade, Vojvode Stepe 305, 11010 Belgrade, Serbia

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2011

Quantified Score

Hi-index 0.05

Visualization

Abstract

Bee colony optimization (BCO) is a relatively new meta-heuristic designed to deal with hard combinatorial optimization problems. It is biologically inspired method that explores collective intelligence applied by the honey bees during nectar collecting process. In this paper we apply BCO to the p-center problem in the case of symmetric distance matrix. On the contrary to the constructive variant of the BCO algorithm used in recent literature, we propose variant of BCO based on the improvement concept (BCOi). The BCOi has not been significantly used in the relevant BCO literature so far. In this paper it is proved that BCOi can be a very useful concept for solving difficult combinatorial problems. The numerical experiments performed on well-known benchmark problems show that the BCOi is competitive with other methods and it can generate high-quality solutions within negligible CPU times.