Data networks (2nd ed.)
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
SIAM Journal on Computing
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Communications of the ACM
Introduction to algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
TSDLMRA: an efficient multicast routing algorithm based on tabu search
Journal of Network and Computer Applications
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
A Hybrid Intelligent QoS Multicast Routing Algorithm in NGI
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Design and Analysis of Experiments
Design and Analysis of Experiments
A hybrid particle swarm optimization for job shop scheduling problem
Computers and Industrial Engineering
A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem
ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Computers and Operations Research
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Learning and Intelligent Optimization
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem
Natural Computing: an international journal
QPSO-Based qos multicast routing algorithm
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm
Computer Communications
QoS-driven multicast tree generation using Tabu search
Computer Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
This paper presents the first investigation on applying a particle swarm optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem. Steiner tree problems, being the underlining models of many applications, have received significant research attention within the meta-heuristics community. The literature on the application of meta-heuristics to multicast routing problems is less extensive but includes several promising approaches. Many interesting research issues still remain to be investigated, for example, the inclusion of different constraints, such as delay bounds, when finding multicast trees with minimum cost. In this paper, we develop a novel PSO algorithm based on the jumping PSO (JPSO) algorithm recently developed by Moreno-Perez et al. (Proc. of the 7th Metaheuristics International Conference, 2007), and also propose two novel local search heuristics within our JPSO framework. A path replacement operator has been used in particle moves to improve the positions of the particle with regard to the structure of the tree. We test the performance of our JPSO algorithm, and the effect of the integrated local search heuristics by an extensive set of experiments on multicast routing benchmark problems and Steiner tree problems from the OR library. The experimental results show the superior performance of the proposed JPSO algorithm over a number of other state-of-the-art approaches.