Some approaches to solving a multihour broadband network capacity design problem with single-path routing |
| |
Authors: | Medhi D Tipper D |
| |
Affiliation: | (1) Computer Science Telecommunications, University of Missouri-Kansas City, 5100 Rockhill Road, Kansas City, MO 64110, USA;(2) Department of Information Science and Telecommunications, University of Pittsburgh, Pittsburgh, PA 15260, USA |
| |
Abstract: | In this paper, we consider solution approaches to a multihour 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 Lagrangian 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 services) 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.
This revised version was published online in June 2006 with corrections to the Cover Date. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|