arrow
Return

The continuous artificial bee colony algorithm for binary optimization

delete2015-08-01
delete83
PRE
AI
M
Mustafa Servet Kıran *
DOI:10.1016/j.asoc.2015.04.007delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Artificial bee colony (ABC) algorithm, one of the swarm intelligence algorithms, has been proposed for continuous optimization, inspired intelligent behaviors of real honey bee colony. For the optimization problems having binary structured solution space, the basic ABC algorithm should be modified because its basic version is proposed for solving continuous optimization problems. In this study, an adapted version of ABC, ABC(bin) for short, is proposed for binary optimization. In the proposed model for solving binary optimization problems, despite the fact that artificial agents in the algorithm works on the continuous solution space, the food source position obtained by the artificial agents is converted to binary values, before the objective function specific for the problem is evaluated. The accuracy and performance of the proposed approach have been examined on well-known 15 benchmark instances of uncapacitated facility location problem, and the results obtained by ABC(bin), are compared with the results of continuous particle swarm optimization (CPSO), binary particle swarm optimization (BPSO), improved binary particle swarm optimization (IBPSO), binary artificial bee colony algorithm (binABC) and discrete artificial bee colony algorithm (DisABC). The performance of ABC(bin) is also analyzed under the change of control parameter values. The experimental results and comparisons show that proposed ABC(bin) is an alternative and simple binary optimization tool in terms of solution quality and robustness. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Artificial bee colony
Binary optimization
Conversion of continuous values
Uncapacitated facility location problem
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

No organization information available
Cited Papers

Cited Papers

An improved binary particle swarm optimization for unit commitment problem
err2009-05-01
err165
PREAI
errYuan, Xiaohui; Nie, Hao; So, Anjun; Wang, Liang; Yuan, Yanbin
errShare
errSave
errShare
errSave
Effect of calcination temperature on the properties of CZTS absorber layer prepared by RF sputtering for solar cell applications
err2017-04-19
err0
errOAAI
errSachin Rondiya; Avinash Rokade; Ashok Jadhavar; Shruthi Nair; Madhavi Chaudhari; Rupali Kulkarni; Azam Mayabadi; Adinath Funde; Habib Pathan; Sandesh Jadkar
errShare
errSave
researcher View more