Abstract
Bin-packing problem is the distribution problem to load different volume of cargos in the limited load containers efficiently. The most efficient way is to minimize the number of using load containers and load the all of the cargos in the load containers. The packing problem belongs to the category of NP-hard problems. Although a basic mathematical model and algorithms of bin-packing problem have been proposed previously, it has not been proposed solving bin-packing problem considering reverse synergy that occurs with mixed load yet. In this study, we consider characteristics of the cargos and suggest a pairwise matrix in respect of reverse synergy between cargos. Also, we improve the mathematical model to reflect our suggestion. Therefore, through our proposition, we expect that our mathematical model will have a more elaborate optimal solution in a bin-packing problem.
Original language | English |
---|---|
Title of host publication | Progress in Systems Engineering - Proceedings of the 23rd International Conference on Systems Engineering |
Publisher | Springer Verlag |
Pages | 241-244 |
Number of pages | 4 |
ISBN (Print) | 9783319084213 |
DOIs | |
Publication status | Published - 2015 |
Event | 23rd International Conference on Systems Engineering, ICSEng 2014 - Las Vegas, NV, United States Duration: 2014 Aug 19 → 2014 Aug 21 |
Publication series
Name | Advances in Intelligent Systems and Computing |
---|---|
Volume | 1089 |
ISSN (Print) | 2194-5357 |
Other
Other | 23rd International Conference on Systems Engineering, ICSEng 2014 |
---|---|
Country/Territory | United States |
City | Las Vegas, NV |
Period | 14/8/19 → 14/8/21 |
Bibliographical note
Funding Information:This work was supported by the BK21 Plus(Big Data in Manufacturing and Logistics Systems, Korea University).
Keywords
- Bin-packing problem
- Load optimization
- Reverse synergy
ASJC Scopus subject areas
- Control and Systems Engineering
- General Computer Science