An Improved Multi-Objective Particle Swarm Optimization Algorithm Based on Adaptive Local Search

This paper demonstrates a novel local search approach based on an adaptive (time variant) search space index improving the exploration ability as well as diversity in multi-objective Particle Swarm Optimization. The novel strategy searches for the neighbourhood particles in a range which gradually i...

Full description

Saved in:
Bibliographic Details
Published in:International journal of applied evolutionary computation Vol. 8; no. 2; pp. 1 - 29
Main Authors: Kapse, Swapnil Prakash, Krishnapillai, Shankar
Format: Journal Article
Language:English
Published: Hershey IGI Global 01.04.2017
Subjects:
Adaptive algorithms
Algorithms
Analysis
Archives
Archives & records
Archiving
Convergence
Genetic algorithms
Mathematical optimization
Mechanical engineering
Multiple objective analysis
Mutation
Optimization algorithms
Particle swarm optimization
Searching
Strategy
Swarm intelligence
Velocity
India
ISSN:1942-3594, 1942-3608
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper demonstrates a novel local search approach based on an adaptive (time variant) search space index improving the exploration ability as well as diversity in multi-objective Particle Swarm Optimization. The novel strategy searches for the neighbourhood particles in a range which gradually increases with iterations. Particles get updated according to the rules of basic PSO and the non-dominated particles are subjected to Evolutionary update archiving. To improve the diversity, the archive is truncated based on crowding distance parameter. The leader is chosen among the candidates in the archive based on another local search. From the simulation results, it is clear that the implementation of the new scheme results in better convergence and diversity as compared to NSGA-II, CMPSO, and SMPSO reported in literature. Finally, the proposed algorithm is used to solve machine design based engineering problems from literature and compared with existing algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1942-3594
1942-3608
DOI:10.4018/IJAEC.2017040101