Heuristics for multi-period capacity expansion in local telecommunications networks

Authors:
Roxane Kouassi;Michel Gendreau;Jean-Yves Potvin;Patrick Soriano
Affiliations:
Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport, Université de Montréal, Montréal, Canada H3C 3J7 and Département d'Info ...;Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport, Université de Montréal, Montréal, Canada H3C 3J7 and Département d'Info ...;Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport, Université de Montréal, Montréal, Canada H3C 3J7 and Département d'Info ...;Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport, Université de Montréal, Montréal, Canada H3C 3J7 and École des Hautes & ...
Venue:
Journal of Heuristics
Year:
2009

Citing 5
Cited 0

Reducing bias and inefficiency in the selection algorithm

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Genetic programming (videotape): the movie

Genetic programming (videotape): the movie
A multiperiod capacity planning model for backbone computer communication networks

Operations Research
Planning for optimal expansion of leased line communication networks

Annals of Operations Research - Special issue on operations research in telecommunications
Adaptive Selection Methods for Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.