Results 1  10
of
29
MultiExchange Neighborhood Structures for the Capacitated Minimum Spanning Tree Problem
 MATHEMATICAL PROGRAMMING
, 2000
"... The capacitated minimum spanning tree (CMST) problem is to find a minimum cost spanning tree with an additional cardinality constraint on the sizes of the subtrees incident to a given root node. The CMST problem is an NPcomplete problem, and existing exact algorithms can solve only small size probl ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
The capacitated minimum spanning tree (CMST) problem is to find a minimum cost spanning tree with an additional cardinality constraint on the sizes of the subtrees incident to a given root node. The CMST problem is an NPcomplete problem, and existing exact algorithms can solve only small size problems. Currently, the best available heuristic procedures for the CMST problem are tabu search algorithms due to Amberg et al. and Sharaiha et al. These algorithms use twoexchange neighborhood structures that are based on exchanging a single node or a set of nodes between two subtrees. In this paper, we generalize their neighborhood structures to allow exchanges of nodes among multiple subtrees simultaneously; we refer to such neighborhood structures as multiexchange neighborhood structures. Our first multiexchange neighborhood structure allows exchanges of single nodes among several subtrees. Our second multiexchange neighborhood structure allows exchanges that involve multiple subtrees. The size of each of these neighborhood structures grows exponentially with the problem size without any substantial increase in the computational times needed to find improved neighbors. Our approach, which is based on the cyclic transfer neighborhood structure due to Thompson and Psaraftis and Thompson and Orlin transforms a profitable exchange into a negative cost subsetdisjoint cycle in a graph, called an improvement graph, and identifies these cycles using variants of shortest path labelcorrecting algorithms. Our computational results with GRASP and tabu search algorithms based on these neighborhood structures reveal that (i) for the unit demand case our algorithms obtained the best available solutions for all benchmark instances and improved some; and (ii) for the heterogeneous deman...
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and its Variants in Network Design
, 2004
"... Given an undirected graph G = (V, E) with nonnegative costs on its edges, a root node r V with demand v D wishing to route w(v) units of flow (weight) to r, and a positive number k, the Capacitated Minimum Steiner Tree (CMStT) problem asks for a minimum Steiner tree, rooted at r, spannin ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Given an undirected graph G = (V, E) with nonnegative costs on its edges, a root node r V with demand v D wishing to route w(v) units of flow (weight) to r, and a positive number k, the Capacitated Minimum Steiner Tree (CMStT) problem asks for a minimum Steiner tree, rooted at r, spanning the vertices in D in which the sum of the vertex weights in every subtree hanging o# r is at most k. When D = V , this problem is known as the Capacitated Minimum Spanning Tree (CMST) problem. Both CMStT and CMST problems are NPhard. In this paper, we present approximation algorithms for these problems and several of their variants in network design. Our main results are the following.
Solving General Ring Network Design Problems by MetaHeuristics
"... Ring network design problems have many important applications, especially in the field of telecommunications and vehicle routing. Those problems generally consist of constructing a ring network by selecting a node subset and corresponding direct links. Different requirements and objectives lead to ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Ring network design problems have many important applications, especially in the field of telecommunications and vehicle routing. Those problems generally consist of constructing a ring network by selecting a node subset and corresponding direct links. Different requirements and objectives lead to various specific types of NPhard ring network design problems reported in the literature, each with its own algorithms. We exploit the similarities in problems to produce a more general problem formulation and associated solution methods that apply to a broad range of problems. Computational results are reported for an implementation using a metaheuristics framework with generic components for heuristic search.
Ejection Chain and FilterandFan Methods in Combinatorial Optimization
, 2006
"... The design of effective neighborhood structures is fundamental to the performance of local search and metaheuristic algorithms for combinatorial optimization. Significant efforts have been made in the creation of larger and more powerful neighborhoods that are able to explore the solution space more ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
The design of effective neighborhood structures is fundamental to the performance of local search and metaheuristic algorithms for combinatorial optimization. Significant efforts have been made in the creation of larger and more powerful neighborhoods that are able to explore the solution space more extensively and effectively while keeping computation complexity within acceptable levels. The most important advances in this domain derive from dynamic and adaptive neighborhood constructions originating in ejection chain methods and a special form of a candidate list design that constitutes the core of the filterandfan method. The objective of this paper is to lay out the general framework of the ejection chain and filterandfan methods and present applications to a number of important combinatorial optimization problems. The features of the methods that make them effective in these applications is expected to provide insights into solving challenging problems in other settings.
A hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem
"... The problem of finding a Capacitated Minimum Spanning Tree asks for connecting a set of client nodes to a root node through a minimum cost tree network, subject to capacity constraints on all links. This paper reports on our design, implementation and performance evaluation of a hybrid Ant Colony Op ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
The problem of finding a Capacitated Minimum Spanning Tree asks for connecting a set of client nodes to a root node through a minimum cost tree network, subject to capacity constraints on all links. This paper reports on our design, implementation and performance evaluation of a hybrid Ant Colony Optimization algorithm for finding Capacitated Minimum Spanning Trees. Our Ant Colony Optimization algorithm is based on two important problem characteristics, namely the close relationship of the Capacitated Minimum Spanning Tree Problem with both the Capacitated Vehicle Routing Problem and the Minimum Spanning Tree Problem and hybridizes the Savings based Ant System with the algorithm of Prim, which is used to solve the subproblems of finding minimal spanning trees exactly. To assess the performance of our implementation we perform a computational study on a set of well known benchmark instances. For these instances our results show both the effectiveness and the efficiency of our algorithm when compared to several other stateoftheart techniques. 1
A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem
 Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference, pages 309–316, Las Vegas, NV
