相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。Two-Sided Deep Reinforcement Learning for Dynamic Mobility-on-Demand Management with Mixed Autonomy
Jiaohong Xie et al.
TRANSPORTATION SCIENCE (2023)
The Dual Effects of Team Contest Design on On-Demand Service Work Schedules
Tingting Dong et al.
SERVICE SCIENCE (2023)
Dimensioning On-Demand Vehicle Sharing Systems
Saif Benjaafar et al.
MANAGEMENT SCIENCE (2022)
Equilibrium modeling of mixed autonomy traffic flow based on game theory
Jia Li et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2022)
Optimizing large on-demand transportation systems through stochastic conic programming
Shukai Li et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
Data-driven analysis on matching probability, routing distance and detour distance in ride-pooling services
Jintao Ke et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)
The benefits of autonomous vehicles for community-based trip sharing
Mohd Hafiz Hasan et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)
Optimal contract design for ride-sourcing services under dual sourcing
Tingting Dong et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2021)
Simulation-based design and analysis of on-demand mobility services
Iliya Markov et al.
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE (2021)
Robust matching-integrated vehicle rebalancing in ride-hailing with uncertain demand
Xiaotong Guo et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2021)
Optimizing matching time intervals for ride-hailing services using reinforcement learning
Guoyang Qin et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)
Optimizing matching time interval and matching radius in on-demand ride-sourcing markets
Hai Yang et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2020)
Managing Supply in the On-Demand Economy: Flexible Workers, Full-Time Employees, or Both?
Jing Dong et al.
OPERATIONS RESEARCH (2020)
An Integrated Decomposition and Approximate Dynamic Programming Approach for On-Demand Ride Pooling
Xian Yu et al.
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS (2020)
The Commute Trip-Sharing Problem
Mohd Hafiz Hasan et al.
TRANSPORTATION SCIENCE (2020)
Mixed Autonomy in Ride-Sharing Networks
Qinshuang Wei et al.
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS (2020)
Real-time city-scale ridesharing via linear assignment problems
Andrea Simonetto et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2019)
Modeling individuals' willingness to share trips with strangers in an autonomous vehicle future
Patricia S. Lavieri et al.
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE (2019)
Empty-Car Routing in Ridesharing Systems
Anton Braverman et al.
OPERATIONS RESEARCH (2019)
Ridesourcing systems: A framework and review
Hai Wang et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2019)
Mean field theory of demand responsive ride pooling systems
Stephan Herminghaus
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE (2019)
Connected and automated vehicle systems: Introduction and overview
Steven E. Shladover
JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS (2018)
Dynamic ride sharing using traditional taxis and shared autonomous taxis: A case study of NYC
Mustafa Lokhandwala et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2018)
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
Javier Alonso-Mora et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2017)
Towards vehicle automation: Roadway capacity formulation for traffic mixed with regular and automated vehicles
Danjue Chen et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2017)
Optimal design of autonomous vehicle zones in transportation networks
Zhibin Chen et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2017)
Designing optimal autonomous vehicle sharing and reservation systems: A linear programming approach
Jiaqi Ma et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2017)
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
Anupam Gupta et al.
ACM TRANSACTIONS ON ALGORITHMS (2016)
Approximating Sparse Covering Integer Programs Online
Anupam Gupta et al.
MATHEMATICS OF OPERATIONS RESEARCH (2014)
Quantifying the benefits of vehicle pooling with shareability networks
Paolo Santi et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2014)
On linear and semidefinite programming relaxations for hypergraph matching
Yuk Hei Chan et al.
MATHEMATICAL PROGRAMMING (2012)
Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications
B. K. Pagnoncelli et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2009)
A survey of the generalized assignment problem and its applications
Temel Oncan
INFOR (2007)
On the complexity of approximating k-set packing
E Hazan et al.
COMPUTATIONAL COMPLEXITY (2006)
A polynomial time approximation scheme for the multiple knapsack problem
C Chekuri et al.
SIAM JOURNAL ON COMPUTING (2006)