Stochastic Optimization Models and Methods for the Sharing Economy
Stochastic Optimization Models and Methods for the Sharing Economy
批准号:
1537394
负责人:
David Shmoys
金额:
$20.0万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2015
资助国家:
美国
项目状态:
已结题
起止时间:
2015-09-01 至 2018-08-31
中文摘要
随着基于资源共享的产业浪潮的引入,美国经济正在经历一场戏剧性的变化。突出的例子包括ZipCar和Motivate等车辆共享服务,Uber和Lyft等“类似出租车”的服务,以及Airbnb。这类服务不仅依赖于分散用户之间的实时信息流,还依赖于确保高可靠性水平,以确保用户保持对服务的忠诚度。例如,在车辆共享中,用户能够随时随地获得他们想要的车辆并具有高可靠性,这一点很重要。该提案探索了与共享经济相关的物流问题的随机优化模型和方法,特别强调车辆共享。核心问题涉及舰队规模和整个城市的舰队部署。由于车辆使用具有严重的时间依赖性和随机性,这些问题变得复杂起来。提出了一套解决这些问题的模型和方法,其中包括容量大小的长期规划方法和近实时车辆供需协调的短期规划方法。长期规划方法建立在构建随机模型的基础上,该随机模型同时准确地模拟汽车共享运营,并且被证明具有可以通过有效的优化技术,特别是整数线性规划来利用的数学结构。这些性质将通过组合论证建立一组充分条件,允许对整数格上定义的问题应用线性规划(因为一个位置的车辆数量和位置的容量是整数)。然后通过使用随机耦合技术,为所讨论的随机模型建立这些充分条件。这种组合和耦合论点可能广泛适用于共享经济中出现的问题之外,正如模拟优化测试问题库中大量类似结构的问题所证明的那样。除了这些长期规划工具外,还将开发能够对实地情况作出近乎实时反应的短期工具。在车辆共享系统中,这种工具将指导车辆的重新定位,以便更好地与当前和预期的需求保持一致,并以长期规划工具的结果为指导。拟议工作中的一项统一原则是开发在正常运行条件下优化预期性能的方法,以确保高效运行,同时对冲最坏情况的事件,以提供对意外发展的重要健壮性。这项工作的目标是提供由新的理论结果支持的实际解决方案,这些新的理论结果建立了强大的平均情况和最坏情况保证。
英文摘要
The US economy is undergoing a dramatic change with the introduction of a wave of industries based on the sharing of resources. Prominent examples include vehicle-sharing services like ZipCar and Motivate, "taxi-like" services like Uber and Lyft, and Airbnb. Such services rely not just on real-time information flow between dispersed users, but also on ensuring high reliability levels to ensure that users remain loyal to the service. For example, in vehicle sharing it is important that subscribers are able to obtain vehicles when and where they want them with high reliability. This proposal explores stochastic optimization models and methodology for logistical questions associated with the sharing economy, with particular emphasis on vehicle sharing. Central questions relate to fleet sizing and fleet deployment across a city. These questions are complicated by the heavily time-dependent and stochastic nature of vehicle usage.A suite of models and methods for tackling these problems is proposed that includes both long-term planning methodology for capacity sizing and short-term planning methodology for near real-time alignment of supply and demand of vehicles. The long-term planning methods are based on constructing stochastic models that simultaneously accurately model vehicle-sharing operations and provably possess mathematical structure that can be exploited through efficient optimization techniques, particularly integer linear programming. These properties will be established through combinatorial arguments to establish a set of sufficient conditions that allow one to apply linear programming on problems that are defined on integer lattices (since the number of vehicles at a location, and the capacity of locations are integral). These sufficient conditions will then be established for the stochastic models in question through the use of stochastic coupling techniques. This combination of combinatorial and coupling arguments may be broadly applicable beyond problems arising in the sharing economy, as evidenced by a plethora of similarly structured problems in a repository of simulation-optimization test problems. In addition to these long-term planning tools, short-term tools will be developed that enable a near real-time response to conditions on the ground. In vehicle-sharing systems, such tools would guide the repositioning of vehicles to better align with current and anticipated demand, using the results from long-term planning tools as a guide. A unifying principle in the proposed work is to develop methods that optimize expected performance under usual operating conditions to ensure efficient operation, while hedging against worst-case events to provide an important level of robustness to unexpected developments. The goal of this is work is provide practical solutions supported by new theoretical results that establish both strong average-case and worst-case guarantees.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: Approximation Algorithms for Problems in Logistics
-
批准号:1526067
-
项目类别:Standard Grant
-
资助金额:$40.0万
-
财政年份:2015
-
负责人:David Shmoys
-
依托单位:
IEEE Symposium on Foundations of Computer Science (FOCS) 2013, Berkeley, CA Oct 27-29, 2013
-
批准号:1348020
-
项目类别:Standard Grant
-
资助金额:$2.0万
-
财政年份:2013
-
负责人:David Shmoys
-
依托单位:
AF: Small: AAdvances in the Design of Approximation Algorithms for Optimization Problems
-
批准号:1017688
-
项目类别:Standard Grant
-
资助金额:$49.96万
-
财政年份:2010
-
负责人:David Shmoys
-
依托单位:
Approximation algorithms for discrete stochastic and deterministic optimization problems
-
批准号:0635121
-
项目类别:Continuing Grant
-
资助金额:$32.0万
-
财政年份:2006
-
负责人:David Shmoys
-
依托单位:
Approximation Algorithms for Scheduling, Packing, and Related Logistics Problems
-
批准号:0430682
-
项目类别:Continuing grant
-
资助金额:$0.0万
-
财政年份:2004
-
负责人:David Shmoys
-
依托单位:
The Design, Analysis and Application of Approximation Algorithms
-
批准号:9912422
-
项目类别:Standard Grant
-
资助金额:$27.08万
-
财政年份:2000
-
负责人:David Shmoys
-
依托单位:
U.S.-Canada Joint Workshop on Approximation Algorithms for NP-Hard Problems, Toronto, Canada, Sept. 26 - Oct. 1, 1999
-
批准号:9904068
-
项目类别:Standard Grant
-
资助金额:$1.5万
-
财政年份:1999
-
负责人:David Shmoys
-
依托单位:
Approximation Algorithms via Linear Programming
-
批准号:9700029
-
项目类别:Standard Grant
-
资助金额:$0.0万
-
财政年份:1997
-
负责人:David Shmoys
-
依托单位:
Near-Optimal Solutions for Combinatorial Problems: Algorithms and Complexity
-
批准号:9307391
-
项目类别:Continuing grant
-
资助金额:$0.0万
-
财政年份:1994
-
负责人:David Shmoys
-
依托单位:
PYI: The Design and Analysis of Efficient Algorithms
-
批准号:8996272
-
项目类别:Continuing Grant
-
资助金额:$15.05万
-
财政年份:1989
-
负责人:David Shmoys
-
依托单位:
Presidential Young Investigator Award (Computer Research)
-
批准号:8657688
-
项目类别:Continuing Grant
-
资助金额:$11.34万
-
财政年份:1987
-
负责人:David Shmoys
-
依托单位:
国内基金
海外基金
Scalable Learning and Optimization: High-dimensional Models and Online Decision-Making Strategies for Big Data Analysis
-
批准号:--
-
项目类别:合作创新研究团队
-
资助金额:--
-
批准年份:2024
-
负责人:姚韬
-
依托单位:
供应链管理中的稳健型(Robust)策略分析和稳健型优化(Robust Optimization )方法研究
-
批准号:70601028
-
项目类别:青年科学基金项目
-
资助金额:7.0万元
-
批准年份:2006
-
负责人:王明征
-
依托单位: