A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion

John Freidenfelds and C. D. McLaughlin
Additional contact information
John Freidenfelds: Bell Laboratories, Whippany, New Jersey
C. D. McLaughlin: Bell Laboratories, Whippany, New Jersey

Operations Research, 1979, vol. 27, issue 3, 567-582

Abstract: We present an adaptation of a branch-and-bound solution approach for the problem of expanding the capacity of a telephone feeder cable network to meet growing demand. We drastically trim the search by generating “heuristic” bounds, based on “analytic” solutions of simpler capacity expansion problems. Although we have thus sacrificed a guarantee of exact optimality, we obtain very good solutions with far less computation than would otherwise be possible. Computational efficiency is important because the algorithm is implemented in a computer program that is used routinely, both in “batch” and “time-share” versions, by telephone company planners and engineers. We believe that this approach of using the flexibility of a branch-and-bound formulation, along with specialized heuristics to limit the search, can provide a practical compromise between a “pure” search for an exact optimum and a “no search” use of a heuristic alone

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.3.567 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:3:p:567-582

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().