On solving multiobjective bin packing problems using evolutionary particle swarm optimization

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.

[1]  Tong Heng Lee,et al.  A Study on Distribution Preservation Mechanism in Evolutionary Multi-Objective Optimization , 2005, Artificial Intelligence Review.

[2]  Saul Krasner,et al.  The Ubiquity of chaos , 1990 .

[3]  Loo Hay Lee,et al.  A hybrid multiobjective evolutionary algorithm for solving truck and trailer vehicle routing problems , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[4]  Nachol Chaiyaratana,et al.  Using a co-operative co-evolutionary genetic algorithm to solve a three-dimensional container loading problem , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[5]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[6]  Kathryn A. Dowsland,et al.  Genetic Algorithms-a Tool for OR? , 1996 .

[7]  Larry W. Jacobs,et al.  A morph-based simulated annealing heuristic for a modified bin-packing problem , 1997 .

[8]  Yuji Shigehiro,et al.  Stochastic tabu search for rectangle packing , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[9]  Kay Chen Tan,et al.  A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems , 2006, Eur. J. Oper. Res..

[10]  Jürgen Teich,et al.  Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO) , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[11]  Graham Kendall,et al.  A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem , 2006, Oper. Res..

[12]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[13]  R. P. Pargas,et al.  A parallel stochastic optimization algorithm for solving 2D bin packing problems , 1993, Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications.

[14]  David Naso,et al.  Single and Multi-objective Evolutionary Algorithms for the Coordination of Serial Manufacturing Operations , 2006, J. Intell. Manuf..

[15]  M. N. Vrahatis,et al.  Particle swarm optimization method in multiobjective problems , 2002, SAC '02.

[16]  David Simchi-Levi,et al.  Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures , 1994, Oper. Res..

[17]  E. Hopper,et al.  A genetic algorithm for a 2D industrial packing problem , 1999 .

[18]  Michel Gourgand,et al.  Bin packing extensions for solving an industrial line balancing problem , 2003, Proceedings of the IEEE International Symposium onAssembly and Task Planning, 2003..

[19]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[20]  Chak-Kuen Wong,et al.  Bin Packing with Geometric Constraints in Computer Network Design , 1978, Oper. Res..

[21]  A. A. Tkachuk,et al.  The application of the distributed genetic algorithm to the decision of the packing in containers problem , 2002, Proceedings 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS 2002).

[22]  Daniele Vigo,et al.  Heuristic algorithms for the three-dimensional bin packing problem , 2002, Eur. J. Oper. Res..

[23]  M. Mongeau,et al.  Optimization of aircraft container loading , 2003 .

[24]  Cheng-Yan Kao,et al.  On solving rectangle bin packing problems using genetic algorithms , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[25]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[26]  Tian Hou Seow,et al.  Particle swarm inspired evolutionary algorithm (PS-EA) for multiobjective optimization problems , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[27]  R. Spillman.  Solving large knapsack problems with a genetic algorithm , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[28]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[29]  Chunguang Zhou,et al.  Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[30]  Hongfei Teng,et al.  An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles , 1999, Eur. J. Oper. Res..

[31]  John H. Vande Vate,et al.  Balanced Loading , 1992, Oper. Res..

[32]  L. Fogel,et al.  European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 1996 .

[33]  Thomas Philip Runarsson,et al.  Dynamic dual bin packing using fuzzy objectives , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[34]  Wallace Kit-Sang Tang,et al.  A hybrid genetic approach for container loading in logistics industry , 2005, IEEE Transactions on Industrial Electronics.

[35]  H. Van de Vel,et al.  An Application of the Bin-packing Technique to Job Scheduling on Uniform Processors , 1991 .

[36]  Cheng-Yan Kao,et al.  A stochastic approach for the one-dimensional bin-packing problems , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.

[37]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[38]  J. O. Berkey,et al.  Two-Dimensional Finite Bin-Packing Algorithms , 1987 .

[39]  Jonathan E. Fieldsend,et al.  A Multi-Objective Algorithm based upon Particle Swarm Optimisation, an Efficient Data Structure and , 2002 .

[40]  Ulf Grenander,et al.  A stochastic nonlinear model for coordinated bird flocks , 1990 .

[41]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..

[42]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[43]  E. F. Khor,et al.  An Evolutionary Algorithm with Advanced Goal and Priority Specification for Multi-objective Optimization , 2011, J. Artif. Intell. Res..

[44]  S. Martello,et al.  Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .

[45]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

[46]  Hitoshi Iima,et al.  A new design of genetic algorithm for bin packing , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..