{"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.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
