Abstract
A tabu search procedure is developed to solve fiber optic communication network design problems with survivability constraints. Two systematic improving heuristics: delete-add and delete-link procedures are presented. The conditions for the candidate links to be added and deleted in the two procedures are examined by considering the feasible structures of the survivable network. A local improvement procedure is considered by combining the two heuristics for the downhill move in the search procedure. Computational results show that the proposed tabu search outperforms the best known heuristic procedure in the literature.
| Original language | English |
|---|---|
| Pages (from-to) | 689-700 |
| Number of pages | 12 |
| Journal | Computers and Industrial Engineering |
| Volume | 28 |
| Issue number | 4 |
| DOIs | |
| State | Published - Oct 1995 |