【24h】

Optimization of Cyclic Natural Gas Transmission Systems by Tabu Search: A Computational Experience

机译:禁忌搜索优化循环天然气输送系统:一种计算经验

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

摘要

In this paper we present a computational evaluation of a tabu search algorithm for the fuel cost minimization problem on cyclic natural gas transmission networks. The problem is very hard to solve due to its nonlinearity and nonconvexity in both the set of feasible solutions and the objective function. In our proposed tabu search method, we use a short-term memory strategy that overcomes local optimality. The computational results, based on a variety of instances using real-world data, show the effectiveness of the proposed approach over other approaches providing a scientific contribution to the state of the art in his area.
机译:在本文中,我们提出了一种禁忌搜索算法的计算评估,该算法针对循环天然气传输网络上的燃料成本最小化问题。由于在可行解集和目标函数中都存在非线性和非凸性,因此很难解决该问题。在我们提出的禁忌搜索方法中,我们使用了克服局部最优性的短期记忆策略。基于使用实际数据的各种实例的计算结果表明,所提出的方法相对于其他方法的有效性,从而为该领域的最新技术做出了科学贡献。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号