IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v40y1992i1p14-25.html
   My bibliography  Save this article

Design and Implementation of an Interactive Optimization System for Telephone Network Planning

Author

Listed:
  • Carolyn Jack

    (GTE Laboratories, Incorporated, Waltham, Massachusetts)

  • Sheng-Roan Kai

    (GTE Laboratories, Incorporated, Waltham, Massachusetts)

  • Alexander Shulman

    (GTE Laboratories, Incorporated, Waltham, Massachusetts)

Abstract

We describe an interactive optimization system for multiperiod exhaust relief planning in the local loop of a public telephone network. In exhaust relief planning in the local loop one seeks the minimum cost capacity expansion plan that meets projected demand over a given planning horizon. The problem can be modeled as an integer programming problem. However, due to cost structures and varying transmission technologies, the single-period exhaust relief planning problem is NP-complete. The size of the problem precludes the use of general purpose integer programming. Based on the mathematical structure and complexity of the problem, we decompose the optimization problem into a single-period dynamic programming problem, and a multiperiod greedy heuristic. A software system surrounds the optimization algorithm and provides interactive planning capabilities, before and after creation of the optimized plan. Important aspects of the system are the model assumptions made to keep the problem tractable, and their effect on the standardization of input data and methodology. The system is in use by several hundred outside plant planners in a major U.S. telephone company. An overview of major elements of the package is given as well as a summary of important implementation issues that arose during the first three years of the on-going project.

Suggested Citation

  • Carolyn Jack & Sheng-Roan Kai & Alexander Shulman, 1992. "Design and Implementation of an Interactive Optimization System for Telephone Network Planning," Operations Research, INFORMS, vol. 40(1), pages 14-25, February.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:1:p:14-25
    DOI: 10.1287/opre.40.1.14
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.1.14
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.1.14?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Linos F. Frantzeskakis & Hanan Luss, 1999. "The network redesign problem for access telecommunications networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 487-506, August.
    2. Garcia, Bruno-Laurent & Mahey, Philippe & LeBlanc, Larry J., 1998. "Iterative improvement methods for a multiperiod network design problem," European Journal of Operational Research, Elsevier, vol. 110(1), pages 150-165, October.
    3. Corte-Real, Margarida & Gouveia, Luís, 2010. "A node rooted flow-based model for the local access network expansion problem," European Journal of Operational Research, Elsevier, vol. 204(1), pages 20-34, July.
    4. Flippo, Olaf E. & Kolen, Antoon W. J. & Koster, Arie M. C. A. & van de Leensel, Robert L. M. J., 2000. "A dynamic programming algorithm for the local access telecommunication network expansion problem," European Journal of Operational Research, Elsevier, vol. 127(1), pages 189-202, November.
    5. van de Leensel, R.L.J.M. & Flippo, O.E. & Koster, Arie M.C.A. & Kolen, A.W.J., 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:40:y:1992:i:1:p:14-25. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.