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

Authors:
Rong Qu;Ying Xu;Graham Kendall
Affiliations:
The Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, The University of Nottingham, Nottingham, UK;The Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, The University of Nottingham, Nottingham, UK and School of Computer and Communication, Hunan Universit ...;The Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, The University of Nottingham, Nottingham, UK
Venue:
Learning and Intelligent Optimization
Year:
2009

Citing 0
Cited 4

Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Stabilized branch-and-price for the rooted delay-constrained steiner tree problem

INOC'11 Proceedings of the 5th international conference on Network optimization
A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

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

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steiner Tree, as the underpinning mathematical structure, is a well-known NP-complete problem. In this paper we investigate a variable neighborhood descent (VND) search, a variant of variable neighborhood search, for the delay-constrained least-cost (DCLC) multicast routing problem. The neighborhood structures designed in the VND approaches are based on the idea of path replacement in trees. They are simple, yet effective operators, enabling a flexible search over the solution space of this complex problem with multiple constraints. A large number of simulations demonstrate that our algorithm is highly efficient in solving the DCLC multicast routing problem in terms of the tree cost and execution time. To our knowledge, this is the first study of VND algorithm on the DCLC multicast routing problem. It outperforms other existing algorithms over a range of problem instances.