Lexicographically optimal balanced networks
IEEE/ACM Transactions on Networking (TON)
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Selected Topics in Column Generation
Operations Research
SearchCol: metaheuristic search by column generation
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Lexicographical minimization of routing hops in telecommunication networks
INOC'11 Proceedings of the 5th international conference on Network optimization
IEEE Communications Surveys & Tutorials
A probabilistic heuristic for a computationally difficult set covering problem
Operations Research Letters
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
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.