摘要
作为一类组合优化问题,多约束条件下的三维装载问题属于NP-Hard问题,其求解也是相当困难的。该文中从实际需要和具体应用出发,考虑了方向、重量、配置位置、装载优先顺序等约束条件,分析设计了物资填充策略和剩余空间处理策略,进而提出了一种多约束条件下的三维装载启发式优化算法,用于军用物资器材的存储和集装运输管理,从而对军用物资器材的合理存储和有效运输进行优化,以提高军用物资器材的存储空间利用率和运输的经济效益。
As a combinatorial optimization problem,three dimension packing problem with multi-constraints is NP-HARD problem. It is very difficult to obtain an optimal solution. Considering practical applications and constraints of orientation,weight,packing-place and priority, a heuristic method for the three dimension packing problem with multi-constraints is presented in this paper. It will be used in the storage and transportation of armament＇s equipment. Furthermore,it will optimize and improve the storage rate and transportation economy of armament＇s equipment.
出处
《计算机仿真》
CSCD
2005年第7期26-28,35,共4页
Computer Simulation
关键词
集装
组合优化
启发式算法
Loading
Combinatorial optimization
Heuristic arithmetic
