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

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