Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Information Technology Journal
  Year: 2012 | Volume: 11 | Issue: 12 | Page No.: 1722-1729
DOI: 10.3923/itj.2012.1722.1729
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

A Layout Pattern Based Particle Swarm Optimization for Constrained Packing Problems

Shi Yan-Jun, Wang Yi-Shou, Wang Long and Teng Hong-Fei

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.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    Dynamic Optimal Power Flow in FSWGs Integrated Power System
  •    On Optimal Decision for QoS-Aware Composite Service Selection
  •    An Efficient Process Mining Method Based on Discrete Particle Swarm Optimization
  •    A Simple Quantum-inspired Particle Swarm Optimization and its Application
How to cite this article:

Shi Yan-Jun, Wang Yi-Shou, Wang Long and Teng Hong-Fei, 2012. A Layout Pattern Based Particle Swarm Optimization for Constrained Packing Problems. Information Technology Journal, 11: 1722-1729.

DOI: 10.3923/itj.2012.1722.1729

URL: https://scialert.net/abstract/?doi=itj.2012.1722.1729

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 

Curve Bottom