Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search

Authors:
Jiefeng Xu;Steve Y. Chiu;Fred Glover
Affiliations:
-;-;-
Venue:
Management Science
Year:
1999

Citing 0
Cited 5

Metaheuristics and cooperative approaches for the Bi-objective Ring Star Problem

Computers and Operations Research
Algorithms for the design of network topologies with balanced disjoint rings

Journal of Heuristics
Coordination of repeaters based on Simulated Annealing Algorithm and Monte-Carlo Algorithm

Neurocomputing
High performance NoC synthesis using analytical modeling and simulation with optimal power and minimal IC area

Journal of Systems Architecture: the EUROMICRO Journal
A memetic algorithm for the capacitated m-ring-star problem

Applied Intelligence

Quantified Score

Hi-index	0.02

Visualization

Abstract

One of the private line network design problems in the telecommunications industry is to interconnect a set of customer locations through a ring of end offices so as to minimize the total tariff cost and provide reliability. We develop a Tabu Search method for the problem that incorporates long term memory, probabilistic move selections, hierarchical move evaluation, candidate list strategies and an elite solution recovery strategy. Computational results for test data show that the Tabu Search heuristic finds optimal solutions for all test problems that can be solved exactly by a branch-and-cut algorithm, while running about three orders of magnitude faster than the exact algorithm. In addition, for larger size problems that cannot be solved exactly, the tabu search algorithm outperforms the best local search heuristic currently available. The performance gap favoring Tabu Search increases significantly for more difficult problem instances.