Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles: Poster Paper

B. Armaselu, O. Daescu
{"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}
引用次数: 1

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.
具有时间窗、容量约束和无限车辆数量的车辆路径问题的近似算法:海报论文
本文研究了具有时间窗、容量约束和无限车辆数量的车辆路径问题(VRPTWC-UV)。我们设计了一种新的近似算法来解决这个问题。我们还开发了一个JAVA框架来实现我们的算法,并使用Google Maps API对其进行模拟。我们的框架对辅助环境非常有用,因为它可以被任何使用谷歌地图API的设备使用,目的是分配车辆路线,以最大限度地减少总旅行成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信