Artificial Bee Colony for Solving Multi-Objectives Three-Dimensional Knapsack Problem
© 2020 ACM. The objectives of this research aim to apply the mathematical model, to propose an Artificial Bee Colony for Solving Three-Dimensional Knapsack Problem and to determine the optimal parameters of an Artificial Bee Colony Algorithm. This work application of heuristic approach is used for o...
Saved in:
Main Authors: | Suriya Phongmoo, Komgrit Leksakul, Pongsawat Premphet |
---|---|
格式: | Conference Proceeding |
出版: |
2020
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85088586257&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/70434 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Quantum relaxation for solving multiple knapsack problems
由: SHARMA, Monit, et al.
出版: (2024) -
An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
由: Kanokwatt Shiangjen, et al.
出版: (2018) -
An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
由: Shiangjen K., et al.
出版: (2017) -
Heuristic approach for solving employee bus routes in a large-scale industrial factory
由: Komgrit Leksakul, et al.
出版: (2018) -
Heuristic approach for solving employee bus routes in a large-scale industrial factory
由: Komgrit Leksakul, et al.
出版: (2018)