location: Current position: Shi Yanjun >> Scientific Research >> Paper Publications

A layout pattern based particle swarm optimization for constrained packing problems

Hits:

Indexed by:期刊论文

Date of Publication:2012-01-01

Journal:Information Technology Journal

Included Journals:EI、Scopus

Volume:11

Issue:12

Page Number:1722-1729

ISSN No.:18125638

Abstract:A Layout Pattern Based Particle Swarm Optimization algorithm (LPPSO) is presented herein for solving the two-dimensional packing problem with constraints. In the optimizing process of LPPSO, some individuals are constructed according to non-isomorphic layout pattern and these individuals are added into the current population of Particle Swarm Optimization (PSO) algorithm to replace the bad individuals, the new population is created as a result. Moreover, a non-isomorphic layout pattern is constructed based on exact boundary line approach to avoid premature convergence and improve the computational efficiency. This study also discussed the basic idea, key problem and the process of the proposed LPPSO algorithm. Two examples of constrained packing problems showed that LPPSO was feasible and effective in the experiments. ? 2012 Asian Network for Scientific Information.

Pre One:A dual-system method with differential evolution and genetic algorithm for loop-based station sequencing problem

Next One:Dual-system cooperative co-evolutionary differential evolution with human-computer cooperation for satellite module layout optimization