Research on Bin Packing Problem Based on Supply Chain Economic Efficiency
- DOI
- 10.2991/978-94-6463-256-9_37How to use a DOI?
- Keywords
- bin packing problem; exact algorithm; approximate algorithm; heuristic Algorithm
- Abstract
The study of the bin packing problem is of great academic significance and plays an extremely important role in the economy and society. By studying the bin packing problem, find the optimal packing layout to achieve resource conservation and economic benefits. This paper summarizes, analyzes and concludes the constraints and algorithms of the packing problem under the background of one-dimensional and two-dimensional, puts forward the shortcomings of the current research on the bin packing problem, and gives corresponding suggestions for the shortcomings of the problem and proposes the future research directions. The experiments show that RLHA significantly outperformed the other four algorithms.
- Copyright
- © 2024 The Author(s)
- Open Access
- Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
Cite this article
TY - CONF AU - Junjie Zhu PY - 2023 DA - 2023/10/09 TI - Research on Bin Packing Problem Based on Supply Chain Economic Efficiency BT - Proceedings of the 2023 4th International Conference on Management Science and Engineering Management (ICMSEM 2023) PB - Atlantis Press SP - 343 EP - 354 SN - 2352-5428 UR - https://doi.org/10.2991/978-94-6463-256-9_37 DO - 10.2991/978-94-6463-256-9_37 ID - Zhu2023 ER -