{"title":"求解MDVRP的一种新方法","authors":"R. R. Baghbadorani, M. A. Zajkani, M. Haeri","doi":"10.1109/ICEE52715.2021.9544126","DOIUrl":null,"url":null,"abstract":"Vehicle routing problem is one of the complex and NP-hard problems, which plays a crucial role in this hectic world regarding people's lifestyle. Nowadays, many people provide their stuff online, so a logistic problem has been outstripped for companies to reduce their transportation costs. In this article, a novel approach has been introduced, which can solve the multi-depot vehicle routing problem in shorter time. By using clustering and decomposing the main problem into smaller ones, solution time has been dropped dramatically. In addition, this approach obtains a reasonable cost, which can be considered as fuel consumption, distance, or so forth. This method could reduce the solution time drastically.","PeriodicalId":254932,"journal":{"name":"2021 29th Iranian Conference on Electrical Engineering (ICEE)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A New Approach to Solve MDVRP in Lower Computation Time\",\"authors\":\"R. R. Baghbadorani, M. A. Zajkani, M. Haeri\",\"doi\":\"10.1109/ICEE52715.2021.9544126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicle routing problem is one of the complex and NP-hard problems, which plays a crucial role in this hectic world regarding people's lifestyle. Nowadays, many people provide their stuff online, so a logistic problem has been outstripped for companies to reduce their transportation costs. In this article, a novel approach has been introduced, which can solve the multi-depot vehicle routing problem in shorter time. By using clustering and decomposing the main problem into smaller ones, solution time has been dropped dramatically. In addition, this approach obtains a reasonable cost, which can be considered as fuel consumption, distance, or so forth. This method could reduce the solution time drastically.\",\"PeriodicalId\":254932,\"journal\":{\"name\":\"2021 29th Iranian Conference on Electrical Engineering (ICEE)\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 29th Iranian Conference on Electrical Engineering (ICEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEE52715.2021.9544126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 29th Iranian Conference on Electrical Engineering (ICEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEE52715.2021.9544126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Approach to Solve MDVRP in Lower Computation Time
Vehicle routing problem is one of the complex and NP-hard problems, which plays a crucial role in this hectic world regarding people's lifestyle. Nowadays, many people provide their stuff online, so a logistic problem has been outstripped for companies to reduce their transportation costs. In this article, a novel approach has been introduced, which can solve the multi-depot vehicle routing problem in shorter time. By using clustering and decomposing the main problem into smaller ones, solution time has been dropped dramatically. In addition, this approach obtains a reasonable cost, which can be considered as fuel consumption, distance, or so forth. This method could reduce the solution time drastically.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
