☆ 4.5 Article

Efficient Algorithms for Stochastic Ride-Pooling Assignment with Mixed Fleets

TRANSPORTATION SCIENCE (2023)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Operations Research & Management Science

Two-Sided Deep Reinforcement Learning for Dynamic Mobility-on-Demand Management with Mixed Autonomy

Jiaohong Xie et al.

Summary: This study optimizes the real-time fleet management of an MoD system with a mixed autonomy of CVs and AVs. By prioritizing human drivers in the matching decisions and dynamically determining AV relocation tasks and commission fees, the service level can be improved. The two-sided multiagent DRL approach is demonstrated using real taxi trip data in New York City, and results show that the algorithm outperforms benchmark policies.

TRANSPORTATION SCIENCE (2023)

添加到收藏夹

Article Business

The Dual Effects of Team Contest Design on On-Demand Service Work Schedules

Tingting Dong et al.

Summary: Emerging on-demand service platforms (OSPs) have adopted teamwork as a strategy to increase workers' productivity and address supply and demand imbalances. This research focuses on the design problem of a team contest scheme considering work schedules. The introduction of teams on OSPs creates a hierarchical game structure, where the platform establishes rewards and revenue-sharing rules for workers, and teams compete to maximize their utility. A novel algorithm combining Bayesian optimization, duality, and penalty method is proposed to solve the optimal scheme. Results show that teamwork is beneficial with limitations, as it helps workers and teams strategically mitigate negative effects of overcompetition, and the optimal scheme aligns workers' preferences with the platform's interests.

SERVICE SCIENCE (2023)

添加到收藏夹

Article Management

Dimensioning On-Demand Vehicle Sharing Systems

Saif Benjaafar et al.

Summary: This study addresses the optimal fleet sizing in a vehicle sharing system, proposing models and methods to obtain upper and lower bounds for the optimal number of vehicles. Extensive numerical experiments show that the approximate and exact values are nearly indistinguishable, and the analysis reveals significant differences between standard queueing systems and those with server roaming. The additional capacity needed to buffer against vehicle roaming can be substantial even in systems with very low demand.

MANAGEMENT SCIENCE (2022)

添加到收藏夹

Article Economics

Equilibrium modeling of mixed autonomy traffic flow based on game theory

Jia Li et al.

Summary: This paper presents an equilibrium model of traffic flow with mixed autonomy based on the theory of two-player games. The study focuses on the interactions between human-driven and automated vehicles in both longitudinal and lateral dimensions. The model shows the existence of two types of Nash equilibria, one of which is always Pareto efficient. A speed policy is proposed to ensure that the realized equilibria are Pareto efficient in all traffic regimes. Two examples are provided to illustrate the applications of this model, including constructing flux functions based on behavior characteristics and considering lane policies in mixed autonomy traffic.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2022)

添加到收藏夹

Article Management

Optimizing large on-demand transportation systems through stochastic conic programming

Shukai Li et al.

Summary: This paper introduces a new stochastic conic programming approach for achieving near-optimal vehicle repositioning controls in OTS, with low computational complexity and high accuracy, applicable to most existing queueing-network models. Through practical exploration in New York City, the results show the potential of this method in providing more convenient and sustainable on-demand mobility services.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

添加到收藏夹

Article Transportation Science & Technology

Data-driven analysis on matching probability, routing distance and detour distance in ride-pooling services

Jintao Ke et al.

Summary: This study investigates the relationships between pool-matching probability, passengers' average detour distance, average vehicle routing distance, and the number of passengers in matching pool in ride-pooling services. Through empirical experiments based on real on-demand mobility data, the study finds that these relationships can be fitted by simple curves or adhere to empirical laws. These findings provide valuable insights for theoretical modeling and practical applications in ride-sourcing markets, such as evaluating the impacts of ride-pooling on transit usage and traffic congestion.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

添加到收藏夹

Article Transportation Science & Technology

The benefits of autonomous vehicles for community-based trip sharing

Mohd Hafiz Hasan et al.

Summary: This study examines the potential benefits of autonomous vehicles in community-based trip sharing. Through optimization algorithms, the daily vehicle usage can be reduced by 92%, while daily vehicle miles traveled can be decreased by approximately 30%.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

添加到收藏夹

Article Economics

Optimal contract design for ride-sourcing services under dual sourcing

Tingting Dong et al.

Summary: This study examines the optimal contract design of dual sourcing under demand uncertainty, finding that with adequately low price sensitivity of freelancers, both the platform and drivers can benefit from dual sourcing.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2021)

添加到收藏夹

Article Economics

Simulation-based design and analysis of on-demand mobility services

Iliya Markov et al.

