A Clone Selection Algorithm for the Open Vehicle Routing Problem

L. Pan, Z. Fu
{"title":"A Clone Selection Algorithm for the Open Vehicle Routing Problem","authors":"L. Pan, Z. Fu","doi":"10.1109/WGEC.2009.174","DOIUrl":null,"url":null,"abstract":"In this paper, a Clonal Selection Algorithm for the Open Vehicle Routing Problem¿OVRP¿is presented, in which a new definition of antibodies’ affinity and algorithm of keeping antibodies’ diversity are introduced. Computational results on a set of benchmark problems are provided. Comparison with the best ones in literature shows that the Clonal Selection Algorithm is efficient.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Third International Conference on Genetic and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WGEC.2009.174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this paper, a Clonal Selection Algorithm for the Open Vehicle Routing Problem¿OVRP¿is presented, in which a new definition of antibodies’ affinity and algorithm of keeping antibodies’ diversity are introduced. Computational results on a set of benchmark problems are provided. Comparison with the best ones in literature shows that the Clonal Selection Algorithm is efficient.
开放式车辆路径问题的克隆选择算法
本文提出了一种开放式车辆路径问题的克隆选择算法,该算法引入了抗体亲和力的新定义和保持抗体多样性的算法。给出了一组基准问题的计算结果。与文献中最优克隆选择算法的比较表明,该克隆选择算法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信