{"title":"Solving capacitated vehicle routing problem using intelligent water drops algorithm","authors":"A. Wedyan, A. Narayanan","doi":"10.1109/ICNC.2014.6975880","DOIUrl":null,"url":null,"abstract":"The Capacitated Vehicle Routing Problem (CVRP) is a well-known NP-hard problem of importance to real life applications such as transportation and logistics. The CVRP finds the best set of paths between a specific number of customers to deliver goods by a number of vehicles with a fixed capacity. In this paper, we apply a new nature inspired optimization algorithm called Intelligent Water Drops (IWD) inspired by water flow. The results of this IWD approach are compared against a classical approach and show that IWD algorithm gives optimal and near optimal solutions for some CVRP instances.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 10th International Conference on Natural Computation (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2014.6975880","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
The Capacitated Vehicle Routing Problem (CVRP) is a well-known NP-hard problem of importance to real life applications such as transportation and logistics. The CVRP finds the best set of paths between a specific number of customers to deliver goods by a number of vehicles with a fixed capacity. In this paper, we apply a new nature inspired optimization algorithm called Intelligent Water Drops (IWD) inspired by water flow. The results of this IWD approach are compared against a classical approach and show that IWD algorithm gives optimal and near optimal solutions for some CVRP instances.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
