DMCA
Some Approaches to Solving a Multi-Hour Broadband Network Capacity Design Problem with Single-Path Routing (1999)
Cached
Download Links
| Citations: | 28 - 8 self |
BibTeX
@MISC{Medhi99someapproaches,
author = {D. Medhi and D. Tipper},
title = {Some Approaches to Solving a Multi-Hour Broadband Network Capacity Design Problem with Single-Path Routing},
year = {1999}
}
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, a hybrid 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. Keywords: Broadband network design, multi-hour network routing and capacity design, combinatorial optimization, genetic algorithm, duality and subgradient optimizati...
Keyphrases
genetic algorithm hybrid approach network size virtual path concept solution approach broadband network design comparative evaluation generalized proximal point algorithm minimum cost network test problem multi-hour combined capacity design subgradient optimization method capacity design computational experience combinatorial optimization large scale problem multi-hour network routing reconfigurable broadband communication network routing problem desirable choice subgradient optimization lagrangean relaxation subgradient optimizati
