A survey of applications of mathematical programming to circuit‐switched network planning problems

Abstract

In the planning of circuit‐switched networks the decisions regarding the capacity of transmission and switching equipments, the location of exchanges and the routing principles are of primary importance. Traditionally planning methods were based on heuristic type algorithms using sometimes simple mathematical programming algorithms for particular sub‐problems. However in the 70's and 80's, new approaches based on mathematical programming algorithms (namely non‐linear programming, integer programming and dynamic programming algorithms) have been put forward for solving some key telecommunication network planning problems. The main objective of the paper is to identify the main characteristics of problems where mathematical programming has been applied (in the context of circuit‐switched network planning) and referring to relevant works in these areas. A system of taxonomic classification of circuit‐switched network planning problems is proposed and applied to an extensive list of relevant publications complemented with a list of correlated papers and other publications. The core of the overview of contributions, presented in the paper, will be limited to models of operational planning of circuit‐switched networks. Finally the authors, based on their own experience in specific problems, will try to put forward some general conclusions of a broad methodological nature.

Kronecker product‐based codebook design and optimisation for correlated 3D channels

“…Unlike randomly generating in aggressive and conservative discrete stochastic approximation , every time, we only change one row index of previously generated rows combinations, which reduces the computational complexity from to O( M M t ) . During each iteration, we compare I m a x ( u m ) and and choose the lower one to be u m + 1 , thus making a choice for the next move towards the global optimiser.…”