首页 | 本学科首页   官方微博 | 高级检索  
     


Heuristics for multi-period capacity expansion in local telecommunications networks
Authors:Roxane Kouassi  Michel Gendreau  Jean-Yves Potvin  Patrick Soriano
Affiliation:1. Centre Interuniversitaire de Recherche sur les Réseaux d’Entreprise, la Logistique et le Transport, Université de Montréal, C.P. 6128, Succursale Centre-ville, Montréal, PQ, Canada, H3C 3J7
2. Département d’Informatique et de Recherche Opérationnelle, Université de Montréal, C.P. 6128, Succursale Centre-ville, Montréal, PQ, Canada, H3C 3J7
3. école des Hautes études Commerciales, 3000, Chemin de la C?te-Sainte-Catherine, Montréal, PQ, Canada, H3T 2A7
Abstract:In this paper, different heuristics are devised to solve a multi-period capacity expansion problem for a local access telecommunications network with a tree topology. This expansion is done by installing concentrators at the nodes and cables on the links of the network. The goal is to find a least cost capacity expansion strategy over a number of periods to satisfy the demand. A local search heuristic is first proposed to improve previously reported results on problem instances based on different cost and demand structures. This heuristic is then integrated into a genetic algorithm to obtain further improvements.
Keywords:Telecommunications  Local access network  Capacity expansion  Multi-period  Local search  Genetic algorithm
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号