点击次数：

论文类型：期刊论文

第一作者：Shi Y.-J.

通讯作者：Wang, Y.-S.; State Key Laboratory of Structural Analysis for Industrial Equipment, Dalian University of Technology, Dalian 116024, China

合写作者：Wang Y.-S.,Wang L.,Teng H.-F.

发表时间：2012-01-01

发表刊物：Information Technology Journal

收录刊物：EI、Scopus

卷号：11

期号：12

页面范围：1722-1729

ISSN号：18125638

摘要：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.