Invited ReviewOptimization for dynamic ride-sharing: A review
Highlights
► We introduce and formally define optimization problems in dynamic ride-sharing. ► We provide a survey of relevant optimization literature. ► We provide directions for future research.
Introduction
Finite oil supplies, rising gas prices, traffic congestion, and environmental concerns have recently increased the interest in services that allow people to use personal automobiles more wisely. The demand for ride-sharing services, which aim to bring together travelers with similar itineraries and time schedules, has increased sharply in recent years (Saranow, 2006). Ride-share providers across the globe are offering online notice boards for potential carpoolers, whether for daily commutes or for one-time trips to festivals, concerts, or sports events. Some online services, such as Nuride, provide incentives like restaurant coupons, gift certificates, or retail sales discounts to participants. Ride-sharing has generated much interest, and recent media coverage can be found in the Wall Street Journal (Saranow, 2006), Newsweek (Levy, 2007), Business Week (Walters, 2007), ABC News (Bell, 2007), The NY Times (Wiedenkeller, 2008), among many others.
Private car occupancy rates (the number of travelers per vehicle trip) are relatively low; average car occupancies in Europe range from 1.8 for leisure trips to 1.1 for commuters (EEA, 2005). Similar occupancy rates are also found in the US (Santos et al., 2011). The large demand for automobile transportation at peak-hours together with low occupancies leads to traffic congestion in many urban areas. The annual cost of congestion in the US in terms of lost hours and wasted fuel was estimated to be $78 billion in 2007 (Schrank and Lomax, 2007). Private automobile usage is also the dominant transportation mode producing carbon dioxide emissions (Hensher, 2008). Vehicle emissions give rise to problems both on a local and global scale. Locally, the health effects of air pollution represent a serious problem in many of the most densely populated regions worldwide (Brunekreef and Holgate, 2002, Kunzli et al., 2000). Globally, carbon dioxide emissions are associated with climate change and global warming.
Effective usage of empty car seats by ride-sharing may represent an important opportunity to increase occupancy rates, and could substantially increase the efficiency of urban transportation systems, potentially reducing traffic congestion, fuel consumption, and pollution. Moreover, ride-sharing allows users to share car-related expenses, which can be substantial. While ride-sharing is not a new idea, recent technological advances should increase its popularity, as we will explain. Certainly, ride-sharing must be easy, safe, flexible, efficient and economical before it will be adopted more widely.
To broaden its appeal, ride-sharing must be able to compete with one of the greatest advantages of private car usage: immediate access to door-to-door transportation. Technological advances, both hardware and software, are key enablers. In the US, the number of smartphone subscribers using the mobile Internet has grown 45 percent since 2010 (Nielsen, 2011), with approximately 40% of the mobile subscribers using a smartphone in 2011 (Smith, 2011). Similar estimates apply to the leading European markets (comScore, 2011). The growing ubiquity of Internet-enabled mobile devices partially enables practical dynamic ride-sharing (Hartwig and Buchmann, 2007, Hartmann, 2008).
By dynamic ride-sharing, we refer to a system where an automated system made available by a ride-share provider matches up drivers and riders on very short notice or even en-route. Recent startups like Carticipate, EnergeticX, Avego, and Flinc offer dynamic ride-sharing applications that allow drivers with spare seats to connect to people wanting to share a ride. They provide applications that run on (location-aware) Internet-enabled mobile phones. To ease the fear of sharing a ride with a potential stranger, these services use reputation systems (see e.g., PickupPal) or can be linked with social network tools like Facebook (see e.g., GoLoco and Zimride).
The ability of a dynamic ride-share provider to successfully establish ride-shares on short notice depends on the characteristics of the environment in terms of participant geographic density, traffic patterns, and the available roadway and transit infrastructure. Hall and Qureshi (1997) analyze the likelihood that a person will be successful in finding a ride-match, given a pool size of potential ride matches. Using probabilistic analysis, they conclude that in theory ride-sharing is viable since a congested freeway corridor should offer sufficient potential ride-matches. The authors also observe that there are many obstacles, primarily in terms of communication, so that the chance of finding a ride match in practice may in fact be small. Fortunately, technological advances have greatly reduced this communication obstacle.
Although the enabling technology is available, ride-sharing success stories are still in short supply. The development of algorithmic approaches for optimally matching drivers and riders in real-time may only play a small role in the ultimate success of ride-sharing, but it is central to the concept. Therefore, we believe that the time is right for a systematic overview of the issues in ride-sharing and the relevant optimization models that support the matching of riders and drivers in real-time. Since the operations research community has only recently started to address the related optimization challenges, we not only focus on the literature that specifically considers ride-share optimization but also on optimization approaches in other areas of transportation that share similar features. By introducing and formally defining dynamic ride-sharing problems, and by illustrating and outlining the optimization challenges that arise when developing technology to support ride-sharing, we hope to encourage more research by the transportation science and logistics community in this exciting, emerging area of public transportation.
The remainder of the paper is structured as follows. In Section 2, we explain and characterize the dynamic ride-sharing concept and introduce several relevant planning issues that arise in this context. In Section 3, we present a more formal definition of the basic ride-sharing problem and its various variants and survey the available literature. In Section 4 we discuss dynamic ride-sharing problems. In Section 5, we present the multi-modal version of the ride-sharing problem. Finally, in Section 6, we summarize our main insights and discuss directions for future research. Throughout the paper we also provide an overview of related problems in passenger and freight transportation optimization.
Section snippets
Features of dynamic ride-sharing
In this paper, we use the term dynamic ride-sharing to describe an automated system that facilitates drivers and riders to share one-time trips close to their desired departure times. The concept is also known as real-time ride-sharing, ad hoc ride-sharing, and instant ride-sharing. We characterize this concept by the following features:
- •
Dynamic The ride-share can be established on short-notice, which can range from a few minutes to a few hours before departure time. The growing use of
Basic ride-sharing problems
In this section, we describe optimization models that can be used to address these matching problems. We limit our attention here to what we will denote as static ride-sharing variants, where it is assumed that all driver and rider requests are known in advance prior to the execution of a matching process. In Section 4, this restriction will be relaxed as we examine the more relevant problems of dynamic matching.
Drivers offering a ride may want to take a single rider or may be willing to take
Dynamic ride-sharing problems
In any practical dynamic ride-share implementation, new riders and drivers continuously enter and leave the system. A driver enters the system by announcing a planned trip and offering a ride, while a rider enters the system by announcing a planned trip and requesting a ride. Drivers and riders leave the system when a ride-share arrangement has been planned and accepted, or when their planned trips “expire,” i.e., when the latest possible departure time of a planned trip occurs before a
The multi-modal ride-sharing problem
Instead of providing door-to-door transportation, the ride-share concept could be integrated with other modes of transportation, such as public transit. Ride-sharing may provide a very effective means to increase the use of a scheduled public transportation system if it can be used as a feeder service. In such a setting, a driver would first take a rider from the rider’s origin to a public transport stop, then he would use public transit to get close to his destination, and finally he would
Conclusions
New dynamic ride-sharing systems have the potential to provide huge societal and environmental benefits. The development of algorithms for optimally matching drivers and riders in real-time is at the heart of the ride-sharing concept. We have formally defined dynamic ride-sharing, have highlighted many of the interesting optimization challenges that arise when developing technology to support dynamic ride-sharing and have reviewed the relevant operations research models in this area. We have
References (68)
- et al.
Dynamic ride-sharing: a simulation study in metro atlanta
Transportation Reserch Part B, Methodological
(2011) - et al.
Fairness in scheduling
Journal of Algorithms
(1998) - et al.
Network hub location problems: the state of the art
European Journal of Operational Research
(2008) - et al.
Dynamic pickup and delivery problems
European Journal of Operational Research
(2010) - et al.
The effectiveness of ridesharing incentives
Regional Science and Urban Economic
(1992) - et al.
Air pollution and health
Lancet
(2002) - et al.
Transportation on demand
- et al.
Optimization approach to depot location and trip selection in one-way carsharing systems
Transportation Research Part E: Logistics and Transportation Review
(2012) - et al.
The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
European Journal of Operational Research
(2010) - et al.
Seattle smart traveler: dynamic ridematching on the world wide web
Transportation Research Part C – Emerging Technologies
(1999)
Autonomous dial-a-ride transit introductory overview
Transportation Research Part C – Emerging Technologies
Climate change, enhanced greenhouse gas emissions and passenger transport what can we do to make a difference?
Transportation Research Part D: Transport and Environment
Fleet scheduling and dispatching for demand-responsive passenger services
Transportation Research Part C
A decision support system for vehicle relocation operations in carsharing systems
Transportation Research Part E: Logistics and Transportation Review
Public-health impact of outdoor and traffic-related air pollution: a european assessment
Lancet
Feeder transit services: choosing between fixed and demand responsive policy
Transportation Research Part C
On fairness in the carpool problem
Journal of Algorithms
Quality of service in dial-a-ride operations
Computers & Industrial Engineering
Assignment problems: a golden anniversary survey
European Journal of Operational Research
Dynamic models for freight transportation
Mobility allowance shuttle transit (mast) services: mip formulation and strengthening with logic constraints
European Journal of Operational Research
Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
Computers & Operations Research
Service capacity design problems for mobility allowance shuttle transit systems
Transportation Research Part B – Methodological
An exact method for the car pooling problem based on lagrangean column generation
Operations Research
Two startups harness facebook’s power to connect riders to rides – social networking web site hopes to reverse sagging ride-share rates
ABC News
Methodology for short-range travel demand predictions: analysis of carpooling incentives
Journal of Transport Economic and Policy
Scenario-based planning for partially dynamic vehicle routing with stochastic customers
Operations Research
Static pickup and delivery problems: a classification scheme and survey
Top
A distributed geographic information system for the daily car pooling problem
Computers & Operations Research
Strategic network design for motor carriers
The dial-a-ride problem: models and algorithms
Annals of Operations Research
A fair carpool cheduling algorithm
IBM Journal of Research and Development
Cited by (842)
Decision-making in open carpooling programs: Perspectives of drivers versus passengers
2024, Travel Behaviour and SocietySharing in construction projects — On determining optimal container assignments for the on-site accommodation of trades
2024, European Journal of Operational ResearchA filtering system to solve the large-scale shared autonomous vehicles Dial-a-Ride Problem
2024, Transportation Research Part C: Emerging TechnologiesDesigning railway transit network with first-mile access via ride-sharing autonomous vehicle service
2024, Travel Behaviour and SocietyAverage minimum distance to visit a subset of random points in a compact region
2024, Transportation Research Part B: MethodologicalOnline acceptance probability approximation in peer-to-peer transportation
2024, Omega (United Kingdom)