Minimizing Latency in Online Ride and Delivery Services
Author:
Affiliation:
1. Google Research, Mountain View, CA, USA
2. Stanford University, Stanford, CA, USA
3. Duke University, Durham, NC, USA
4. University of Waterloo, Waterloo, ON, Canada
Funder
National Science Foundation
Natural Sciences and Engineering Research Council
Publisher
ACM Press
Reference34 articles.
1. Hernán Abeledo, Ricardo Fukasawa, Artur Pessoa, and Eduardo Uchoa. 2013. The time dependent traveling salesman problem: polyhedra and algorithm. Mathematical Programming Computation 5, 1 (01 Mar 2013), 27--55. https: //doi.org/10.1007/s12532-012-0047-y
2. Aamena Alshamsi, Sherief Abdallah, and Iyad Rahwan. 2009. Multiagent Selforganization for a Taxi Dispatch System. In Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '09).
3. F. Angel-Bello, Y. Cardona-Valdé A. Á. 2017. Mixed integer formulations for the multiple minimum latency problem. Operational Research (08 Feb 2017). https://doi.org/10.1007/s12351-017-0299--4
4. Aaron Archer and Anna Blasiak. 2010. Improved Approximation Algorithms for the Minimum Latency Problem via Prize-collecting Strolls. In Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 429--447. http://dl.acm.org/citation.cfm?id=1873601.1873637
5. Aaron Archer, Asaf Levin, and David P. Williamson. 2008. A Faster, Better Approximation Algorithm for the Minimum Latency Problem. SIAM J. Comput. 37, 5 (2008), 1472--1498. https://doi.org/10.1137/07068151X arXiv:https://doi.org/10.1137/07068151X
Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Multi-Agent Pickup and Delivery in Transformable Production;2023 IEEE 19th International Conference on Automation Science and Engineering (CASE);2023-08-26
2. Enriching Smart Cities by Optimizing Electric Vehicle Ride-Sharing through Game Theory;2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI);2022-10
3. Efficient Online City-Scale Patrolling by Exploiting Offline Model-Based Coordination Policy;IEEE Transactions on Intelligent Transportation Systems;2021
4. Efficient Delivery Services Sharing with Time Windows;Applied Sciences;2020-10-22
5. Online pickup and delivery problem with constrained capacity to minimize latency;Journal of Combinatorial Optimization;2020-06-27
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3