A particle swarm optimization approach for the bi-objective load balancing problem

Abstract We propose in this paper a two level loading problem that consists in packing items into containers, then stowing these containers in an aircraft while maximizing both of the total weight and the priority of the loaded cargo. At the same time, the center of gravity should be within a reasonable distance from the balance ideal position. We state the mathematical formulation of the problem. The minimization of the number of containers is tackled using a multi-objective placement heuristic and the loading process performs a discrete multi-objective particle swarm optimization approach. An experimental investigation is performed on various test instances to illustrate the effectiveness of our algorithm in solving the bi-objective loading problem.

[1]  Ali Husseinzadeh Kashan,et al.  A discrete particle swarm optimization algorithm for scheduling parallel machines , 2009, Computers & industrial engineering.

[2]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[3]  Krzysztof Fleszar,et al.  New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..

[4]  C.A. Coello Coello,et al.  MOPSO: a proposal for multiple objective particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).