Please use this identifier to cite or link to this item:
|Title:||On solving multiobjective bin packing problems using particle swarm optimization|
|Citation:||Liu, D.S.,Tan, K.C.,Goh, C.K.,Ho, W.K. (2006). On solving multiobjective bin packing problems using particle swarm optimization. 2006 IEEE Congress on Evolutionary Computation, CEC 2006 : 2095-2102. ScholarBank@NUS Repository.|
|Abstract:||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 consider only the minimization of bins, a two-objective mathematical model for the bin packing problem with multiple constraints is formulated in this paper. Without the need of combining both objectives into a composite scalar, a hybrid multiobjective particle swarm optimization algorithm (HMOPSO) incorporating the concept of Pareto's optimality to evolve a family of solutions along the trade-off is proposed. The algorithm is also featured with bin packing heuristic, variable length representation, and specialized mutation operator to solve the multiobjective and multi-model combinatorial bin packing problem. Extensive simulations are performed on various test instances, and their performances are compared both quantitatively and statistically with other optimization methods. Each of the proposed features is also explicitly examined to illustrate their usefulness in solving the multiobjective bin packing problem. © 2006 IEEE.|
|Source Title:||2006 IEEE Congress on Evolutionary Computation, CEC 2006|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.