Affordable Access

Access to the full text

Duality evolution: an efficient approach to constraint handling in multi-objective particle swarm optimization

Authors
  • Ebrahim Sorkhabi, Amin1
  • Deljavan Amiri, Mehran2
  • Khanteymoori, Ali Reza2
  • 1 Islamic Azad University – Qazvin Branch, Computer Engineering Department, Qazvin, Iran , Qazvin (Iran)
  • 2 University of Zanjan, Computer Engineering Department, Zanjan, Iran , Zanjan (Iran)
Type
Published Article
Journal
Soft Computing
Publisher
Springer-Verlag
Publication Date
Nov 14, 2016
Volume
21
Issue
24
Pages
7251–7267
Identifiers
DOI: 10.1007/s00500-016-2422-5
Source
Springer Nature
Keywords
License
Yellow

Abstract

This paper proposes an efficient approach for constraint handling in multi-objective particle swarm optimization. The particles population is divided into two non-overlapping populations, named infeasible population and feasible population. The evolution process in each population is done independent of the other one. The infeasible particles are evolved in the constraint space toward feasibility. During evolution process, if an infeasible particle becomes a feasible one, it migrates to feasible population. In a parallel process, the particles in feasible population are evolved in the objective space toward Pareto optimality. At each generation of multi-objective particle swarm optimization, a leader should be assigned to each particle to move toward it. In the proposed method, a different leader selection algorithm is proposed for each population. For feasible population, the leader is selected using a priority-based method in three levels and for infeasible population, a leader replacement method integrated by an elitism-based method is proposed. The proposed approach is tested on several constrained multi-objective optimization benchmark problems, and its results are compared with two popular state-of-the-art constraint handling multi-objective algorithms. The experimental results indicate that the proposed algorithm is highly competitive in solving the benchmark problems.

Report this publication

Statistics

Seen <100 times