Back to Search
Start Over
矩形布局优化问题的局部搜索蜂群算法.
- Source :
-
Application Research of Computers / Jisuanji Yingyong Yanjiu . Jul2023, Vol. 40 Issue 7, p1998-2018. 6p. - Publication Year :
- 2023
-
Abstract
- The rectangular layout problem with balance constraints is a combinatorial optimization problem, which is difficult to solve when the problem scale increases. To improve the performance, this paper designed a bee colony algorithm. By analyzing the distribution of solutions, it provided a greedy initialization scheme for the population, selected an effective mutation operator, and limited the search space around the optimal solution. In addition, it designed a local search module to further improve the quality of the solution. On 10 open test cases, the algorithm was compared with the best known existing algorithms, and the performance of the proposed algorithm exceeded the existing algorithms on 9 large-scale cases. The theoretical analysis and experimental results show that the proposed algorithm can significantly improve the efficiency of solution. [ABSTRACT FROM AUTHOR]
- Subjects :
- *COMBINATORIAL optimization
*BEES algorithm
*ALGORITHMS
Subjects
Details
- Language :
- Chinese
- ISSN :
- 10013695
- Volume :
- 40
- Issue :
- 7
- Database :
- Academic Search Index
- Journal :
- Application Research of Computers / Jisuanji Yingyong Yanjiu
- Publication Type :
- Academic Journal
- Accession number :
- 165133096
- Full Text :
- https://doi.org/10.19734/j.issn.1001-3695.2022.12.0779