Proceedings ArticleDOI
A New Heuristic for the Minimum Routing Cost Spanning Tree Problem
Alok Singh
- pp 9-13
TLDR
A perturbation based local search for the minimum routing cost spanning tree problem is proposed and compared against three methods reported in the literature - two genetic algorithms and a stochastic hill climber.Abstract:
Given a connected, weighted, and undirected graph, the minimum routing cost spanning tree problem seeks on this graph a spanning tree of minimum routing cost, where routing cost is defined as the sum of the costs of all the paths connecting two distinct vertices in a spanning tree. In this paper we have proposed a perturbation based local search for this problem. We have compared our approach against three methods reported in the literature - two genetic algorithms and a stochastic hill climber.Computational results show the effectiveness of our approach.read more
Citations
More filters
Journal ArticleDOI
An artificial bee colony algorithm for the minimum routing cost spanning tree problem
Alok Singh,Shyam Sundar +1 more
TL;DR: An artificial bee colony (ABC) algorithm-based approach is proposed for the minimum routing cost spanning tree problem and is compared against four best methods reported in the literature—two genetic algorithms, a stochastic hill climber and a perturbation-based local search.
Journal ArticleDOI
Adaptive routing and spectrum allocation in elastic optical networks
TL;DR: This paper proposes an adaptive RSA algorithm for EONs that relies on the history of carried calls to learn the near-optimal searching sequence of the optical spectrum and presents simulation results to show the efficiency of the algorithm.
Journal ArticleDOI
Relative cost routing and spectrum allocation in elastic optical networks
TL;DR: An adaptive RSA algorithm based on the relative cost concept under which the transient effect when a call is admitted on a given route/spectrum set at a given network state is estimated is proposed.
Journal ArticleDOI
The Minimum Routing Cost Tree Problem: State of the art and a core-node based heuristic algorithm
TL;DR: The state of the art of the problem is provided and a new heuristic based on the identification of a core of the network around which the solution can be built is proposed, proving the competitiveness of the proposed one both in terms of the quality of the solution and computation time.
Proceedings ArticleDOI
Analyzing the relative cost concept in elastic optical networks
TL;DR: The relative cost concept can be used to implement an adaptive routing and spectrum allocation algorithm and the simulation results have demonstrated the feasibility of the relative cost proposition.
References
More filters
Journal ArticleDOI
Shortest connection networks and some generalizations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
Book
Data Structures and Algorithms
TL;DR: The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.
Book
Data structures and algorithms
TL;DR: Object-oriented purists may view this book as one on object-based programming, using object-oriented analysis and design with implementation in Ada 95, and the approach transcends the specifics in any particular programming language.
Journal ArticleDOI
The complexity of the network design problem
TL;DR: NP-completeness is established for the network design problem, even for the simple case where all edge weights are equal and the budget restricts the choice to spanning trees.
Book
Spanning Trees and Optimization Problems
Bang Ye Wu,Kun-Mao Chao +1 more
TL;DR: This chapter discusses Spanning Trees, a system for maximizing the efficiency of the Spanning Tree Algorithm by minimizing the number of components.
Related Papers (5)
An artificial bee colony algorithm for the minimum routing cost spanning tree problem
Alok Singh,Shyam Sundar +1 more