(Created page with " == Abstract == This paper deals with optimal load balancing in telecommunication networks. For a capacitated telecommunications network with single path routing and an estim...") |
m (Scipediacontent moved page Draft Content 314362220 to Sousa et al 2010a) |
(No difference)
| |
Latest revision as of 16:50, 3 February 2021
Abstract
This paper deals with optimal load balancing in telecommunication networks. For a capacitated telecommunications network with single path routing and an estimated traffic demand matrix, we wish to determine the routing paths aiming at min-max optimization of link loads. To solve this problem, we propose a column (path) generation based heuristic. In the first step, we use column generation to solve a linear programming relaxation of the basic problem (obtaining a lower bound and a set of paths). In the second step, we apply a multi-start local search heuristic with path-relinking to the search space defined by the paths found in the first step. In order to assess the merits of this approach, we also implemented a search heuristic which is equivalent to the second step of the proposed one but with no constraints on the set of paths that can be used. Through a set of computational results, we show that the proposed heuristic is efficient in obtaining near optimal routing solutions within short running times. Moreover, the comparison of the two heuristics show that constraining the search space to the columns given by column generation gives better results since this solution space contains good quality solutions and, due to its size, enables to find them in short running times.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2010
Volume 2010, 2010
DOI: 10.1109/netwks.2010.5624911
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?