摘要
基于问题的复杂度、优化模型的现实度以及求解算法的适合度3方面,对三维装箱问题的研究现状进行分析,着重对货物与箱体的规模与异构性、优化目标与约束条件的实用性和求解方法的优缺点进行归纳;其次,总结三维装箱问题在以上3方面存在的不足;最后,从整体问题复杂化、优化目标多样化和约束条件现实化、假设条件最小化、求解方法实用化等5方面对三维装箱问题的研究进行展望。
Firstly,the state of the three -dimensional bin packing problem (3 -D BPP)was analyzed from three aspects———the complexity of 3 -D BPP,the fidelity of the optimization model and the flexibility of the al-gorithm.The characteristics of the achievements on 3 -D BPP,such as the size of cargoes and bins,the hetero-geneity of cargoes and bins,the practicability of objectives and constraints,and the advantage and disadvantage of methods,were summarized specially.Secondly,the shortcomings of the 3 aspects above were concluded.Fi-nally,the outlooks of 3 -D BPP were conducted.It is pointed out that the 3 -D BPP with high complexity,vari-able and realized model,least assumptions and practical algorithms will be the hot point in the nearly future.
出处
《铁道科学与工程学报》
CAS
CSCD
北大核心
2015年第5期1232-1242,共11页
Journal of Railway Science and Engineering
基金
国家自然科学基金资助项目(61403204)
关键词
三维装箱问题
启发算法
整型规划
遗传算法
多目标优化
three -dimensional bin packing problem
heuristics algorithm
integer programming
genetic algo-rithm
multi -objective optimization