| Autor: |
Araújo, E.O., França, P.M., Soares, S., Tavares, H.M.F. |
| Zdroj: |
IFAC-PapersOnLine; July 1983, Vol. 16 Issue: 12 p689-694, 6p |
| Abstrakt: |
The problem of locating telephone exchanges in urban area is a basic problem in the telecommunication system planning. Usually, the mathematical models applied fail in representing the realistic aspects of such problem and heuristic techniques should be used to solve it. The classical representation of the urban telephone network is done by dividing the urban area in squares which occasionally causes errors in regions of great and small subscribers density. In our paper, the telephone network is represented through an oriented graph which allows us to formulate the location problem as a mixed (real and zero-one variables) mathematical programming problem. With this approach the problem can be solved by an exact optimization technique. The optimization method used is the Benders' decomposition which divides the mixed problem and works with the real-variable and zero-one problems separately. The program provides the optimal locations of the new switching centers and its subscriber capacities, in the same way that it determines the possible expansions of the existent buildings. The serving areas of each exchange is also provided by the program. A procedure is presented which provides the construction chronogram of the exchanges during the planning period. The computer program is applied to a 700000 inhabitants brazilian city and results are discussed. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
