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 |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=103812869&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 103812869 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 1537744X 1BX5 jtl: Scientific World Journal issn: 1537744X maglogo: N pubinfo: dt: 2014 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 103812869 103812869 NLM24616648 2012505229 10.1155/2014/824196 NLM24616648 PMC3926279 103812869 ppf: 824196 ppct: 1 formats: tig: atl: A modified artificial bee colony algorithm for p-center problems. aug: au: Yurtkuran, Alkin Emel, Erdal Yurtkuran, Alkın affil: Department of Industrial Engineering, Uludag University, Görükle Campus, 16059 Bursa, Turkey sug: subj: Algorithms Bees and Wasps Animal Studies ab: 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. pubtype: Academic Journal doctype: research Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|