A Particle Swarm Optimization Algorithm for the Multicast Routing Problem

DOI10.1007/978-3-319-09758-9_7zbMATH Open1317.90331OpenAlexW2229834434MaRDI QIDQ5265219FDOQ5265219

Authors: Yannis Marinakis, Athanasios Migdalas 

Publication date: 23 July 2015

Published in: Models, Algorithms and Technologies for Network Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09758-9_7

Recommendations

• scientific article; zbMATH DE number 7059783
• A tree-based particle swarm optimization for multicast routing
• A hybrid metaheuristic for routing on multicast networks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cited In (8)

• Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
• Particle swarm optimization for communication network design
• A particle swarm optimization approach to the multi level capacitated minimum spanning tree problem
• A tree-based particle swarm optimization for multicast routing
• Particle swarm optimization algorithm for the set partition problem
• Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
• A novel membrane algorithm based on particle swarm optimization for solving broadcasting problems
• Title not available (Why is that?)

Uses Software

• AntNet

This page was built for publication: A Particle Swarm Optimization Algorithm for the Multicast Routing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265219)