Heuristics for multi-period capacity expansion in local telecommunications networks

Heuristics for multi-period capacity expansion in local telecommunications networks

0.00 Avg rating0 Votes
Article ID: iaor200971212
Country: United States
Volume: 15
Issue: 4
Start Page Number: 381
End Page Number: 402
Publication Date: Aug 2009
Journal: Journal of Heuristics
Authors: , , ,
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.