Advertisement

Column Generation Method for Network Design

  • Nelson Maculan
  • Marcos M. Passini
  • José André M. Brito
  • Abdel Lisser
Part of the Applied Optimization book series (APOP, volume 63)

Abstract

This work deals with the Two-architecture Network Problem, which consists in satisfying growing traffic demand by superimposing rings on an existing meshed network. The goal of this work is to solve the proposed mathematical model via column generation techniques. Firstly a complete model is proposed, then it is simplified to become more manageable. A branch-and-price approach is presented with all its problem-dependent issues. The numerical experience reported consists of two cases, one of 7 nodes and 11 edges, the other with 10 nodes and 36 edges, both drawn from real European telecommunications networks.

Keywords

Network Design Mesh Network Column Generation Active Column Column Generation Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sutter, A. and F. Vanderbeck, L. W.: 1998, `Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms’. Operations Research 46 (5), 719–728.CrossRefGoogle Scholar
  2. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance: 1998, `Branch-and-price: Column Generation for Solving Huge Integer Programs’. Operations Research 46, 316–329.CrossRefGoogle Scholar
  3. Brito, J. A. M.: 1999, `Um Modelo de Otimizaçâo para Dimensionamento de uma Rede de Telecomunicaçóes’. Tese de mestrado, COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil.Google Scholar
  4. Campello, R. E. and N. Maculan: 1994, Algoritmos e Heurísticas: Desenvolvimento e Avaliaçâo de Performance. Niterói, Brasil: EDUFF.Google Scholar
  5. Chvâtal, V.: 1983, Linear programming. New York/San Francisco: W. H. Freeman and Company.Google Scholar
  6. Dantzig, G. and P. Wolfe: 1960, `Decomposition principle for linear programming’. Operations Research 8, 101–111.CrossRefGoogle Scholar
  7. Dantzig, G. B.: 1963, Linear programming and extensions. New Jersey, USA: Princeton University Press.Google Scholar
  8. Gilmore, P. and R. Gomory: 1961, `A Linear Programming Approach to the Cutting Stock Problem’. Operations Research 9, 849–859.CrossRefGoogle Scholar
  9. Gilmore, P. and R. Gomory: 1963, `A linear programming approach to the cutting stock problem–part II’. Operations Research 11, 863–888.CrossRefGoogle Scholar
  10. Glover, F., J. P. Kelly, and M. Laguna: 1995, `Genetic Algorithms and Tabu Search: Hybrids for Optimization’. Computers e4 Operations Research 22, 111–134.CrossRefGoogle Scholar
  11. Hochbaum, D. S. (ed.): 1997, Approximation algorithms for NP-hard problems. PWS Publishing Company.Google Scholar
  12. Lasdon, L. S.: 1970, Optimization Theory for Large Systems. New York, USA: Macmillan.Google Scholar
  13. Lisser, A., N. Maculan, and M. Passini: 1996a, `A Mathematical Model for Solving Design Problems of Telecommunication Networks’. In: INFORMS. Atlanta, USA.Google Scholar
  14. Lisser, A., N. Maculan, and M. Passini: 1996b, `Modelling and Solving Design Problems of Telecommunication Network Using Two Different Architectures’. In: Conférence Internationale en Recherche Opérationnelle. Marrakech, Maroc.Google Scholar
  15. Lisser, A., R. Sarkassian, and J.-P. Vial: 1995, `Survivability in Transmission Telecommunication Networks’. Technical report, NT/PAA/ATR/ORI, CNET, France Télécorn. To appear in Investigación Operativa.Google Scholar
  16. Maculan, N., M. Fampa, and P. Michelon: 1999, Programaçâo Linear e Inteira’. Notes - COPPE/Universidade Federal do Rio de Janeiro.Google Scholar
  17. Maculan, N., M. Passini, and I. Loiseau: 1998a, `Column-Generation in Integer Linear Programming’. Technical report, COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil.Google Scholar
  18. Maculan, N., M. Passini, and A. Silvério: 1998b, `Caracterizaçâo de um Emaranhado de Anéis em uma Rede de Telecomunicaçóes’. Technical report, COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil.Google Scholar
  19. Minoux, M.: 1987, `Network Synthesis and Dynamic Network Optimization’. Annals of Discrete Mathematics 31, 283–324.Google Scholar
  20. Passini, M. M.: 1996, `Um Modelo de Otimizaçâo Combinatória para o Dimensionamento de uma Rede Urbana de Telecomunicaçóes’. Master’s thesis, COPPE, Universidade Federal do Rio de Janeiro.Google Scholar
  21. Savelsbergh, M.: 1997, `A Branch-and-price Algorithm for the Generalized Assignment Problem’. Operations Research 46, 831–841.Google Scholar
  22. Szwarcfiter, J. and P. Lauer: 1975, `A Search Strategy for the Elementary Cycles of a Directed Graph’. BIT 16, 192–204.Google Scholar
  23. Vachani, R., A. Shulman, and P. Kubat: 1996, `Multicommodity Flows in Ring Networks’. INFORMS Journal on Computing 8, 235–242.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Nelson Maculan
  • Marcos M. Passini
  • José André M. Brito
  • Abdel Lisser

There are no affiliations available

Personalised recommendations