Heuristics for multi-period capacity expansion in local telecommunications networks

DOI10.1007/S10732-007-9067-6zbMath1180.90044OpenAlexW1985976271MaRDI QIDQ835760

Patrick Soriano, Jean-Yves Potvin, Roxane Kouassi, Michel Gendreau

Publication date: 31 August 2009

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-007-9067-6

zbMATH Keywords

local searchgenetic algorithmtelecommunicationscapacity expansionmulti-periodlocal access network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A node rooted flow-based model for the local access network expansion problem ⋮ A quantitative approach for the long-term assessment of railway rapid transit network construction or expansion projects

Cites Work

• Unnamed Item
• Models for planning capacity expansion in local access telecommunication networks
• Dynamic programming based heuristics for the topological design of local access networks
• Planning for optimal expansion of leased line communication networks
• A dynamic programming algorithm for the local access telecommunication network expansion problem
• Model and heuristic for a generalized access network design problem
• Multi-period capacity expansion for a local access telecommunications network
• A Multiperiod Capacity Planning Model for Backbone Computer Communication Networks
• Optimal Network Capacity Planning: A Shortest-Path Scheme
• On building minimum cost communication networks over time
• Optimal expansion of an existing network
• Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning

This page was built for publication: Heuristics for multi-period capacity expansion in local telecommunications networks