Minimum Cost Layout (Expansion) Planning for Telephone Cable Networks of a Single Exchange Area

전화케이블네트워크의 최적 배치(증설) 계획

This paper deals with the problem of determining the capacity expansion timing and sizes of conduits and feeder cables for a given cable network configuration of a single exchange ares, which minimizes the present worth of total costs. The planning horizon is infinite and the demand of line pairs at each cabinet is assumed to be determininstically growing. As a solution method, the heuristic branch-and-bound algorithm of Freidenfelds and Mclaughlin is elaborated by adding details and some minor modifications, which generates a good near-optimal solution with far less computation than would otherwise be possible. We also develop a computer program, which is shown to be effective and efficient through the test run of an illustrative example.