Ring Network Design by Lagrangean Based Column Generation
We discuss the problem of designing a telecommunication network with the survivability requirement that the network should be composed of connected rings of links. The network design problem is then to choose links from a given network, and compose them into a number of rings. Furthermore, the rings should be connected at certain transit nodes. The traffic between rings may pass through other rings. Each ring is associated with a certain fixed cost depending on the length of the ring. We describe the problem, modeled as a linear integer programming problem, and a heuristic solution method, based on column generation and Lagrangean relaxation.
Unable to display preview. Download preview PDF.
- M. DellAmico, F. Maffioli and P. Värbrand, On prize-collecting tours and the asymmetric traveling salesman problem, International Transactions in Operational Research 2 (1995) 297–308.Google Scholar
- M. Fischetti and P. Toth, An additive approach for the optimal solution of the prize-collecting travelling salesman problem, Vehicle Routing: Methods and Studies (1988) 319–343.Google Scholar
- M. Gendreau, M. Labbé and G. Laporte, Efficient heuristics for the design of ring networks, Technical Report, Institut de Statistique, Université Libre De Bruxelles (1994).Google Scholar
- D. Gensch, An industrial application of the traveling salesmans subtour problem, AIIE Transactions 10(4) (1978) 362–370.Google Scholar
- M. Henningsson, K. Holmberg, M. Rönnqvist and P. Värbrand, A ring network design problem, Working paper, LiTH-MAT-OPT-WP-98-03, Department of Mathematics, Linköping Institute of Technology, Sweden (1998).Google Scholar
- R.V. Kulkarni and P.R. Bhave, Integer programming formulations of vehicle routing problems, European Journal of Operational Research 20 (1985) 58–67.Google Scholar
- M. Laguna, Clustering for the design of SONET rings in interoffice telecommunications, Management Science 40 (1994) 1533–1541.Google Scholar
- V. Sridhar, J.S. Park and B. Gavish, Optimal interconnection of token ring networks using source routing bridges, Research Report, Ohio University, USA (1994).Google Scholar
- O.J. Wasem, An algorithm for designing rings for survivable fiber networks, IEEE Transactions on Reliability 40 (1991) 428–432.Google Scholar
- J. Xu, S.Y. Chiu and F. Glover, Optimizing a ring-based private line telecommunication network using tabu search, Working paper (1998).Google Scholar