{"title":"基于遗传算法的选择性旅行商问题的新方法","authors":"B. Radi, Bochar Laarabi","doi":"10.1109/CIST.2016.7804993","DOIUrl":null,"url":null,"abstract":"In this paper presents a new approach based a genetic algorithm to solve selective travelling salesman problem, which is concerned with finding a path between a given set of control points, among which a start and an end point are the same, and to maximize the total gain collected subject to a prescribed cost constraint. This approach assured by creation of a population under the criterion ratio between the gain and cost. The results of the application of this approach give us the best of the objective function and the number of iterations for algorithm is reduced.","PeriodicalId":196827,"journal":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new approach based a genetic algorithm for the selective travelling salesman problem\",\"authors\":\"B. Radi, Bochar Laarabi\",\"doi\":\"10.1109/CIST.2016.7804993\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper presents a new approach based a genetic algorithm to solve selective travelling salesman problem, which is concerned with finding a path between a given set of control points, among which a start and an end point are the same, and to maximize the total gain collected subject to a prescribed cost constraint. This approach assured by creation of a population under the criterion ratio between the gain and cost. The results of the application of this approach give us the best of the objective function and the number of iterations for algorithm is reduced.\",\"PeriodicalId\":196827,\"journal\":{\"name\":\"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIST.2016.7804993\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIST.2016.7804993","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new approach based a genetic algorithm for the selective travelling salesman problem
In this paper presents a new approach based a genetic algorithm to solve selective travelling salesman problem, which is concerned with finding a path between a given set of control points, among which a start and an end point are the same, and to maximize the total gain collected subject to a prescribed cost constraint. This approach assured by creation of a population under the criterion ratio between the gain and cost. The results of the application of this approach give us the best of the objective function and the number of iterations for algorithm is reduced.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
