{"title":"具有时间窗、容量约束和无限车辆数量的车辆路径问题的近似算法:海报论文","authors":"B. Armaselu, O. Daescu","doi":"10.1145/2910674.2910729","DOIUrl":null,"url":null,"abstract":"In this paper, we study the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles (VRPTWC-UV). We design a novel approximation algorithm to solve this problem. We also develop a JAVA framework that implements our algorithm and simulates it using Google Maps API. Our framework is very useful to assistive environments, as it can be used by any device using Google Maps API, for the purpose of assigning vehicle routes to minimize the total travelling costs.","PeriodicalId":359504,"journal":{"name":"Proceedings of the 9th ACM International Conference on PErvasive Technologies Related to Assistive Environments","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper\",\"authors\":\"B. Armaselu, O. Daescu\",\"doi\":\"10.1145/2910674.2910729\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles (VRPTWC-UV). We design a novel approximation algorithm to solve this problem. We also develop a JAVA framework that implements our algorithm and simulates it using Google Maps API. Our framework is very useful to assistive environments, as it can be used by any device using Google Maps API, for the purpose of assigning vehicle routes to minimize the total travelling costs.\",\"PeriodicalId\":359504,\"journal\":{\"name\":\"Proceedings of the 9th ACM International Conference on PErvasive Technologies Related to Assistive Environments\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 9th ACM International Conference on PErvasive Technologies Related to Assistive Environments\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2910674.2910729\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 9th ACM International Conference on PErvasive Technologies Related to Assistive Environments","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2910674.2910729","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper
In this paper, we study the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles (VRPTWC-UV). We design a novel approximation algorithm to solve this problem. We also develop a JAVA framework that implements our algorithm and simulates it using Google Maps API. Our framework is very useful to assistive environments, as it can be used by any device using Google Maps API, for the purpose of assigning vehicle routes to minimize the total travelling costs.