A modified artificial bee colony algorithm for p-center problems.
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. T...
| Published in: | Scientific World Journal pp. 824196 - 824197 |
|---|---|
| Main Authors: | , , |
| Format: | research Journal Article |
| Published: |
Wiley-Blackwell
2014
|
| Online Access: | View this record in EBSCOhost |
| Summary: | 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. |
|---|