Summary: This article explores the process of designing and analyzing on-demand mobility services using Chicago as a test case. Through surveying articles and conducting experimental studies, insights are gained into how different service designs perform under real transportation demand patterns.

TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE (2021)

添加到收藏夹

Article Economics

Robust matching-integrated vehicle rebalancing in ride-hailing with uncertain demand

Xiaotong Guo et al.

Summary: This study presents a novel matching-integrated vehicle rebalancing model, which incorporates driver-customer matching into vehicle rebalancing problems to produce better solutions. Testing with real data from New York City shows that the proposed model outperforms benchmark models in reducing customer wait times and planning for demand uncertainty.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2021)

添加到收藏夹

Article Transportation Science & Technology

Optimizing matching time intervals for ride-hailing services using reinforcement learning

Guoyang Qin et al.

Summary: Efficiently matching trip requests and available drivers in ride-hailing services is crucial, with a strategy of delaying matching to improve efficiency. The optimal delayed matching depends on the trade-off between delay penalty and reduced wait cost, and tailored reinforcement learning-based methods are used to overcome challenges. This work also addresses spatial partitioning balance and provides insights into delayed matching policies with real-world taxi trajectory data.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

添加到收藏夹

Article Economics

Optimizing matching time interval and matching radius in on-demand ride-sourcing markets

Hai Yang et al.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2020)

添加到收藏夹

Article Management

Managing Supply in the On-Demand Economy: Flexible Workers, Full-Time Employees, or Both?

Jing Dong et al.

OPERATIONS RESEARCH (2020)

添加到收藏夹

Article Engineering, Civil

An Integrated Decomposition and Approximate Dynamic Programming Approach for On-Demand Ride Pooling

Xian Yu et al.

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS (2020)

添加到收藏夹

Article Operations Research & Management Science

The Commute Trip-Sharing Problem

Mohd Hafiz Hasan et al.

TRANSPORTATION SCIENCE (2020)

添加到收藏夹

Article Automation & Control Systems

Mixed Autonomy in Ride-Sharing Networks

Qinshuang Wei et al.

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS (2020)

添加到收藏夹

Article Transportation Science & Technology

Real-time city-scale ridesharing via linear assignment problems

Andrea Simonetto et al.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2019)

添加到收藏夹

Article Economics

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)

添加到收藏夹

Article Management

Empty-Car Routing in Ridesharing Systems

Anton Braverman et al.

OPERATIONS RESEARCH (2019)

添加到收藏夹

Review Economics

Ridesourcing systems: A framework and review

Hai Wang et al.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2019)

添加到收藏夹

Article Economics

Mean field theory of demand responsive ride pooling systems

Stephan Herminghaus

TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE (2019)

添加到收藏夹

Article Transportation

Connected and automated vehicle systems: Introduction and overview

Steven E. Shladover

JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS (2018)

添加到收藏夹

Article Transportation Science & Technology

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)

添加到收藏夹

Article Multidisciplinary Sciences

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)

添加到收藏夹

Article Economics

Towards vehicle automation: Roadway capacity formulation for traffic mixed with regular and automated vehicles

Danjue Chen et al.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2017)

添加到收藏夹

Article Economics

Optimal design of autonomous vehicle zones in transportation networks

Zhibin Chen et al.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2017)

添加到收藏夹

Article Transportation Science & Technology

Designing optimal autonomous vehicle sharing and reservation systems: A linear programming approach

Jiaqi Ma et al.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2017)

添加到收藏夹

Article Computer Science, Theory & Methods

Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets

Anupam Gupta et al.

ACM TRANSACTIONS ON ALGORITHMS (2016)

添加到收藏夹

Article Operations Research & Management Science

Approximating Sparse Covering Integer Programs Online

Anupam Gupta et al.

MATHEMATICS OF OPERATIONS RESEARCH (2014)

添加到收藏夹

Article Multidisciplinary Sciences

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)

添加到收藏夹

Article Computer Science, Software Engineering

On linear and semidefinite programming relaxations for hypergraph matching

Yuk Hei Chan et al.

MATHEMATICAL PROGRAMMING (2012)

添加到收藏夹

Article Operations Research & Management Science

Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications

B. K. Pagnoncelli et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2009)

添加到收藏夹

Review Computer Science, Information Systems

A survey of the generalized assignment problem and its applications

Temel Oncan

INFOR (2007)

添加到收藏夹

Article Computer Science, Theory & Methods

On the complexity of approximating k-set packing

E Hazan et al.

COMPUTATIONAL COMPLEXITY (2006)

添加到收藏夹

Article Computer Science, Theory & Methods

A polynomial time approximation scheme for the multiple knapsack problem

C Chekuri et al.

SIAM JOURNAL ON COMPUTING (2006)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.