Abstract:

To maximize of the utilization of the car capacity and the balancing level of the placement, an integer formulation model and an improved greedy adaptive search procedure (IGASP) are presented for the optimization of freights loading problem with balancing and axle weight constraints. Firstly, the algorithm use the designed construction heuristic to product the placements. Then, based on the analysis of boundary conditions of the center gravity, a feasibility analysis is introduced for the gained solutions, and two improvement procedures are designed for the ones with higher use rate but violate the axle weight constraints. Integrating these processes into the GASP, an improving procedure is further designed to search the optimal solution for the problem. The test with real world data demonstrates that the proposed algorithm is effective in solving the special freights loading problem with balancing and axle weight constraints.

Key words: logistics engineering, loading and layout, axle weight constraints, heuristic, balancing condition

摘要：

针对考虑轴重约束集装箱卡车货物优化装载问题，建立以最大化装载率和负重心偏离度为目标，以平衡及轴重为约束条件的数学模型，设计改进型贪婪自适应搜索算法（IGASP）对问题进行求解.算法先基于启发式方法构造布局方案，再结合重心边界条件分析对获得方案进行可行性分析，对违反约束装载率较高的方案提出了两种重心调整的方法，进而将有关过程融入贪婪自适应搜索形成解的改进机制实现问题优化求解.基于现实算例的试验分析，证明所提方法求解带轴重约束货物平衡装载问题具有较好效果.

关键词: 物流工程, 装载布局, 轴重约束, 启发式算法, 重心平衡