2014
DOI: 10.1109/tie.2014.2314075
|View full text |Cite
|
Sign up to set email alerts
|

Bi-Velocity Discrete Particle Swarm Optimization and Its Application to Multicast Routing Problem in Communication Networks

Abstract: This paper proposes a novel bi-velocity discrete particle swarm optimization (BVDPSO) approach and extends its application to the nondeterministic polynomial (NP) complete multicast routing problem (MRP). The main contribution is the extension of particle swarm optimization (PSO) from the continuous domain to the binary or discrete domain. First, a novel bi-velocity strategy is developed to represent the possibilities of each dimension being 1 and 0. This strategy is suitable to describe the binary characteris… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
38
0
1

Year Published

2014
2014
2020
2020

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 112 publications
(39 citation statements)
references
References 35 publications
0
38
0
1
Order By: Relevance
“…The most popular applications in machinery are trajectory optimization [30], defect classification [31,32], and scheduling problems [33,34]. Applications in communication consist of routing optimization [35], wireless communication system optimization [36], filter design optimization [37], etc. Relatively, there are very limited study or applications in biology [38], artificial intelligence [39,40], and some other crossing fields [41][42][43].…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…The most popular applications in machinery are trajectory optimization [30], defect classification [31,32], and scheduling problems [33,34]. Applications in communication consist of routing optimization [35], wireless communication system optimization [36], filter design optimization [37], etc. Relatively, there are very limited study or applications in biology [38], artificial intelligence [39,40], and some other crossing fields [41][42][43].…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Every component searches the problem space and advances to the solution using the best personal space as well as the best place achieved by population. The main advantages of Flock Algorithm could be cited as follows: simple concept, easy implementation, high power to control the parameters, high search power, high computation efficiency compared to mathematical algorithms and creative techniques [11] [12]. Many researchers discussed the application of Particle Swarm Optimization Algorithm (PSO) to solve the problem of routing with QoS limitations.…”
Section: Related Workmentioning
confidence: 99%
“…PSO is proposed by Eberhart and Kennedy in 1995, and has fast developed in recent years [38][39][40]. PSO is inspired by the foraging of birds.…”
Section: Optimize Nn By Psomentioning
confidence: 99%