OPTIMIZING SWITCHING EVOLUTION IN A MULTI-SERVICE ENVIRONMENT

In this paper the authors address the problem of optimally planning the evolution of switching in a local telephone network. This problem belongs to the family of multilocation capacity expansion problems and consists in determining the choice and time of placement of switching equipments (switches and remote concentrators) at the various nodes of the network over a long-erm planning horizon, while satisfying demands and minimizing costs. This optimization must be carried out in the context of multiple services and equipment types, as well as budget and other global constraints. They present a modeling approach that takes all of this into account without restricting the solutions to be single-transition strategies and yields an integer linear program that remains tractable for real-sized networks. A combined branch-and- bound/column-generation algorithm is proposed to solve it. Finally they show how this model can be integrated into a decision-support system to provide planners with a powerful and flexible planning tool. (A)

  • Corporate Authors:

    CENTRE DE RECHERCHE SUR LES TRANSPORTS. UNIVERSITE DE MONTREAL

    C.P. 6128, SUCCURSALE A
    MONTREAL, QUEBEC  Canada  H3C 3J7
  • Authors:
    • Soriano, P
    • Gendreau, M
    • Soumis, F
  • Publication Date: 1991

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00674436
  • Record Type: Publication
  • Source Agency: Transportation Association of Canada (TAC)
  • Files: ITRD
  • Created Date: Mar 8 1995 12:00AM