A hybrid column generation with GRASP and path relinking for the network load balancing problem

被引:8
作者
Santos, Dorabella [1 ]
de Sousa, Amaro [2 ]
Alvelos, Filipe [3 ]
机构
[1] Inst Telecomunicacoes, P-3810193 Aveiro, Portugal
[2] Univ Aveiro, Inst Telecomunicacoes, DETI, P-3810193 Aveiro, Portugal
[3] Univ Minho, Ctr Algoritmi, Dep Prod & Sistemas, P-4710057 Braga, Portugal
关键词
GRASP with path relinking; Column generation; Hybrid meta-heuristics; Network load balancing; LINEAR-PROGRAMS;
D O I
10.1016/j.cor.2013.05.006
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, a hybrid meta-heuristic is proposed which combines the GRASP with path relinking method and Column Generation. The key idea of this method is to run a GRASP with path relinking search on a restricted search space, defined by Column Generation, instead of running the search on the complete search space of the problem. Moreover, column generation is used not only to compute the initial restricted search space but also to modify it during the whole algorithm. The proposed heuristic is used to solve the network load balancing problem: given a capacitated telecommunications network with single path routing and an estimated traffic demand matrix, the network load balancing problem is the determination of a routing path for each traffic commodity such that the network load balancing is optimized, i.e., the worst link load is minimized, among all such solutions, the second worst link load is minimized, and continuing in this way until all link loads are minimized. The computational results presented in this paper show that, for the network load balancing problem, the proposed heuristic is effective in obtaining better quality solutions in shorter running times. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:3147 / 3158
页数:12
相关论文
共 21 条
[1]  
Alvelos F, 2010, LECT NOTES COMPUT SC, V6373, P190, DOI 10.1007/978-3-642-16054-7_14
[2]  
[Anonymous], INTERFACES COMPUTER
[3]   DECOMPOSITION PRINCIPLE FOR LINEAR-PROGRAMS [J].
DANTZIG, GB ;
WOLFE, P .
OPERATIONS RESEARCH, 1960, 8 (01) :101-111
[4]  
de Sousa A, 2010, ELECT NOTES DISCRETE, V36, P1249
[5]  
Desaulniers G., 2005, Column Generation
[6]   A PROBABILISTIC HEURISTIC FOR A COMPUTATIONALLY DIFFICULT SET COVERING PROBLEM [J].
FEO, TA ;
RESENDE, MGC .
OPERATIONS RESEARCH LETTERS, 1989, 8 (02) :67-71
[7]   A SUGGESTED COMPUTATION FOR MAXIMAL MULTICOMMODITY NETWORK FLOWS [J].
FORD, LR ;
FULKERSON, DR .
MANAGEMENT SCIENCE, 1958, 5 (01) :97-101
[8]   Optimizing OSPF/IS-IS weights in a changing world [J].
Fortz, B ;
Thorup, M .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2002, 20 (04) :756-767
[9]  
Fortz B., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P519, DOI 10.1109/INFCOM.2000.832225
[10]   Lexicographically optimal balanced networks [J].
Georgiadis, L ;
Georgatsos, P ;
Floros, K ;
Sartzetakis, S .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (06) :818-829