...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>European Journal of Operational Research >Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation
【24h】

Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation

机译：继电器的网络设计问题：具有基于路径的交叉和一组覆盖公式的遗传算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The network design problem with relays arises in telecommunications and distribution systems where the payload must be reprocessed at intermediate stations called relays on the route from its origin to its destination. In fiber-optic networks, for example, optical signals may be regenerated several times to overcome signal degradation because of attenuation and other factors. Given a network and a set of commodities, the network design problem with relays involves selecting network edges, determining a route for each commodity, and locating relays to minimize the network design cost. This paper presents a new formulation to the problem based on set covering constraints. The new formulation is used to design a genetic algorithm with a specialized crossover/mutation operator which generates a feasible path for each commodity, and the locations of relays on these paths are determined by solving the corresponding set covering problem. Computational experiments show that the proposed approach can outperform other approaches, particularly on large size problems.
机译：中继器的网络设计问题出现在电信和配电系统中，在该系统中，必须在从中继站到其起始点的路径上的中继站中对有效负载进行重新处理。例如，在光纤网络中，光信号可以再生几次，以克服由于衰减和其他因素而引起的信号衰减。给定一个网络和一组商品，带有中继器的网络设计问题涉及选择网络边缘，确定每种商品的路由以及定位中继器以最小化网络设计成本。本文提出了一种基于集合覆盖约束的问题的新表述。该新公式用于设计具有专用交叉/变异算子的遗传算法，该算子为每种商品生成可行路径，并且通过解决相应的集合覆盖问题来确定这些路径上的中继器位置。计算实验表明，所提出的方法可以胜过其他方法，特别是在大型问题上。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号