Swarm-based intelligent optimization approach for layout problem

Layout problem is a kind of NP-Complete problem. It is concerned more and more in recent years and arises in a variety of application fields such as the layout design of spacecraft modules, plant equipment, platforms of marine drilling well, shipping, vehicle and robots. The algorithms based on swar...

Full description

Saved in:
Bibliographic Details
Published in:Multimedia tools and applications 2017-10, Vol.76 (19), p.19445-19461
Main Authors: Zhao, Fengqiang, Li, Guangqiang, Zhang, Rubo, Du, Jialu, Guo, Chen, Zhou, Yiran, Lv, Zhihan
Format: Article
Language:English
Subjects:
Algorithms
Circuit boards
Computer Communication Networks
Computer Science
Convergence
Data Structures and Information Theory
Drilling
Drilling machines (tools)
Evolutionary algorithms
Genetic algorithms
Marine plants
Multimedia Information Systems
Optimization
Particle swarm optimization
Printed circuits
Shipping
Spacecraft design
Spacecraft modules
Special Purpose and Application-Based Systems
Swarm intelligence
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Layout problem is a kind of NP-Complete problem. It is concerned more and more in recent years and arises in a variety of application fields such as the layout design of spacecraft modules, plant equipment, platforms of marine drilling well, shipping, vehicle and robots. The algorithms based on swarm intelligence are considered powerful tools for solving this kind of problems. While usually swarm intelligence algorithms also have several disadvantages, including premature and slow convergence. Aiming at solving engineering complex layout problems satisfactorily, a new improved swarm-based intelligent optimization algorithm is presented on the basis of parallel genetic algorithms. In proposed approach, chaos initialization and multi-subpopulation evolution strategy based on improved adaptive crossover and mutation are adopted. The proposed interpolating rank-based selection with pressure is adaptive with evolution process. That is to say, it can avoid early premature as well as benefit speeding up convergence of later period effectively. And more importantly, proposed PSO update operators based on different versions PSO are introduced into presented algorithm. It can take full advantage of the outstanding convergence characteristic of particle swarm optimization (PSO) and improve the global performance of the proposed algorithm. An example originated from layout of printed circuit boards (PCB) and plant equipment shows the feasibility and effectiveness of presented algorithm.
ISSN:1380-7501
1573-7721
DOI:10.1007/s11042-015-3174-4