Journal ArticleDOI
A tabu search for the survivable fiber optic communication network design
Seok J. Koh,Chae Y. Lee +1 more
TLDR
In this article, a tabu search procedure is developed to solve fiber optic communication network design problems with survivability constraints, and two systematic improving heuristics: delete-add and delete-link procedures are presented.About:
This article is published in Computers & Industrial Engineering.The article was published on 1995-10-01. It has received 44 citations till now. The article focuses on the topics: Tabu search & Guided Local Search.read more
Citations
More filters
Journal ArticleDOI
Metaheuristics: A bibliography
Ibrahim H. Osman,Gilbert Laporte +1 more
TL;DR: This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics that have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas.
Journal ArticleDOI
Local search genetic algorithm for optimal design of reliable networks
TL;DR: This paper presents a genetic algorithm with specialized encoding, initialization, and local search operators to optimize the design of communication network topologies and can be used on other highly constrained combinatorial applications where numerous fitness calculations are prohibitive.
Journal ArticleDOI
All-terminal network reliability optimization via probabilistic solution discovery
TL;DR: The results obtained show that the quality of the solutions generated by the proposed algorithm is significantly higher with respect to other approaches and that these solutions are obtained from restricted solution search space.
Journal ArticleDOI
Economic design of reliable networks
Darren L. Deeter,Alice E. Smith +1 more
TL;DR: In this article, a genetic algorithm is used to identify the best topology of network arcs to collectively meet cost and network reliability considerations, which is shown to be effective, computationally efficient and flexible on a suite of diverse test problems.
Proceedings ArticleDOI
Heuristic optimization of network design considering all-terminal reliability
D.L. Deeter,Alice E. Smith +1 more
TL;DR: The optimization formulation in this paper relaxes the previous restrictions that appear in the literature, and the method solves general network design problems to optimality, or near-optimality, with respect to reliability.
References
More filters
Journal ArticleDOI
Tabu Search—Part II
TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Journal ArticleDOI
Depth-First Search and Linear Graph Algorithms
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
Journal ArticleDOI
Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints
TL;DR: This problem of designing a minimum cost communication network subject to certain two-connected survivability constraints is considered, and local improvement heuristics for reducing the cost of existing network designs while preserving a feasible network are introduced.
Journal ArticleDOI
Minimum-weight two-connected spanning networks
TL;DR: This work considers the problem of constructing a minimum-weight, two-connected network spanning all the points in a set V and assumes a symmetric, nonnegative distance functiond(·) defined onV × V which satisfies the triangle inequality, and gets a structural characterization of optimal solutions.