Freights loading optimization with balanced and unconcentrated loading constraints

Abstract

The optimization of high density and concentrated-weight freights loading requires an even distribution of the freight’s weight and unconcentrated loading on the floor of the car. Based on the characteristics of concentrated-weight category freights, an improvement method is put forward to build freight towers and a greedy-construction algorithm is utilized based on heuristic information for the initial layout. Then a feasibility analysis is performed to judge if the balanced and unconcentrated loading constrains are reached. Through introducing optimization or adjustment methods, an overall optimal solution can be obtained. Experiments are conducted using data generated from real cases showing the effectiveness of our approach: volume utility ratio of 90.4% and load capacity utility ratio of 86.7% which is comparably even to the packing of the general freights.

Keywords

loading layout / balancing constraint / concentrated loading / bending moment / construction algorithm

References

[1] ArmourDAn FTA best practice guide [M], 2011, Hilary Kingdom, Freight Transport Association: 12-17

[2] DaviesA, BischoffE. Weight distribution considerations in container loading [J]. European Journal of Operations Research, 1999, 114(3): 509-527

[3] EleyM. Solving container loading problems by block arrangement [J]. European Journal of Operational Research, 2002, 141(2): 393-409

[4] AraujoL J P, PinheiroP R. Heuristics backtracking and a typical genetic algorithm or the container loading problem with weight distribution [J]. Communications in Computer and Information Science, 2010, 106: 252-259

[5] EgebladJ. Placement of two- and three-dimensional irregular shapes for inertia moment and balance [J]. International Transactions in Operational Research, 2009, 16(6): 789-807

[6] BaldiM, PerboliG. The three-dimensional knapsack problem with balancing constraints [J]. Applied Mathematics and Computation, 2012, 218(19): 9802-9818

[7] TengH F, ChenY. A dual-system variable-grain cooperative coevolutionary algorithm: satellite-module layout design [J]. IEEE Transactions on Evolutionary Computation, 2010, 14(3): 438-455

[8] XuY-c, DongF-min. Genetic algorithm for rectangle layout optimization with equilibrium constraints [J]. Pattern Recognition and Artificial Intelligence, 2010, 23(6): 794-801

[9] LeiD-y, TangBo. Optimizing model and algorithms of loading and packing multi-piece freights into one car [J]. Journal of the China Railway Society, 2011, 33(9): 1-9

[10] KuangM, HanMei. The flat car bearing ability under concentrated loading [J]. Freight Transportation on Railway, 199937-39

[11] WangJ-g, LiX-hong. Research on avoiding concentrated loading on flat car by using unsymmetrical lateral pedestal [J]. Journal of Lanzhou Railway Institute, 1999, 18(1): 120-124

[12] LiY-qing. Discussion on avoiding of concentrated loading of the flat car [J]. Railway Science in Shanghai, 200442-43

[13] GaiY-xian. The optimal method on loading scheme of several uneven-weight goods [J]. Journal of Lanzhou Railway Institute, 2000, 19(6): 87-89

[14] AndrewL, HongM. The single container loading problem with axle weight constraints [J]. Int J Production Economics, 2013, 144(6): 358-369

[15] GehringH, BortfeldtA. A genetic algorithm for solving the container loading problem [J]. International Transactions in Operational Research, 1997, 4(5/6): 401-418

[16] PerboliG, CrainicT. An efficient meta-heuristic for multi-dimensional multi-container packing [C]. Proceedings of Seventh Annual IEEE Conference on Automation Science and Engineering, 2011, New York, T-ASE: 563-568