首页> 外文期刊>International Journal of Innovative Computing Information and Control >PERFORMANCE EVALUATION OF HYBRID PROCEDURE OF SELF-ORGANIZING MAP AND SA FOR TSP
【24h】

PERFORMANCE EVALUATION OF HYBRID PROCEDURE OF SELF-ORGANIZING MAP AND SA FOR TSP

机译:TSP自组织图和SA混合过程的性能评估

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

摘要

As described in this paper; we propose application of a modified self-organizing map (SOM) to the traveling salesman problem (TSP), then experiment using some benchmark problems. The average CPU time using this procedure is O(n23) against the number of cities n. Moreover, we propose a hybrid procedure of the modified SOM and SA. The accuracy of solutions improves the modified SOM by almost two percentages if we put the CPU time as several times the SOM process on the SA process. We show the ability to obtain an approximate solution for TSP of about tens of thousands cities with a usual PC by forecasting from the relation between computational complexity and accuracy of solutions. Moreover, tour structures of TSP are analyzed. Then we search for strategies of algorithm improvement.
机译:如本文所述;我们建议将修正的自组织映射(SOM)应用于旅行商问题(TSP),然后使用一些基准问题进行实验。使用此过程的平均CPU时间为O(n23)相对于城市数n。此外,我们提出了修改后的SOM和SA的混合过程。如果我们将CPU时间设为SA流程中SOM流程的几倍,则解决方案的准确性将修改后的SOM提升了近两个百分点。通过从计算复杂度和解决方案精度之间的关系进行预测,我们展示了使用普通PC可以为数万个城市获得TSP近似解决方案的能力。此外,分析了TSP的游览结构。然后我们寻找算法改进的策略。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号