摘要
The importance of reducing the cost of container shipping as well as related transportation cost is gradually increasing with the internationalization of supply chains. There is no doubt that one of the potential ways of reducing these costs is the better utilization from the container volumes. Therefore, NP-hard container loading problems attracts the attention of many researchers. In this study, two algorithms for the container loading problems based on ant colony optimization are suggested. Having determined the parameters with the factorial design, the performance of the proposed algorithms is tested with the standard test cases in the literature and the results are discussed comparatively with reference to the other works in the literature.
学科与关键词
- A comparative review of 3D container loading algorithmsZhao, Xiaozhou*; Bennell, Julia A.; Bektas, Tolga; Dowsland, KathInternational Transactions in Operational Research, 2016, 23(1-2): 287-320.被引 95
- Constraints in container loading - A state-of-the-art reviewBortfeldt, Andreas; Waescher, GerhardEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 229(1): 1-20.被引 243
- A novel hybrid tabu search approach to container loadingLiu, Jiamin*; Yue, Yong; Dong, Zongran; Maple, Carsten; Keech, MalcolmCOMPUTERS & OPERATIONS RESEARCH, 2011, 38(4): 797-807.被引 42
