Dynamic Adaptation of Genetic Algorithm for Solving Routing Problems on Large Scale Systems

Q3 Engineering
V. Zakharov, Alexander Mugaiskikh
{"title":"Dynamic Adaptation of Genetic Algorithm for Solving Routing Problems on Large Scale Systems","authors":"V. Zakharov, Alexander Mugaiskikh","doi":"10.25728/ASSA.2020.20.2.821","DOIUrl":null,"url":null,"abstract":"This paper is devoted to the implementation of the dynamic adaptation procedure for the genetic algorithm used for solving large-scale travelling salesman problem. This procedure serves to obtain more profitable solutions by a fixed operating time. In order to evaluate effectiveness of new approach computational experiments were performed on well-known problem instances from TSPLib library. As a result, generated solutions reduce the length of the routing plans in considered problem instances compare to classical genetic heuristics. By that, we show how to use the property of time inconsistency of heuristics to get better solutions. New criteria for estimating the efficiency of heuristics algorithms called experimental level of time consistency is introduced.","PeriodicalId":39095,"journal":{"name":"Advances in Systems Science and Applications","volume":"20 1","pages":"32-43"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Systems Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25728/ASSA.2020.20.2.821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 1

Abstract

This paper is devoted to the implementation of the dynamic adaptation procedure for the genetic algorithm used for solving large-scale travelling salesman problem. This procedure serves to obtain more profitable solutions by a fixed operating time. In order to evaluate effectiveness of new approach computational experiments were performed on well-known problem instances from TSPLib library. As a result, generated solutions reduce the length of the routing plans in considered problem instances compare to classical genetic heuristics. By that, we show how to use the property of time inconsistency of heuristics to get better solutions. New criteria for estimating the efficiency of heuristics algorithms called experimental level of time consistency is introduced.
遗传算法求解大规模系统路由问题的动态适应
本文致力于实现用于求解大规模旅行商问题的遗传算法的动态自适应过程。该程序用于在固定的操作时间内获得更有利可图的解决方案。为了评估新方法的有效性,对TSPLib库中的已知问题实例进行了计算实验。因此,与经典的遗传启发式算法相比,在所考虑的问题实例中,生成的解决方案减少了路由计划的长度。由此,我们展示了如何利用启发式算法的时间不一致性来获得更好的解。引入了一种新的启发式算法效率估计标准,称为时间一致性实验水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Advances in Systems Science and Applications
Advances in Systems Science and Applications Engineering-Engineering (all)
CiteScore
1.20
自引率
0.00%
发文量
0
期刊介绍: Advances in Systems Science and Applications (ASSA) is an international peer-reviewed open-source online academic journal. Its scope covers all major aspects of systems (and processes) analysis, modeling, simulation, and control, ranging from theoretical and methodological developments to a large variety of application areas. Survey articles and innovative results are also welcome. ASSA is aimed at the audience of scientists, engineers and researchers working in the framework of these problems. ASSA should be a platform on which researchers will be able to communicate and discuss both their specialized issues and interdisciplinary problems of systems analysis and its applications in science and industry, including data science, artificial intelligence, material science, manufacturing, transportation, power and energy, ecology, corporate management, public governance, finance, and many others.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信