On solving multiobjective bin packing problems using evolutionary particle swarm optimization

• Published in: European journal of operational research Vol. 190; no. 2; pp. 357 - 382
• Main Authors: Liu, D.S., Tan, K.C., Huang, S.Y., Goh, C.K., Ho, W.K.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 16.10.2008; Elsevier; Elsevier Sequoia S.A
• Series: European Journal of Operational Research
• Subjects: Applied sciences; Bin packing; Evolutionary algorithms; Exact sciences and technology; Flows in networks. Combinatorial problems; Mathematical models; Multiobjective; Operational research and scientific management; Operational research. Management science; Optimization; Optimization algorithms; Packing problem; Pareto optimum; Particle swarm optimization; Studies; Multiobjective; Bin packing; Evolutionary algorithms; Particle swarm optimization; Statistical analysis; Pareto optimum; Evolutionary algorithm; Multiobjective programming; Bin packing problem; Combinatorial optimization; Modeling; Tractor; Airplane; Genetic algorithm; Lorry; Weight function; Fuel; Swarm intelligence; Ship
• ISSN: 0377-2217; 1872-6860; 1872-6860
• DOI: 10.1016/j.ejor.2007.06.032

The bin packing problem is widely found in applications such as loading of tractor trailer trucks, cargo airplanes and ships, where a balanced load provides better fuel efficiency and safer ride. In these applications, there are often conflicting criteria to be satisfied, i.e., to minimize the bins used and to balance the load of each bin, subject to a number of practical constraints. Unlike existing studies that only consider the issue of minimum bins, a multiobjective two-dimensional mathematical model for bin packing problems with multiple constraints (MOBPP-2D) is formulated in this paper. To solve MOBPP-2D problems, a multiobjective evolutionary particle swarm optimization algorithm (MOEPSO) is proposed. Without the need of combining both objectives into a composite scalar weighting function, MOEPSO incorporates the concept of Pareto’s optimality to evolve a family of solutions along the trade-off surface. Extensive numerical investigations are performed on various test instances, and their performances are compared both quantitatively and statistically with other optimization methods to illustrate the effectiveness and efficiency of MOEPSO in solving multiobjective bin packing problems.