A Modified Artificial Bee Colony Algorithm for p-Center Problems
SCIENTIFIC WORLD JOURNAL, 2014 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası:
- Basım Tarihi: 2014
- Doi Numarası: 10.1155/2014/824196
- Dergi Adı: SCIENTIFIC WORLD JOURNAL
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Bursa Uludağ Üniversitesi Adresli: Evet
Özet
The objective of the p-center problem is to locate p-centers on a network such that the maximum of the distances from each node to its nearest center is minimized. The artificial bee colony algorithm is a swarm-based meta-heuristic algorithm that mimics the foraging behavior of honey bee colonies. This study proposes a modified ABC algorithm that benefits from a variety of search strategies to balance exploration and exploitation. Moreover, random key-based coding schemes are used to solve the p-center problem effectively. The proposed algorithm is compared to state-of-the-art techniques using different benchmark problems, and computational results reveal that the proposed approach is very efficient.