首页> 外文期刊>Computers & operations research >A hybrid column generation with GRASP and path relinking for the network load balancing problem
【24h】

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

机译:利用GRASP和路径重新链接生成混合列以解决网络负载平衡问题

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:本文提出了一种混合元启发式算法,它将GRASP与路径重新链接方法和列生成相结合。此方法的关键思想是在由列生成定义的受限搜索空间上运行具有路径重新链接搜索的GRASP,而不是在问题的完整搜索空间上运行搜索。此外,列生成不仅用于计算初始受限搜索空间,还用于在整个算法中对其进行修改。所提出的启发式方法用于解决网络负载平衡问题:给定具有单路径路由和估计流量需求矩阵的功能强大的电信网络,网络负载平衡问题是确定每种流量商品的路由路径,以使网络负载在所有此类解决方案中,优化了平衡,即,最坏的链路负载最小化,第二个最差的链路负载最小化,并以这种方式继续进行,直到所有链路负载都最小化。本文给出的计算结果表明,对于网络负载平衡问题,所提出的启发式方法可有效地在较短的运行时间内获得更好的质量解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号