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

References

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