车辆路径问题适合度状态空间分析中步行技术的比较

IF 0.6 Q3 ENGINEERING, MULTIDISCIPLINARY

Acta Polytechnica Pub Date : 2021-12-31 DOI:10.14311/ap.2021.61.0672

A. Agárdi, L. Kovács, T. Bányai

{"title":"车辆路径问题适合度状态空间分析中步行技术的比较","authors":"A. Agárdi, L. Kovács, T. Bányai","doi":"10.14311/ap.2021.61.0672","DOIUrl":null,"url":null,"abstract":"The Vehicle Routing Problem (VRP) is a highly researched discrete optimization task. The first article dealing with this problem was published by Dantzig and Ramster in 1959 under the name Truck Dispatching Problem. Since then, several versions of VRP have been developed. The task is NP difficult, it can be solved only in the foreseeable future, relying on different heuristic algorithms. The geometrical property of the state space influences the efficiency of the optimization method. In this paper, we present an analysis of the following state space methods: adaptive, reverse adaptive and uphill-downhill walk. In our paper, the efficiency of four operators are analysed on a complex Vehicle Routing Problem. These operators are the 2-opt, Partially Matched Crossover, Cycle Crossover and Order Crossover. Based on the test results, the 2-opt and Partially Matched Crossover are superior to the other two methods.","PeriodicalId":45804,"journal":{"name":"Acta Polytechnica","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2021-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comparision of the walk techniques for fitness state space analysis in vehicle routing problem\",\"authors\":\"A. Agárdi, L. Kovács, T. Bányai\",\"doi\":\"10.14311/ap.2021.61.0672\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Vehicle Routing Problem (VRP) is a highly researched discrete optimization task. The first article dealing with this problem was published by Dantzig and Ramster in 1959 under the name Truck Dispatching Problem. Since then, several versions of VRP have been developed. The task is NP difficult, it can be solved only in the foreseeable future, relying on different heuristic algorithms. The geometrical property of the state space influences the efficiency of the optimization method. In this paper, we present an analysis of the following state space methods: adaptive, reverse adaptive and uphill-downhill walk. In our paper, the efficiency of four operators are analysed on a complex Vehicle Routing Problem. These operators are the 2-opt, Partially Matched Crossover, Cycle Crossover and Order Crossover. Based on the test results, the 2-opt and Partially Matched Crossover are superior to the other two methods.\",\"PeriodicalId\":45804,\"journal\":{\"name\":\"Acta Polytechnica\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2021-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Polytechnica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14311/ap.2021.61.0672\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Polytechnica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14311/ap.2021.61.0672","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

车辆路径问题是一个研究较多的离散优化问题。第一篇关于这个问题的文章是由Dantzig和Ramster于1959年以卡车调度问题的名义发表的。从那时起，已经开发了几个版本的VRP。该任务是NP困难的，只能在可预见的未来依靠不同的启发式算法来解决。状态空间的几何性质影响优化方法的效率。在本文中，我们分析了以下状态空间方法：自适应、反向自适应和上坡下坡行走。本文分析了四个算子在一个复杂的车辆路径问题上的效率。这些运算符是2-opt、部分匹配交叉、循环交叉和顺序交叉。基于测试结果，2-opt和部分匹配交叉法优于其他两种方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Comparision of the walk techniques for fitness state space analysis in vehicle routing problem

The Vehicle Routing Problem (VRP) is a highly researched discrete optimization task. The first article dealing with this problem was published by Dantzig and Ramster in 1959 under the name Truck Dispatching Problem. Since then, several versions of VRP have been developed. The task is NP difficult, it can be solved only in the foreseeable future, relying on different heuristic algorithms. The geometrical property of the state space influences the efficiency of the optimization method. In this paper, we present an analysis of the following state space methods: adaptive, reverse adaptive and uphill-downhill walk. In our paper, the efficiency of four operators are analysed on a complex Vehicle Routing Problem. These operators are the 2-opt, Partially Matched Crossover, Cycle Crossover and Order Crossover. Based on the test results, the 2-opt and Partially Matched Crossover are superior to the other two methods.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Acta Polytechnica ENGINEERING, MULTIDISCIPLINARY-

CiteScore

1.90

自引率

12.50%

发文量

审稿时长

24 weeks

期刊介绍： Acta Polytechnica is a scientific journal published by CTU in Prague. The main title, Acta Polytechnica, is accompanied by the subtitle Journal of Advanced Engineering, which defines the scope of the journal more precisely - Acta Polytechnica covers a wide spectrum of engineering topics, physics and mathematics. Our aim is to be a high-quality multi-disciplinary journal publishing the results of basic research and also applied research. We place emphasis on the quality of all published papers. The journal should also serve as a bridge between basic research in natural sciences and applied research in all technical disciplines. The innovative research results published by young researchers or by postdoctoral fellows, and also the high-quality papers by researchers from the international scientific community, reflect the good position of CTU in the World University Rankings. We hope that you will ﬁnd our journal interesting, and that it will serve as a valuable source of scientiﬁc information.