A new approach based a genetic algorithm for the selective travelling salesman problem

B. Radi, Bochar Laarabi
{"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}
引用次数: 3

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于遗传算法的选择性旅行商问题的新方法
本文提出了一种基于遗传算法的求解选择性旅行商问题的新方法,该方法涉及在给定的控制点集之间寻找一条路径,其中起点和终点相同,并在规定的成本约束下使所收集的总收益最大化。这种方法通过在收益和成本之间的标准比率下创造人口来保证。该方法的应用结果使我们得到了最优的目标函数,并减少了算法的迭代次数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Semantically enhanced term frequency based on word embeddings for Arabic information retrieval Automatic generation of TestNG tests cases from UML sequence diagrams in Scrum process Coordination by sharing demand forecasts in a supply chain using game theoretic approach Robust approach for textured image clustering High speed efficient FPGA implementation of pipelined AES S-Box
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1