基于遗传算法的装箱问题  

Packing Problem Based on Genetic Algorithm

作　　者：拉毛才旦 LA Mao-cai-dan(School of Mathematics and Computer Science,Northwest Minzu University,Lanzhou 730030,China)

机构地区：[1]西北民族大学数学与计算机科学学院,甘肃兰州730030

出　　处：《枣庄学院学报》2021年第5期34-39,共6页Journal of Zaozhuang University

基　　金：国家自然基金项目(项目编号:11761059);西北民族大学非线性分析创新团队(项目编号:1110130131).

摘　　要：装箱问题是经典的组合优化问题,具有高度复杂性,针对传统算法耗时较大且不能满足实际应用的需求.通过研究求解三维装箱问题的遗传算法,设计出一种能够满足实际应用需求的混合遗传算法,为家电商品装车问题提出具备合理性、科学性的方法,使得企业和客户的商业利润得到最大化.Packing problem is a classic combinatorial optimization problem with high complexity,which can not meet the needs of practical application due to the time-consuming of traditional algorithms.In this paper,a hybrid genetic algorithm is designed to meet the practical application requirements by studying the genetic algorithm for solving three-dimensional packing problem.The paper puts forward a rational and scientific method for the problem of home appliance goods loading,which maximizes the business profit of enterprises and customers.

关 键 词：装箱问题 混合遗传算法 家电商品 

分 类 号：O224[理学—运筹学与控制论]