DocumentCode
1831621
Title
Bee colony foraging algorithm for integer programming
Author
Liu, Yong ; Ma, Liang
Author_Institution
Sch. of Manage., Univ. of Shanghai for Sci. & Technol., Shanghai, China
Volume
5
fYear
2011
fDate
13-15 May 2011
Firstpage
199
Lastpage
201
Abstract
In order to solve integer programming, a bee colony foraging algorithm is proposed, which is based on the law of foraging bees. The principle of optimization algorithm is discussed and the implementation of the method is presented. The performance of bee colony foraging algorithm is compared with particle swarm optimization and chaotic ant swarm. The experimental results show bee colony foraging algorithm can handle integer programming efficiently and performs much better than other algorithms.
Keywords
chaos; integer programming; particle swarm optimisation; bee colony foraging algorithm; chaotic ant swarm; foraging bees; integer programming; optimization algorithm; particle swarm optimization; Algorithm design and analysis; Classification algorithms; Heuristic algorithms; Linear programming; Mathematical model; Optimization; Particle swarm optimization; bee colony foraging algorithm; integer programming; optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Business Management and Electronic Information (BMEI), 2011 International Conference on
Conference_Location
Guangzhou
Print_ISBN
978-1-61284-108-3
Type
conf
DOI
10.1109/ICBMEI.2011.5914458
Filename
5914458
Link To Document