首页> 外文期刊>Expert Systems with Application >Comments on 'Albayrak, M., & Allahverdy N. (2011). Development a new mutation operator to solve the Traveling Salesman Problem by aid of genetic algorithms. Expert Systems with Applications, 38(3), 1313-1320': A proposal of good practice
【24h】

Comments on 'Albayrak, M., & Allahverdy N. (2011). Development a new mutation operator to solve the Traveling Salesman Problem by aid of genetic algorithms. Expert Systems with Applications, 38(3), 1313-1320': A proposal of good practice

机译:对'Albayrak,M.&Allahverdy N.(2011)的评论。开发新的变异算子,以借助遗传算法解决旅行商问题。专家系统及其应用,38(3),1313-1320':良好实践的建议

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

摘要

This short note presents a discussion arisen after reading "Development a new mutation operator to solve the Traveling Salesman Problem by aid of genetic algorithms", by Murat Albayrak and Novruz Allahverdi, (2011). Expert System with Applications (38) (pp. 1313-1320). The discussed paper presents a new greedy mutation operator to solve the well-known Traveling Salesman Problem. To prove the quality of their new operator, the authors compare different versions of a classical genetic algorithm, each of one with a different mutation operator. The experimentation shown by the authors can generate some controversy. In this short note, we explain the origin of this controversy and we bring a solution to prevent it in future publications.
机译:该简短说明提出了在阅读了Murat Albayrak和Novruz Allahverdi(2011)撰写的“开发新的变异算子以借助遗传算法来解决旅行商的问题”之后的讨论。具有应用程序的专家系统(38)(pp.1313-1320)。讨论过的论文提出了一种新的贪婪变异算子来解决著名的旅行商问题。为了证明其新算子的质量,作者比较了经典遗传算法的不同版本,每个版本都有一个不同的变异算子。作者展示的实验可能会引起一些争议。在本简短说明中,我们解释了此争议的由来,并在以后的出版物中提出了防止此争议的解决方案。

著录项

  • 来源
    《Expert Systems with Application》 |2014年第1期|1530-1531|共2页
  • 作者单位

    Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain;

    Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain;

    Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain;

    Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain;

    Deusto Institute of Technology (DeustoTech), University of Deusto, Av. Universidades 24, Bilbao 48007, Spain;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Traveling Salesman Problem; Good practice; Genetic algorithms; Combinatorial optimization; Routing problems;

    机译:旅行商问题;良好做法;遗传算法;组合优化;路由问题;

相似文献

  • 外文文献
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号