开放式车辆路径问题的克隆选择算法

2009 Third International Conference on Genetic and Evolutionary Computing Pub Date : 2009-10-14 DOI:10.1109/WGEC.2009.174

L. Pan, Z. Fu

{"title":"开放式车辆路径问题的克隆选择算法","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":"{\"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}","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

摘要

本文提出了一种开放式车辆路径问题的克隆选择算法，该算法引入了抗体亲和力的新定义和保持抗体多样性的算法。给出了一组基准问题的计算结果。与文献中最优克隆选择算法的比较表明，该克隆选择算法是有效的。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Clone Selection Algorithm for the Open Vehicle Routing Problem

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.

求助全文

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

来源期刊

2009 Third International Conference on Genetic and Evolutionary Computing

自引率

0.00%

发文量