Paper
13 December 2021 An improved binary artificial bee colony algorithm for solving multidimensional knapsack problem
Author Affiliations +
Proceedings Volume 12087, International Conference on Electronic Information Engineering and Computer Technology (EIECT 2021); 1208719 (2021) https://doi.org/10.1117/12.2624707
Event: International Conference on Electronic Information Engineering and Computer Technology (EIECT 2021), 2021, Kunming, China
Abstract
In this article, we propose an improved binary heuristic algorithm based on artificial bee colony algorithm (ABC) for the multidimensional knapsack problem. The algorithm uses binary coding and multidimensional neighborhood search strategy to improve the search strategy of ABC algorithm. In addition, cross and mutation are introduced in the employed phase and scout phase. These measures enhance the global search capability of the algorithm, avoid the algorithm from falling into the local optimum in the iteration, and further improve the efficiency and accuracy of the algorithm. The calculation results show that the improved binary artificial bee colony algorithm in this paper can obtain high-quality solutions for various characteristic problems, and it is feasible and effective for solving multidimensional backpack problems
© (2021) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yao Wei "An improved binary artificial bee colony algorithm for solving multidimensional knapsack problem", Proc. SPIE 12087, International Conference on Electronic Information Engineering and Computer Technology (EIECT 2021), 1208719 (13 December 2021); https://doi.org/10.1117/12.2624707
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Optimization (mathematics)

Evolutionary algorithms

Genetic algorithms

Computer programming

Algorithm development

Space operations

Back to Top