Have library access?
IP:18.97.14.91
  • Theses

裝箱問題於商品組合之應用

Applications of Bin Packing Problem on Combination of Goods

Advisor : 陳榮昌
For better promotion, authorized us if you are the author.

Abstracts


裝箱問題於商品組合之應用(Bin Packing Problem on Combination of Goods, BPPCG) 發生在許多商業情境,例如中元普渡、中秋節、新年…等。在這些重要節日或大型聚會中,短時間內將產生大量的商品需求。零售業者必須在眾多的候選商品中,規劃出一組既能符合預算、商品種類限制且能在消費者可接受的時間內裝入紙箱中的商品組合。有鑑於此,為有效協助業者能在短時間內規劃出多種可行方案,經文獻回顧後,本研究運用在求解裝箱問題具良好求解品質與績效的基因演算法 (Genetic Algorithm, GA),並同時引入體積鬆弛因子 (Volume Relaxation Factor) ,將複雜的三維裝箱問題一維化後求得可行解。 本研究以中元普渡商品組合為實務案例進行多項實驗。研究結果顯示,運用基因演算法求解不僅可獲得與窮舉法相同的最佳解,也可於較合理的時間內規劃出適應性良好的商品組合;此外,將求解出的商品組合進行實際裝箱測試,亦可在可接受的時間內完全放置於包裝箱中。提高包裝箱容積的相對重要性、商品組合品項數及更換包裝箱尺寸皆有助於找出適當的商品組合容積率,在實務上,可藉此減少商品因搖晃而導致碰撞損毀的情形。

Parallel abstracts


The bin packing problem on combination of goods (BPPCG) occurs in many commercial contexts, such as the Zhongyuan Festival, the Mid-Autumn Festival and the Lunar New Year. These important festivals or large gatherings generate an enormous demand for commodities in a short period of time. Out of a multitude of commodities, retailers must devise a combination of goods that complies with the budget and restrictions on the types of goods, and which they can package within the time deemed acceptable by the consumers. Consequently, after reviewing certain academic papers, this study leveraged the genetic algorithm (GA), which has been effective in producing quality solutions to the bin packing problem, to help retailers work out several feasible plans in a short period of time. The volume relaxation factor was also introduced to turn the complex, three-dimensional bin packing problem into a one-dimensional problem in search for the solutions. This study conducted multiple experiments using combinations of Zhongyuan Festival goods as a practical example. The research results showed that using the genetic algorithm not only obtained an optimal solution in the same way as the exhaustive method, but also succeeded in devising an adaptable combination of goods in a reasonable amount of time. Besides, during the actual packing test, the resultant combination was proved to fit completely into the package box within an acceptable amount of time. Increasing the relative importance of the packing volume, raising the number of combination items, and changing the package size are also useful in finding the appropriate volume ratio of the combination. In practice, this can reduce collision and damage caused by the shaking of the packages.

References


楊至中(民95)。一維裝箱問題之多重評估基因演算法(未出版之碩士論文)。中原大學資訊管理研究所,桃園市。
Chen, C. S., Lee, S. M., & Shen, Q. S. (1995). An analytical model for the container loading problem. European Journal of Operational Research, 80(1), 68-76.
Delorme, M., Iori, M., & Martello, S. (2016). Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research, 255(1), 1-20.
Dyckhoff, H. (1981). A new linear programming approach to the cutting stock problem. Operations Research, 29(6), 1092-1104.
Falkenauer, E. (1994). A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary computation, 2(2), 123-144.

Read-around