2007
DOI: 10.1016/j.ins.2007.06.018
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Objective Particle Swarm Optimization with time variant inertia and acceleration coefficients

Abstract: In this article we describe a novel Particle Swarm Optimization (PSO) approach to multi-objective optimization (MOO), called Time Variant Multi-Objective Particle Swarm Optimization (TV-MOPSO). TV-MOPSO is made adaptive in nature by allowing its vital parameters (viz., inertia weight and acceleration coefficients) to change with iterations. This adaptiveness helps the algorithm to explore the search space more efficiently. A new diversity parameter has been used to ensure sufficient diversity amongst the solut… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
213
0
1

Year Published

2010
2010
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 464 publications
(214 citation statements)
references
References 24 publications
(52 reference statements)
0
213
0
1
Order By: Relevance
“…Furthermore, this approach attaches more than the usual significance to the number of iterations, which makes it hard to adjust running time without observing surprising effects on performance. Similar changes to φ g and φ p have been proposed in the literature, typically favoring a linear increase or decrease of these coefficients over time, bounded by a maximum number of iterations [26], [27]. Nonlinear versions based on the same idea have also been proposed [14].…”
Section: Related Workmentioning
confidence: 97%
“…Furthermore, this approach attaches more than the usual significance to the number of iterations, which makes it hard to adjust running time without observing surprising effects on performance. Similar changes to φ g and φ p have been proposed in the literature, typically favoring a linear increase or decrease of these coefficients over time, bounded by a maximum number of iterations [26], [27]. Nonlinear versions based on the same idea have also been proposed [14].…”
Section: Related Workmentioning
confidence: 97%
“…In earlier papers, these two v alu es were cons idered equ al t o a cons tan t valu e (usually 2). But further studies suggest that these two parameters also to be adjusted [26]. Experiments show that you can get the best results, in spite of adjusting 1 c on 2.5 at the beginning of the search and then its gradual reduction toward 0.5.…”
Section: T T V T C T R P T X T C T R G T X Tmentioning
confidence: 99%
“…Each individual moves in search space with adjustable velocity and keeps the best position gained ever in its memo ry. The best position obtained by all the individuals of the population is transferred between all particles [22][23][24][25][26]. In fact it is supposed that each particle in each mo ment knows about the best position obtained by all the individuals of the population until that mo ment.…”
Section: Objective Functionmentioning
confidence: 99%
“…PSO has been extended to many fields [6,7,8]. But, in practical application, PSO method has the limitations of converging to undesired local solution or premature convergence [9]. Later many improved PSO methods are proposed to solve these problems.…”
Section: Introductionmentioning
confidence: 99%