Optimizing network load balancing: an hybridization approach of metaheuristics with column generation
(2013) In Telecommunication Systems 52(2). p.959-968- Abstract
- Given a capacitated telecommunications network with single path routing and an estimated traffic demand matrix, we aim to determine the routing path of each traffic commodity such that the whole set of paths provide an optimal network load balancing. In a recent paper, we have proposed a column generation based heuristic where, in the first step, we use column generation to solve a linear programming relaxation of the original problem (obtaining, in this way, a lower bound and a set of paths for each commodity) and, in the second step, we apply a multi-start local search with path relinking heuristic on the solution space defined by the paths of the first step. Here, we propose a hybridization approach of the metaheuristic with column... (More)
- Given a capacitated telecommunications network with single path routing and an estimated traffic demand matrix, we aim to determine the routing path of each traffic commodity such that the whole set of paths provide an optimal network load balancing. In a recent paper, we have proposed a column generation based heuristic where, in the first step, we use column generation to solve a linear programming relaxation of the original problem (obtaining, in this way, a lower bound and a set of paths for each commodity) and, in the second step, we apply a multi-start local search with path relinking heuristic on the solution space defined by the paths of the first step. Here, we propose a hybridization approach of the metaheuristic with column generation that can be seen as an enhanced version of the previous approach: we run column generation not only at the beginning (to define the initial search space) but also during the search. These additional column generation steps consist in solving a perturbed problem defined by the incumbent solution. In the previous paper, we have shown that the first approach is efficient in obtaining near optimal routing solutions within short running times. With the enhanced version, we show through computational results that the additional paths, introduced by the additional column generation steps, either improve the efficiency of the algorithm or show similar efficiency in the cases where the original algorithm is already very efficient. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/2437973
- author
- Santos, Dorabella ; de Sousa, Amaro ; Alvelos, Filipe and Pioro, Michal LU
- organization
- publishing date
- 2013
- type
- Contribution to journal
- publication status
- published
- subject
- in
- Telecommunication Systems
- volume
- 52
- issue
- 2
- pages
- 959 - 968
- publisher
- Springer
- external identifiers
-
- wos:000320781900051
- scopus:84879606755
- ISSN
- 1018-4864
- DOI
- 10.1007/s11235-011-9604-3
- language
- English
- LU publication?
- yes
- id
- 1949beee-9d6f-47c9-8601-d497133fba98 (old id 2437973)
- date added to LUP
- 2016-04-01 10:57:07
- date last changed
- 2022-02-25 07:14:33
@article{1949beee-9d6f-47c9-8601-d497133fba98,
abstract = {{Given a capacitated telecommunications network with single path routing and an estimated traffic demand matrix, we aim to determine the routing path of each traffic commodity such that the whole set of paths provide an optimal network load balancing. In a recent paper, we have proposed a column generation based heuristic where, in the first step, we use column generation to solve a linear programming relaxation of the original problem (obtaining, in this way, a lower bound and a set of paths for each commodity) and, in the second step, we apply a multi-start local search with path relinking heuristic on the solution space defined by the paths of the first step. Here, we propose a hybridization approach of the metaheuristic with column generation that can be seen as an enhanced version of the previous approach: we run column generation not only at the beginning (to define the initial search space) but also during the search. These additional column generation steps consist in solving a perturbed problem defined by the incumbent solution. In the previous paper, we have shown that the first approach is efficient in obtaining near optimal routing solutions within short running times. With the enhanced version, we show through computational results that the additional paths, introduced by the additional column generation steps, either improve the efficiency of the algorithm or show similar efficiency in the cases where the original algorithm is already very efficient.}},
author = {{Santos, Dorabella and de Sousa, Amaro and Alvelos, Filipe and Pioro, Michal}},
issn = {{1018-4864}},
language = {{eng}},
number = {{2}},
pages = {{959--968}},
publisher = {{Springer}},
series = {{Telecommunication Systems}},
title = {{Optimizing network load balancing: an hybridization approach of metaheuristics with column generation}},
url = {{http://dx.doi.org/10.1007/s11235-011-9604-3}},
doi = {{10.1007/s11235-011-9604-3}},
volume = {{52}},
year = {{2013}},
}