Tran, Phuong NgaPhuong NgaTranCahyanto, Bharata DwiBharata DwiCahyantoTimm-Giel, AndreasAndreasTimm-Giel2020-08-102020-08-102013Mobile Networks and Management : 5th International Conference, MONAMI 2013, Cork, Ireland, September 23-25, 2013, revised selected papers / edited by Dirk Pesch, Andreas Timm-Giel, Ramón Agüero Calvo, Bernd-Ludwig Wenning, Kostas Pentikousis. - Cham : Springer, 2013. - (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST ; 125). - Seite 216-227http://hdl.handle.net/11420/7003© Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2013. Traffic in communication networks is not constant but fluctuates heavily, which makes the network planning task very challenging. Overestimating the traffic volume results in an expensive solution, while underestimating it leads to a poor Quality of Service (QoS) in the network. In this paper, we propose a new approach to address the network planning problem under stochastic traffic demands. We first formulate the problem as a chance-constrained programming problem, in which the capacity constraints need to be satisfied in probabilistic sense. Since we do not assume a normal distribution for the traffic demands, the problem does not have deterministic equivalent and hence cannot be solved by the well-known techniques. A heuristic approach based on genetic algorithm is therefore proposed. The experiment results show that the proposed approach can significantly reduce the network costs compared to the peak-load-based approach, while still maintaining the robustness of the solution. This approach can be applied to different network types with different QoS requirements.enChance constrained programmingGenetic algorithmNetwork planningStochastic traffic demandsIngenieurwissenschaftenConference Paper10.1007/978-3-319-04277-0_17Other