"... This article presents an evolutionary algorithm (EA) for the capacitated minimum spanning tree problem occurring in telecommunication applications. The EA encodes a solution by a predecessor vector indicating for each node the preceding node at the path to the given central root node. Initiali ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
This article presents an evolutionary algorithm (EA) for the capacitated minimum spanning tree problem occurring in telecommunication applications. The EA encodes a solution by a predecessor vector indicating for each node the preceding node at the path to the given central root node. Initialization, crossover, and mutation operators were specifically designed to provide strong locality and to enable an e#ective search in the space of feasible solutions only. Furthermore, local heuristics are applied to promote the inclusion of lowcost links. Empirical results on a set of standard test problems indicate that the EA performs better than two other heuristic techniques.
Ring Network Design for Metropolitan Area Networks
, 1998
"... We consider the problem of designing ring networks for metropolitan area networks. Given a number of nodes representing locations that may be connected, the task is to construct a ring network by selecting a node subset and corresponding direct links. Any two nodes on the ring are enabled to communi ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
We consider the problem of designing ring networks for metropolitan area networks. Given a number of nodes representing locations that may be connected, the task is to construct a ring network by selecting a node subset and corresponding direct links. Any two nodes on the ring are enabled to communicate with each other so that the network provider gains a certain revenue. On the other hand, construction costs are incurred for the design of each direct link. The basic objective is to maximize the sum of all revenues minus the construction costs while building a ring network. We discuss certain relationships to other problems. Mathematical models are presented and used to obtain optimal solutions for small problem instances and upper bounds. We focus on the application of modern heuristic search concepts by means of a framework with generic components for heuristic search which enables the efficient adaptation to real world problems.
Robust branchcutandprice for the capacitated minimum spanning tree problem over a large extended formulation
 Universidade Federal Fluminense
, 2008
"... This paper presents a robust branchcutandprice algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to qarbs, a structure that arises from a relaxation of the capacitated prizecollecting arborescence problem in order to make it solvable in pseudopoly ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper presents a robust branchcutandprice algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to qarbs, a structure that arises from a relaxation of the capacitated prizecollecting arborescence problem in order to make it solvable in pseudopolynomial time. Traditional inequalities over the arc formulation, like Capacity Cuts, are also used. Moreover, a novel feature is introduced in such kind of algorithms. Powerful new cuts expressed over a very large set of variables could be added, without increasing the complexity of the pricing subproblem or the size of the LPs that are actually solved. Computational results on benchmark instances from the ORLibrary show very significant improvements over previous algorithms. Several open instances could be solved to optimality. 1 1
Survivable Network Design: The Capacitated Minimum Spanning Network Problem
 In Proc. 7th INFORMS Telecommunications Conf
, 2004
"... We are given an undirected graph G = (V; E) with positive weights on its vertices representing demands, and nonnegative costs on its edges. Also given are a capacity constraint k, and root vertex r 2 V . In this paper, we consider the capacitated minimum spanning network (CMSN) problem, which as ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
We are given an undirected graph G = (V; E) with positive weights on its vertices representing demands, and nonnegative costs on its edges. Also given are a capacity constraint k, and root vertex r 2 V . In this paper, we consider the capacitated minimum spanning network (CMSN) problem, which asks for a minimum cost spanning network such that the the removal of r and its incident edges breaks the network into a number of components (groups), each of which is 2edgeconnected with a total weight of at most k. We show that the CMSN problem is NPhard, and present a 4approximation algorithm for graphs satisfying triangle inequality. We also show how to obtain similar approximation results for a related 2vertexconnected CMSN problem.
Load Balancing In HopByHop Routing With And Without Traffic Splitting
, 2003
"... This dissertation presents an exploration on solving traffic load balancing problems concentrating on the IP layer in hopbyhop networks. The first part of the traffic load balancing research is focused on bandwidthsensitive routing for premium class traffic in Differentiated Service (DiffServ) ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
This dissertation presents an exploration on solving traffic load balancing problems concentrating on the IP layer in hopbyhop networks. The first part of the traffic load balancing research is focused on bandwidthsensitive routing for premium class traffic in Differentiated Service (DiffServ) networks, where bandwidth usage of the premium class traffic is critical not only for the traffic itself, but also for other classes of traffic with lower priorities in the same network, such as the assured or best effort traffic. If the traffic in a network is splittable, then the second part of the load balancing research is intradomain traffic engineering in the network, where the bandwidthsensitive routing solutions in the first part can be used to achieve better traffic load balancing results in this part.