We consider the problem of designing a local network in a two‐level telecommunication network. Given one or two hub nodes, central offices (COs) and conduits, the problem is to find a set of unidirectional self‐healing rings (USHRs) which covers all COs and satisfies all demands at minimum cost. The solution approach used is the decomposition and column generation. Master problem and subproblem are modeled as integer programming models. After the optimal solution to linear programming relaxation of the master problem is obtained, a branch‐and‐bound algorithm is used to get an integer solution. A set of valid inequalities for a subproblem is given and a branch‐and‐cut algorithm is used to find an optimal solution to the subproblem. Computational results using real data are reported.
KeywordsTravel Salesman Problem Travel Salesman Problem Local Network Column Generation Master Problem
Unable to display preview. Download preview PDF.
- E. Balas, The prize collecting traveling salesman problem, Networks 19 (1989) 621–636.Google Scholar
- E. Balas, The prize collecting traveling salesman problem: II. Polyhedral results, Networks 25 (1995) 199–216.Google Scholar
- C. Barnhart, Johnson, G.L. Nemhauser, M.W.P. Savelsbergh and P.H. Vance, Branch-and-price: Column generation for solving huge integer programs, in: Mathematical Programming: State of the Art, eds. J.R. Birge and K.G. Murty (1994) pp. 186–207.Google Scholar
- S. Cosares, D.L. Deutsch, I. Saniee and O.J. Wasem, SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks, Interfaces 25(1) (1995) 20–40.Google Scholar
- M. Fischetti, J.J.S. González and P. Toth, The symmetric generalized traveling salesman polytope, Networks 26 (1995) 113–123.Google Scholar
- K. Lee, K. Park and S. Park, Ring loading problem with integer demand splitting, Technical Report # 96-003, Dept. of I.E., KAIST (1996).Google Scholar
- G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).Google Scholar
- J.B. Slevinsky, W.D. Grover and M.H. MacGregor, An algorithm for survivable network design employing multiple self-healing rings, in: IEEE GLOBECOM-93 (1993) pp. 1568–1573.Google Scholar
- J. Suurballe and R. Tarjan, A quick method of finding shortest pairs of disjoint paths, Networks 14 (1984) 325–336.Google Scholar
- T.H. Wu, Fiber Network Service Survivability (Artech House, 1992).Google Scholar
- T.H. Wu and R.C. Lau, A class of self-healing ring architectures for SONET network applications, in: IEEE GLOBECOM-90 (1990) pp. 403.2.1–403.2.8.Google Scholar