解决广义旅行推销员问题的新型记忆算法

IF 0.6 4区数学 Q2 LOGIC

Logic Journal of the IGPL Pub Date : 2024-03-27 DOI:10.1093/jigpal/jzae019

Ovidiu Cosma, Petrică C Pop, Laura Cosma

{"title":"解决广义旅行推销员问题的新型记忆算法","authors":"Ovidiu Cosma, Petrică C Pop, Laura Cosma","doi":"10.1093/jigpal/jzae019","DOIUrl":null,"url":null,"abstract":"This paper investigates the Generalized Traveling Salesman Problem (GTSP), which is an extension of the well-known Traveling Salesman Problem (TSP), and it searches for an optimal tour in a clustered graph, such that every cluster is visited exactly once. In this paper, we describe a novel Memetic Algorithm (MA) for solving efficiently the GTSP. Our proposed MA has at its core a genetic algorithm (GA), completed by a Chromosome Enhancement Procedure (CEP), which is based on a TSP solver and the Shortest Path (SP) algorithm and for improving the convergence characteristics of the GA, a Local Search (LS) operation is applied for the best chromosomes in each generation. We tested our algorithm on a set of well-known instances from the literature and the achieved results prove that our novel memetic algorithm is highly competitive against the existing solution approaches from the specialized literature.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"72 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel memetic algorithm for solving the generalized traveling salesman problem\",\"authors\":\"Ovidiu Cosma, Petrică C Pop, Laura Cosma\",\"doi\":\"10.1093/jigpal/jzae019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates the Generalized Traveling Salesman Problem (GTSP), which is an extension of the well-known Traveling Salesman Problem (TSP), and it searches for an optimal tour in a clustered graph, such that every cluster is visited exactly once. In this paper, we describe a novel Memetic Algorithm (MA) for solving efficiently the GTSP. Our proposed MA has at its core a genetic algorithm (GA), completed by a Chromosome Enhancement Procedure (CEP), which is based on a TSP solver and the Shortest Path (SP) algorithm and for improving the convergence characteristics of the GA, a Local Search (LS) operation is applied for the best chromosomes in each generation. We tested our algorithm on a set of well-known instances from the literature and the achieved results prove that our novel memetic algorithm is highly competitive against the existing solution approaches from the specialized literature.\",\"PeriodicalId\":51114,\"journal\":{\"name\":\"Logic Journal of the IGPL\",\"volume\":\"72 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logic Journal of the IGPL\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1093/jigpal/jzae019\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logic Journal of the IGPL","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1093/jigpal/jzae019","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了广义旅行推销员问题（GTSP），它是著名的旅行推销员问题（TSP）的扩展，它在一个聚类图中寻找最佳巡回路线，使得每个聚类图都被访问一次。在本文中，我们介绍了一种高效解决 GTSP 的新型记忆算法 (MA)。我们提出的记忆算法以遗传算法（GA）为核心，由基于 TSP 求解器和最短路径（SP）算法的染色体增强程序（CEP）完成，为改善 GA 的收敛特性，对每一代中的最佳染色体采用了局部搜索（LS）操作。我们在文献中的一组著名实例上测试了我们的算法，结果证明我们的新型记忆算法与专业文献中的现有求解方法相比具有很强的竞争力。

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

查看原文本刊更多论文

A novel memetic algorithm for solving the generalized traveling salesman problem

This paper investigates the Generalized Traveling Salesman Problem (GTSP), which is an extension of the well-known Traveling Salesman Problem (TSP), and it searches for an optimal tour in a clustered graph, such that every cluster is visited exactly once. In this paper, we describe a novel Memetic Algorithm (MA) for solving efficiently the GTSP. Our proposed MA has at its core a genetic algorithm (GA), completed by a Chromosome Enhancement Procedure (CEP), which is based on a TSP solver and the Shortest Path (SP) algorithm and for improving the convergence characteristics of the GA, a Local Search (LS) operation is applied for the best chromosomes in each generation. We tested our algorithm on a set of well-known instances from the literature and the achieved results prove that our novel memetic algorithm is highly competitive against the existing solution approaches from the specialized literature.

求助全文

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

来源期刊

Logic Journal of the IGPL 数学-数学

CiteScore

2.60

自引率

10.00%

发文量

审稿时长

6-12 weeks

期刊介绍： Logic Journal of the IGPL publishes papers in all areas of pure and applied logic, including pure logical systems, proof theory, model theory, recursion theory, type theory, nonclassical logics, nonmonotonic logic, numerical and uncertainty reasoning, logic and AI, foundations of logic programming, logic and computation, logic and language, and logic engineering. Logic Journal of the IGPL is published under licence from Professor Dov Gabbay as owner of the journal.