Optimizing a ring-based private line telecommunication network using Tabu Search

Management Science

Volumn 45, Issue 3, 1999, Pages 330-345

  Xu, Jiefeng ^a   Chiu, Steve Y ^b   Glover, Fred ^c  

^a Delta Technology Inc   (United States)

^b VERIZON   (United States)

^c UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COSTS; DATA REDUCTION; HEURISTIC METHODS; RELIABILITY; STATISTICAL METHODS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SERVICES; TRAVELING SALESMAN PROBLEM; VALUE ENGINEERING;

BRANCH-AND-CUT ALGORITHMS; DIGITAL DATA SERVICES; RING-BASED PRIVATE LINE TELECOMMUNICATION NETWORKS; TABU SEARCH METHOD;

INFORMATION MANAGEMENT;

EID: 0032634424     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.45.3.330     Document Type: Article

References (20)

1. Anderson, A., K. F. Jones, J. Ryan. 1993. Path assignment for call routing: An application of tabu search. Ann. Oper. Res. 41 (J. C. Baltzer), 299-312.
2. Glover, F. 1977. Heuristics for integer programming using surrogate constraints. Decision Sci. 8 156-166.
3. _. 1989. Tabu search - Part I. ORSA J. Computing 3 190-206.
4. _. 1996. Tabu search and adaptive memory programming - Advances, applications and challenges. Barr, Helgason, Kennington, eds. Interfaces in Computer Science and Operations Research. Kluwer Academic Publishers, Boston, MA. 1-75.
5. _, M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Boston MA.
6. _, A. Løkketangen. 1996. Probabilistic move selection in tabu search for zero-one mixed integer programming problems. I. H. Osman and J. P. Kelly, eds. Meta-Heuristics: Theory and Applications. Kluwer Academic Publishers, Boston, MA. 467-487.
7. Johnson, D. S., L. A. McGeoch. 1996. The traveling salesman problem: A case study in local optimization. E. H. L. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley and Sons, New York.
8. Laguna, M. 1994. Clustering for the design of SONET rings in interoffice telecommunications. Management Sci. 40(11) 1533-1544.
9. _, F. Glover. 1993. Bandwidth packing: A tabu search approach. Management Sci. 39(4) 492-500.
10. Laporte, G. 1992. The traveling salesman problem: An overview of exact and approximate algorithms. European J. Oper. Res. 59 231-247.
11. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. 1985. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester, UK.
12. Lee, Y., S. Y. Chiu, J. Ryan. 1996a. A branch and cut algorithm for a steiner ring-star problem. Working Paper. U S WEST Advanced Technologies Inc., Boulder, CO.
13. _, _, _. 1996b. A branch and cut algorithm for a steiner tree-star problem. INFORMS J. Computing 8(3) 194-201.
14. Reinelt, G. 1994. The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag, Heidelberg, Germany.
15. Skorin-Kapov, D., J. Skorin-Kapov. 1994. On tabu search for the location of interacting hub facilities. EJOR 73 502-509.
16. Xu, J., S. Y. Chiu, F. Glover. 1996a. Using tabu search to solve the steiner tree-star problem in telecommunications network design. Telecommunication Systems 6 117-125.
17. _, _, _. 1996b. Probabilistic tabu search for telecommunications network design. Combinatorial Optimization: Theory and Practice Vol. 1, (1) 69-94.
18. _, _, _. 1998. Fine-tuning a tabu search algorithm with statistical tests. Internat. Trans. Oper. Res. 5(3) 233-244.
19. _, _, _. 1997. Tabu search for dynamic routing communications network design. Telecommunication Systems 8 55-77.
20. _, J. P. Kelly. 1996. A new network flow-based tabu search heuristic for the vehicle routing problem. Trans. Sci. 30(4) 379-393.