Optimization for dynamic ride-sharing: a review
From MaRDI portal
Publication:2253345
DOI10.1016/j.ejor.2012.05.028zbMath1292.90179MaRDI QIDQ2253345
Xing Wang, Niels Agatz, Savelsbergh, Martin W. P., Alan L. Erera
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.05.028
90B06: Transportation, logistics and supply chain management
90B90: Case-oriented studies in operations research
Related Items
Unnamed Item, Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem, Simulated annealing heuristic for the general share-a-ride problem, Efficient algorithms for ridesharing of personal vehicles, Approximate ridesharing of personal vehicles problem, An integrated ride-matching and vehicle-rebalancing model for shared mobility on-demand services, On the distance between random events on a network, A new <scp>ride‐sharing</scp> model incorporating the passengers' efforts, A min-max theorem for the minimum fleet-size problem, Budget-balanced and strategy-proof auctions for ridesharing, Matching supply and demand for free-floating car sharing: on the value of optimization, Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem, The share-a-ride problem: people and parcels sharing taxis, Sustainable operations, The vehicle routing problem with occasional drivers, Algorithmic analysis for ridesharing of personal vehicles, Collaborative urban transportation: recent advances in theory and practice, Minimizing \(\mathrm{CO}_2\) emissions in a practical daily carpooling problem, Enhancing urban mobility: integrating ride-sharing and public transit, Trends in transportation and logistics, Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes, Models and linearizations for the Traveling Car Renter with passengers, Matching supply and demand in a sharing economy: classification, computational complexity, and application, Optimal pricing for ride-sourcing platforms, The pickup and delivery problem with time windows and occasional drivers, Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration, Optimizing carpool formation along high-occupancy vehicle lanes, A multi-period analysis of the integrated item-sharing and crowdshipping problem, Opportunities for reinforcement learning in stochastic dynamic vehicle routing, The complexity of the unit stop number problem and its implications to other related problems, How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium, Environmental and social implications of incorporating carpooling service on a customized bus system, Complexity and approximation results on the shared transportation problem, Modelling and analysis of online ride-sharing platforms -- a sustainability perspective, Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles, An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals, Local search algorithms for the maximum carpool matching problem, Optimizing large on-demand transportation systems through stochastic conic programming, Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand, Ride solo or pool: designing price-service menus for a ride-sharing platform, Scalability issues in optimal assignment for carpooling, Pricing and allocation algorithm designs in dynamic ridesharing system, An exact solution method for the capacitated item-sharing and crowdshipping problem, An enhanced approach for two-sided matching with 2-tuple linguistic multi-attribute preference, Incorporating ridesharing in the static traffic assignment model, Approximation algorithms for the maximum carpool matching problem, A cooperative game-theoretic approach to the social ridesharing problem, Complexity and approximability of extended spanning star forest problems in general and complete graphs, Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms, A data-driven matching algorithm for ride pooling problem, The real-time on-demand bus routing problem: the cost of dynamic requests, Algorithmic Analysis for Ridesharing of Personal Vehicles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Assignment problems: a golden anniversary survey
- Dynamic pickup and delivery problems
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- A distributed geographic information system for the daily car pooling problem
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints
- The dial-a-ride problem: Models and algorithms
- Network hub location problems: The state of the art
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance
- Fast Detour Computation for Ride Sharing
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- Fairness in Scheduling
- A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
- On fairness in the carpool problem
- The General Pickup and Delivery Problem
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
