Dynamic planning model for urban telephone networks and its applications

Describes 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, one is 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 adequate versions of the K-shortest-paths algorithm and of a dynamic programming algorithm were used. That is, in ARCOS one seeks 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 equipment capacity 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.