一种改进的基于智能水滴算法的车辆路径优化方法

Zahra Booyavi, E. Teymourian, G. Komaki, S. Sheikh
{"title":"一种改进的基于智能水滴算法的车辆路径优化方法","authors":"Zahra Booyavi, E. Teymourian, G. Komaki, S. Sheikh","doi":"10.1109/CIPLS.2014.7007162","DOIUrl":null,"url":null,"abstract":"We introduce an improved intelligent water drops (IIWD) algorithm as a new swarm-based nature inspired algorithm to solve capacitated vehicle routing problem. IIWD algorithm introduces new adjustments and features that help to optimize the VRP problem with higher efficiency. We reinforce this algorithm to have satisfactory consequences in controlling the balance between diversification and intensification of the search process. We solve 14 well-known benchmark instances in the literature to compare the solutions with the best reported solutions in the literature. Experimental results demonstrate that the suggested technique can well and effectively cope with such problems.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"398 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"An improved optimization method based on the intelligent water drops algorithm for the vehicle routing problem\",\"authors\":\"Zahra Booyavi, E. Teymourian, G. Komaki, S. Sheikh\",\"doi\":\"10.1109/CIPLS.2014.7007162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce an improved intelligent water drops (IIWD) algorithm as a new swarm-based nature inspired algorithm to solve capacitated vehicle routing problem. IIWD algorithm introduces new adjustments and features that help to optimize the VRP problem with higher efficiency. We reinforce this algorithm to have satisfactory consequences in controlling the balance between diversification and intensification of the search process. We solve 14 well-known benchmark instances in the literature to compare the solutions with the best reported solutions in the literature. Experimental results demonstrate that the suggested technique can well and effectively cope with such problems.\",\"PeriodicalId\":325296,\"journal\":{\"name\":\"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)\",\"volume\":\"398 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIPLS.2014.7007162\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIPLS.2014.7007162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

提出了一种改进的智能水滴算法(IIWD),作为一种新的基于群体的自然启发算法来解决有能力车辆路径问题。IIWD算法引入了新的调整和特征,有助于以更高的效率优化VRP问题。我们对该算法进行了强化,在控制搜索过程的多样化和集约化之间的平衡方面取得了令人满意的结果。我们解决了文献中14个众所周知的基准实例,将解决方案与文献中报道的最佳解决方案进行比较。实验结果表明,该方法能较好地解决这类问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved optimization method based on the intelligent water drops algorithm for the vehicle routing problem
We introduce an improved intelligent water drops (IIWD) algorithm as a new swarm-based nature inspired algorithm to solve capacitated vehicle routing problem. IIWD algorithm introduces new adjustments and features that help to optimize the VRP problem with higher efficiency. We reinforce this algorithm to have satisfactory consequences in controlling the balance between diversification and intensification of the search process. We solve 14 well-known benchmark instances in the literature to compare the solutions with the best reported solutions in the literature. Experimental results demonstrate that the suggested technique can well and effectively cope with such problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信