首页> 外文会议>World multiconference on systemics, cybernetics and informatics;SCI'98;International conference on information systems analysis and synthesis;ISAS'98 >A Heuristic Algorithm Based on Diffusion-Limited Aggregation for Solving the Euclidean Travelling Salesman Problem
【24h】

A Heuristic Algorithm Based on Diffusion-Limited Aggregation for Solving the Euclidean Travelling Salesman Problem

机译:基于扩散限制聚合的启发式算法求解欧氏旅行商问题

获取原文

摘要

In this paper we present a new practical use for the DLA (a model used mainly in physics, physical chemistry, and biology to simulate fractal growth phenomena). We employ it to develop a heuristic algorithm for the ETSP that experimentally outperforms, considerign the quality of the solutions produced, another heuristic method based on the real space renormalisation theory, when applied to a standard set of instances of the problem.
机译:在本文中,我们为DLA(一种主要用于物理,物理化学和生物学的模型,用于模拟分形生长现象)提出了一种新的实际用途。我们使用它来开发用于ETSP的启发式算法,该算法在实验上胜过其他方面,考虑生成的解决方案的质量,这是基于实空间重归一化理论的另一种启发式方法,适用于问题的标准实例集。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号