Optimal Learning Rate and Neighborhood Radius of Kohonen's Self-Organizing Map for Solving the Travelling Salesman Problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Optimal Learning Rate and Neighborhood Radius of Kohonen's Self-Organizing Map for Solving the Travelling Salesman Problem

Published:2018 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence - ISMSI '18
language:
Short-container-title:

Author:

Mersiovsky Tabea¹,Thekkottil Abhilash¹,Hanne Thomas¹,Dornberger Rolf²

Affiliation:

1. Institute for Information Systems, School of Business, University of Applied Sciences and Arts Northwestern Switzerland, Olten, Switzerland

2. Institute for Information Systems, School of Business, University of Applied Sciences and Arts Northwestern Switzerland, Basel, Switzerland

Publisher

ACM Press

Reference25 articles.

1. K. L. Hoffman, M. Padberg, and G. Rinaldi, "Traveling Salesman Problem," in Encyclopedia of Operations Research and Management Science, Boston, MA: Springer US, 2013, pp. 1573--1578.

2. Y. Saji, M. E. Riffi, and B. Ahiod, "Discrete bat-inspired algorithm for travelling salesman problem," in 2014 Second World Conference on Complex Systems (WCCS), 2014, pp. 28--31.

3. P. Toth and D. Vigo, "Models, relaxations and exact approaches for the capacitated vehicle routing problem," Discret. Appl. Math. 123(1), 487--512, 2002.

4. Y. Zhao, L. Leng, Z. Qian, and W. Wang, "A Discrete Hybrid Invasive Weed Optimization Algorithm for the Capacitated Vehicle Routing Problem," Procedia Comput. Sci., 91, 978--987, 2016.

5. T. Hanne and R. Dornberger, R., "Computational Intelligence in Logistics and Supply Chain Management". Springer International Publishing, 2017.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP