Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems

  title={Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems},
  author={Rong Qu and Ying Xu and Juan P. Castro and Dario Landa Silva},
  journal={Journal of Heuristics},
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… 

The Multi-Constrained Multicast Routing Improved by Hybrid Bacteria Foraging-Particle Swarm Optimization

The proposed algorithm IBF-PSO outperforms its competitive algorithms and the efficiency and effectiveness of the algorithm was validated through the comparison study with other existing meta-heuristic algorithms.

Niched ant colony optimization with colony guides for QoS multicast routing

A Hybrid Scatter Search Algorithm for QoS Multicast Routing Problem

This paper presents a hybrid scatter search algorithm (ACO&SS) to solve QoS multicast routing problem, to hybridize the solution construction mechanism of the ACO with scatter search (SS).

A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs

A Steiner point candidate-based heuristic algorithm framework (SPCF) for solving the Steiner tree problem in graphs and shows that the proposed algorithms can achieve better solution quality and speed performance.

Multicast Routing Problem Using Tree-Based Cuckoo Optimization Algorithm

A tree-based typology including several spanning trees is created which combines the trees two by two and the Cuckoo Algorithm is used which is proved to be well converged and makes quick calculations.

A Novel Bi-Velocity Particle Swarm Optimization Scheme for Multicast Routing Problem

This approach is found to be optimal over its peers and outperforms recent heuristic algorithms and many advanced techniques used for the MRP problem, and outperform several PSO, ant colony optimization and genetic algorithms.

A Multi-objective Jumping Particle Swarm Optimization Algorithm for the Multicast Routing

Experimental results show that MOJPSO is more flexible and effective for exploring the search space to find more non-dominated solutions in the Pareto Front.

Multi-Agent Steiner Tree Algorithm Based on Branch-Based Multicast

The multi-agent branch-based multicast (BBMC) algorithm is proposed, which can maintain the fast speed of polynomialtime algorithms while matching the tree-cost optimality of intelligence algorithms.

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

BVDPSO outperforms not only several state-of-the-art and recent heuristic algorithms for the MRP problems, but also algorithms based on genetic algorithms, ant colony optimization, and PSO.

A New Hybrid GRASP with the Pilot Method Forthe Delay-Constrained Multicast Routing Problem

A new hybrid GRASP (Greedy Randomized Adaptive Search Procedure) approach where a pilot method is applied to further enhance the search for the Delay-Constrained Least-Cost (DCLC) multicast routing problem.



A novel particle swarm optimization for the Steiner tree problem in graphs

A novel discrete PSO for the STP (DPSO-STP), with the concept that the particle is guided by social and self cognition, is proposed, which obtains more promising results and performs better than the other iteration based algorithm, with much less computation.

A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing

This paper investigates a variable neighborhood descent (VND) search, a variant of variable neighborhood search, for the delay-constrained least-cost (DCLC) multicast routing problem, and finds that the VND algorithm outperforms other existing algorithms over a range of problem instances.

Hybrid of Genetic Algorithm and Particle Swarm Optimization for Multicast QoS Routing

A new evolutionary scheme for optimization of multicast QoS routing based on the hybrid of Genetic Algorithm and Particle Swarm Optimization (PSO), called HGAPSO, which has revealed an efficient method of the reconstruction of multicasts tree topology and the experimental results demonstrated better performance than the conventional GA optimization method.

Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing

This paper proposes various algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based onTabu Search (TS), addressing issues of the selected initial solution and move type as two major building blocks in short-term memory version of Tabu Search and longer- term memory with associated intensification and diversification strategies as advanced Tabu search techniques.

The application of Steiner trees to delay constrained multicast routing: a tabu search approach

  • N. Skorin-KapovM. Kos
  • Business
    Proceedings of the 7th International Conference on Telecommunications, 2003. ConTEL 2003.
  • 2003
This heuristic was developed on the basis of a tabu search heuristic designed for solving unconstrained minimum Steiner tree problems and tested on data from a publicly available library has shown that this heuristic gives near optimal solutions in moderate time and a moderate number of iterations for medium sized problems.

A GRASP heuristic for the delay-constrained multicast routing problem

A GRASP heuristic for the Delay-Constrained Multicast Routing (DCMR) where the maximum end-to-end delay in a multicast session is bounded is developed.

QPSO-Based QoS Multicast Routing Algorithm

The proposed method converts the QoS multicast routing problem into an integer programming problem and then solve the problem by QPSO to show the availability and efficiency of QPSo on the problem and its superiority to PSO and GA.