© The Institution of Electrical Engineers
In the paper we describe a model (ARCOS) for dynamic planning of small- and medium-size urban telephone networks. The main innovative feature of the method is the fact that, by exploring the spatial decomposition of a simplified initial network, we are led to a network of tractable size in the sense that it is possible to schedule ‘K-best’ network expansions in time, represented on a decision graph obtained according to some heuristic simplifications. For the purpose of defining the network expansions from the decision graph we used adequate versions of the K-shortest-paths algorithm and of a dynamic programming algorithm. That is, in ARCOS we seek to improve a type of algorithm for primary cable network planning as presented by Rapp by introducing a new heuristic method that seeks to optimise the dynamic evolution of the network topology together with the equipments capcity expansions. The actual version of the ARCOS model and its application to particular urban networks is described. The advantages and difficulties of the method are also discussed.
References
-
-
1)
-
Martins, E.Q.V.: `Determinação de caminhos óptimos em redes orientadas', 1984, PhD thesis, Universidade de Coimbra, Portugal.
-
2)
-
Y. Rapp
.
Dynamic programming application on the primary cable network planification.
Ericsson Rev.
-
3)
-
Camerini, L., Fratta, L., Maffioli, E., Gallasig, , Bonatti, M.: `A dynamic planning method for telecommunication networks and its performance evaluation for district trunk networks', Paper no. 5, Proc. 10th Intl. Teletraffic Congress, 1982, Montreal, Session 2.1.
-
4)
-
Vidal, D.M., Abrantes, L.V.: `Sirius-junction network planning: a dynamic methodology', paper 2.3 A-3, Proc. 11th Intl. Teletraffic Congress, 1985, Tokyo.
-
5)
-
G.P. Garrett
.
Expansion planning of radial subtransmission systems.
IEEE Trans.
-
6)
-
(1982)
, Sistema CHOUPAL: Estudo no. 8201 do Centro de Estudos de Telecomunicações.
-
7)
-
Diogo, J., Clímaco, J.N., Nordeste, P., Craveirinah, J.: `Urban network planning — The model ARCOS and its application to the towns of Braga and Figueira da Foz', 8th European Conference on Operational research, 1986, Lisbon, oral communication.
-
8)
-
L.M. Ericsson
.
, Network planning research carried out by Yngve Rapp — a summary.
-
9)
-
M. Piekarski
.
Listing of all possible trees of a linear graph.
IEE Trans.
-
10)
-
P.A. Jensen ,
J.W. Barnes
.
(1980)
, Network flow programming.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-i-2.1989.0040
Related content
content/journals/10.1049/ip-i-2.1989.0040
pub_keyword,iet_inspecKeyword,pub_concept
6
6