旅行商问题的遗传算法:改进的部分映射交叉算子

2009 International Multimedia, Signal Processing and Communication Technologies Pub Date : 2009-03-14 DOI:10.1109/MSPCT.2009.5164164

Vijendra Singh, Simran Choudhary

{"title":"旅行商问题的遗传算法:改进的部分映射交叉算子","authors":"Vijendra Singh, Simran Choudhary","doi":"10.1109/MSPCT.2009.5164164","DOIUrl":null,"url":null,"abstract":"This paper addresses an attempt to evolve Genetic Algorithm by a particular modified Partially Mapped Crossover method to make it able to solve the Traveling Salesman Problem. Which is type of NP-hard combinatorial optimization problems. The main objective is to look a better GA such that solves TSP with shortest tour. First we solve the TSP by using PMX (Goldberg [1]) and then a modified PMX to evolve a GA.","PeriodicalId":179541,"journal":{"name":"2009 International Multimedia, Signal Processing and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Genetic algorithm for Traveling Salesman Problem: Using modified Partially-Mapped Crossover operator\",\"authors\":\"Vijendra Singh, Simran Choudhary\",\"doi\":\"10.1109/MSPCT.2009.5164164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses an attempt to evolve Genetic Algorithm by a particular modified Partially Mapped Crossover method to make it able to solve the Traveling Salesman Problem. Which is type of NP-hard combinatorial optimization problems. The main objective is to look a better GA such that solves TSP with shortest tour. First we solve the TSP by using PMX (Goldberg [1]) and then a modified PMX to evolve a GA.\",\"PeriodicalId\":179541,\"journal\":{\"name\":\"2009 International Multimedia, Signal Processing and Communication Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Multimedia, Signal Processing and Communication Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MSPCT.2009.5164164\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Multimedia, Signal Processing and Communication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSPCT.2009.5164164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

本文试图通过一种特殊的改进的部分映射交叉方法来改进遗传算法，使其能够解决旅行商问题。这是一类NP-hard组合优化问题。主要目标是寻找一个更好的遗传算法，以解决最短行程的TSP问题。我们首先使用PMX (Goldberg[1])求解TSP，然后使用改进的PMX来进化遗传算法。

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

查看原文本刊更多论文

Genetic algorithm for Traveling Salesman Problem: Using modified Partially-Mapped Crossover operator

This paper addresses an attempt to evolve Genetic Algorithm by a particular modified Partially Mapped Crossover method to make it able to solve the Traveling Salesman Problem. Which is type of NP-hard combinatorial optimization problems. The main objective is to look a better GA such that solves TSP with shortest tour. First we solve the TSP by using PMX (Goldberg [1]) and then a modified PMX to evolve a GA.

求助全文

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

来源期刊

2009 International Multimedia, Signal Processing and Communication Technologies

自引率

0.00%

发文量