DMCA
Some Approaches to Solving a Multi-Hour Broadband Network Capacity Design Problem with Single-Path Routing
Cached
Download Links
| Citations: | 28 - 8 self |
BibTeX
@MISC{Medhi_someapproaches,
author = {D. Medhi and et al.},
title = {Some Approaches to Solving a Multi-Hour Broadband Network Capacity Design Problem with Single-Path Routing},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we consider solution approaches to a multi-hour combined capacity design and routing problem which arises in the design of dynamically reconfigurable broadband communication networks that uses the virtual path concept. We present a comparative evaluation of four approaches, namely: a genetic algorithm; a Lagrangean relaxation based subgradient optimization method; a generalized proximal point algorithm with subgradient optimization; and finally, ahybrid approach where the subgradient based method is combined with a genetic algorithm. Our computational experience on a set of test problems of varying network sizes shows that the hybrid approach often is the desirable choice in obtaining the minimum cost network while the genetic algorithm based approach has the most difficulty in solving large scale problems.
Keyphrases
genetic algorithm hybrid approach routing problem network size virtual path concept solution approach multi-hour combined capacity design comparative evaluation desirable choice generalized proximal point algorithm lagrangean relaxation reconfigurable broadband communication network minimum cost network subgradient optimization subgradient optimization method ahybrid approach computational experience large scale problem test problem
