Zahra Booyavi, E. Teymourian, G. Komaki, S. Sheikh
{"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}
引用次数: 16
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.