Human Satisfaction as the Ultimate Goal in Ridesharing

07/01/2018 ∙ by Chaya Levinger, et al. ∙ Ariel University 0

Transportation services play a crucial part in the development of modern smart cities. In particular, on-demand ridesharing services, which group together passengers with similar itineraries, are already operating in several metropolitan areas. These services can be of significant social and environmental benefit, by reducing travel costs, road congestion and co2 emissions. The deployment of autonomous cars in the near future will surely change the way people are traveling. It is even more promising for a ridesharing service, since it will be easier and cheaper for a company to handle a fleet of autonomous cars that can serve the demands of different passengers. We argue that user satisfaction should be the main objective when trying to find the best assignment of passengers to vehicles and the determination of their routes. Moreover, the model of user satisfaction should be rich enough to capture the traveling distance, cost, and other factors as well. We show that it is more important to capture a rich model of human satisfaction than peruse an optimal performance. That is, we developed a practical algorithm for assigning passengers to vehicles, which outperforms assignment algorithms that are optimal, but use a simpler satisfaction model. To the best of our knowledge, this is the first paper to exclusively concentrate on a rich and realistic function of user satisfaction as the objective, which is (arguably) the most important aspect to consider for achieving a widespread adaption of ridesharing services.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 5

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

The National Household Travel Survey performed in the U.S. in 2009 [Santos et al.2011] revealed that approximately 83.4% of all trips in the U.S. were in a private vehicle (other options being public transportation, walking, etc.). The average vehicle occupancy was only when compensating for the number of passengers (i.e., if two people travel in the same vehicale, their travel distance is multiplied by two). This extremely low average vehicle occupancy entails a very large number of vehicles on the road that collectively contribute to carbon dioxide emissions, fuel consumption, air pollution and an increase in traffic load, which in turn requires additional investment in enlarging the road infrastructure. In recent years, ride hailing services such as Uber and Lyft have gained popularity and an increasing number of passengers use these services as one of their main means of transportation [Wallsten2015]. Both Uber and Lyft are now also offering ride-sharing options, and other companies, such as Super-Shuttle and Via, are explicitly targeted at customers who want to share their ride.

The deployment of autonomous vehicles in the near future will have a significant impact on the way people are traveling. The implication of this revolutionary way of transportation is not fully known nowadays [Guerra2016], but it is safe to claim that autonomous vehicles will have a positive effect on the development of ridesharing services. Indeed, it will be easier and cheaper for a company to handle a fleet of autonomous vehicles that can serve the demands of different passengers. It can also rule-out some negative human-driver factors, such as driver’s fatigue from the long travels and the driver’s inconvenience from having multiple pick-up and drop stops along his route.

The basic challenge of a ridesharing service is how to assign the passengers’ requests for a ride to vehicles and define the routes for the fleet of vehicles in an optimal manner. This problem belongs to the generic class of Vehicle Routing and scheduling Problems (VRPs), which have been extensively studied over the past years, mainly in the operation research and transportation science communities. Several variants with different characteristics have been developed. For example, the initial formulation of the VRP assumes that the environment is static, i.e., all requests are known before-hand and do not change thereafter [Dantzig and Ramser1959]. The more complex variants, including the rideharing problem, are dynamic, where real-time requests are gradually revealed along the service operating time. In this setting the assignment of passengers to vehicles and the determination of vehicles’ routes may be adjusted when they are already in transit [Psaraftis et al.2016, Shen et al.2016]. Arguably, a major criterion that characterizes each variant of the VRP is the objective function. It is very common to consider objectives from the service provider’s perspective, for example, minimizing the total distance travelled [Secomandi2000], minimizing the fleet size [Diana et al.2006, Secomandi and Margot2009], or maximizing the service provider’s profit [Campbell and Savelsbergh2005, Parragh et al.2014]. However, as noted by Cordeau and Laporte [Cordeau and Laporte2003], one should be interested not only in minimizing the operating costs for the service provider but also in maximizing the quality of the service and the user satisfaction.

Many works integrate quality of service and user satisfaction considerations as additional constraints of the problem. For example, a time window restricts the waiting time a passenger is willing to face before being picked up [Jaw et al.1986, El-Sherbeny2010], and it is usually combined with a bound on the maximum user ride time [Paquette et al.2009]. In addition, there are several works that combine the aforementioned operational objectives with the objective of maximizing the user satisfaction (or its antonym, minimizing the user inconvenience). The common interpretation for user satisfaction is the minimization of the total user on-board (ride) time and the total user waiting time [Psaraftis1980], the extra riding time due to ride-sharing [Lin et al.2012], or the amount of deviations from desired departure and arrival times [Fu and Teply1999, Yang et al.2013]. However, to the best of our knowledge, there are no works that exclusively focus on maximizing a complex user satisfaction function, which captures the traveling distance, cost, and other factors as well.

We investigate a comprehensive human-centric approach for the ridesharing problem. Our basic claim is that the user satisfaction should be the main objective of the ridesharing service. Moreover, the model of user satisfaction should be rich enough to capture the complex interdependencies among several factors. Therefore, we develop a method for maximizing a complex user satisfaction function.

One approach for handling a rich objective function is to treat its factors as multiple objectives. Indeed, there are several methods in the literature on VRP for handling multiple objectives. The most common approach is to aggregate the objectives into a single weighted-sum objective function [Molenbruch et al.2017a], and advanced utility model may be used for modeling the interactions between the objectives [Lehuédé et al.2014]. Additional strategies define hierarchical objective function [Schilde et al.2011], or return a set of non-comparable solutions which do not weakly dominate each other [Parragh et al.2009, Molenbruch et al.2017b]

. Since our rich objective function models user satisfaction, we propose a different, human-centric, approach. Specifically, we investigate machine learning methods for modeling the rich satisfaction function from real humans.

Modeling human behaviour is not a easy task, and a theoretical model might fail to accurately capture real human behaviour. We therefore ran experiments with actual humans and build a deep learning based function to estimate user satisfaction. We introduce Simsat, an algorithm for assigning passengers to vehicles while maximizing a complex user satisfaction function as the objective, for the ridesharing last mile variant

[Cheng et al.2014] setting. We show that Simsat outperforms optimal assignment methods that use a simpler objective function, indicating that it is more important to obtain a richer model of user satisfaction, than improving the performance of the assignment algorithm.

2 Related Work

We will briefly review the current literature on the broad class of Vehicle Routing and scheduling Problems (VRPs), to place our ridesharing problem in an appropriate context. The VRP was first introduced by [Dantzig and Ramser1959]. The growing body of research on routing problem over the past years has led to the development of several research communities, which sometimes denote the same problem types by various names. In particular, the traditional VRP and some of its extensions deal with finding an optimal set of routes for a fleet of vehicles to traverse in order deliver or pickup some goods to a given set of costumers. We refer to the comprehensive survey of [Parragh et al.2008a]

on this class of problems, which they denote by Vehicle Routing Problems with Backhauls (VRPB). A more recent survey, that also defines a taxonomy to classify the various variants of VRP by

criteria, is given by [Psaraftis et al.2016]. A second class of problems, that is denoted by Parragh et al. as Vehicle Routing Problems with Pickups and Deliveries (VRPPD), deal with all those problems where goods are transported between pickup and delivery customers. We refer to the survey of [Parragh et al.2008b] on this class of problems. One subclass of VRPPD compromises the dial-a-ride problem (DARP), where the goods that are transported are passengers with associated pickup and delivery points. As noted by [Cordeau and Laporte2003], the DARP is distinguished from other problems in vehicle routing since transportation cost and user inconvenience must be weighed against each other in order to provide an appropriate solution. Therefore, the DARP typically includes more quality constraints that aim at capturing the user’s inconvenience. We refer to a recent survey on DARP by [Molenbruch et al.2017a], which also makes this distinction.

A domain closely related to ride-sharing is car-pooling. In this domain, ordinary drivers, may opt to take an additional passenger on their way to a shared destination. The common setting of car-pooling is within a long-term commitment between people to travel together for a particular purpose, where ridesharing is focused on single, non-recurring trips. Indeed, several works investigated car-pooling that can be established on a short-notice, and they refer to this problem as ridesharing [Agatz et al.2012]. We stress that in our ridesharing problem, similar to the DARP setting, there is a central organization that owns the vehicles, and they thus do not have their own travel plans.

3 Basic Model and Notation

Informally, the ridesharing problem consists of a weighted graph, requests given by passengers, each with an origin and a destination that are both nodes in the graph, and a set of vehicles, each with a given capacity. All the vehicles are assumed to be operated by a central entity. In this paper we focus on the last mile variant [Cheng et al.2014] setting. In this variant it is assumed that all the passengers are positioned at the same origin location (e.g. airport), where all the vehicles are also located, and must be taken to their final destination. The problem requires assigning travel routes (on the graph) to vehicles, in order to satisfy these passenger requests while optimizing a given objective function. In our work, we concentrate on the objective of maximizing the user satisfaction function.

Let be the number of passengers (and thus the number of requests). We assume that the service provider incurs a fixed cost per minute of travel, , that encapsulates the full operation cost including any desired revenue. For example, if the fuel, tolls and any maintenance costs are estimated at dollars per minute of travel, and the service provider commits to receiving only a certain percentage of the user payment (as its revenue), , equals . The service provider is free to determine how to distribute this cost among the passengers, and in section 3.2 we discuss the properties of this payment function.

Every user, , is assumed to have a primary travel time and distance , which are the time and distance, respectively, it would take the user to reach her destination had she received a direct ride. Consequently, we define for each user a primary travel cost . We will also add a fixed constant to that represents waiting time of the passenger had she received a direct ride. Given an assignment, , and a user , the actual travel time of the user is denoted by , the actual travel distance is denoted by , the actual amount paid by the user is denoted by , and the user satisfaction is denoted by .

3.1 The Human Satisfaction Function

Our definition of the objective of the ridesharing problem is to find an assignment that maximizes the sum on all user satisfaction, i.e., (or, equivalently, the average satisfaction ). For simplicity, in the last mile problem we assume that a passenger traveling alone has some baseline satisfaction level (“neither satisfied nor disatisfied”) from the trip. Satisfaction factors may include any or all of the following:

  • Travel cost. .

  • Actual travel time. . The travel time may also depend on other parameters, for example, a user may care more about travel time during the weekend.

  • Extra travel time. .

  • Actual travel distance. .

  • Extra travel distance.

  • Total number of passengers. Users may rather travel alone. The more passengers a ride may have the more inconvenient it may become to each of the passengers.

  • User’s seat. In every vehicle with a constant capacity some seats may be preferred over others. For example, if a vehicle with seats reaches its full capacity, most people prefer siting on the front seat rather than the middle back seat.

  • Working status / Occupation. Unemployed passengers may be willing to travel longer in exchange for a lower cost.

  • User demographic information. Depending on the user demographic group (e.g. age, gender, annual income), users may care more about the other factors. For example, young people may not mind traveling longer if they save a few dollars, but people in their 40’s may be more concerned about their time. Some of this information may be extracted from an image of the user. Note that this factor allows to define a more personalized function, since different users might end up with different satisfaction values for identical rides.

3.2 Payment Function for the Last Mile Problem

Given passengers and their destinations, who travel in a single vechile, an assignment determining the drop-off path (i.e. the order of which the passengers are dropped-off), the time it takes to reach each destination under this assignment (), the total cost of the ride-shared trip, and the cost () and travel time () that each of the passengers would have encountered had they traveled alone, the payment function determines how much each passenger must pay () when all passengers share the ride. We define the following axioms on the payment function:

  1. The aggregated payment from all passengers should exactly cover the cost of the trip.

  2. passengers traveling to the same destination split the trip cost equally.

  3. Given two passengers with the same distance from the source, the passenger who is dropped off second should pay less than the passenger who was dropped off first.

  4. Given a passenger that is ”on the way” to another passenger, both passengers should pay strictly less than what they would pay had they traveled alone (even though, both passengers do not travel any longer).

The following payment schedule satisfies all the axioms above: Let , we define the user’s gain (given an assignment ) as:

(1)

If we define the inconvenience of a user, , as (and similarly, is ), Equation 1 can be simplified to . The payment schedule sets such that all passengers traveling in the same ride have the same , and the sum of equals the cost of the whole ride. Equation 1 implies a simplified view of human behavior with the single concept of “time is money”, and it further assumes a linear relation between the two.

4 Satisfaction Model Learned from Humans

In order to develop a more realistic human satisfaction model, we use machine learning techniques based upon data collected from humans. To this end, we solicited human subjects from Mechanical Turk to obtain satisfaction level data. Based on this data, we use deep learning to build a satisfaction model.

4.1 Data Collection

The subjects were first asked to provide the following personal details: year of birth, gender and whether they were employed or unemployed.

Our satisfaction model tries to predict the relative satisfaction, that is, how much a passenger traveling by shared-ride is more or less satisfied than the same passenger traveling in a private ride. However, asking users to provide their relative satisfaction is unrealistic, and we thus split every travel scenario into two sub-parts. In the first part we asked the subjects to determine their satisfaction level from a direct private ride to some destination. In the second part the subjects were asked to determine their satisfaction level from a shared ride to the same destination. Specifically, in the first part of each scenario we described a direct private ride with a given time (random number between 5 minutes and one hour) and price (dollar per minute). In the second part of each scenario we described a shared ride to the same destination, where we varied the travel time and cost. Travel time of a shred ride can never be shorter than a direct private ride, and we thus uniformly sampled a number from and multiplied it by the direct private travel time. The cost of a shared ride should be lower than the cost of a direct private ride. In the optimal sharing scenario, assuming a 4 passenger vehicle (excluding the driver), there could be 4 passengers traveling to the same destination; in this case the cost will be reduced by a factor of 4. We thus divided the direct private ride’s cost by a number uniformly sampled from . In addition, we randomly sampled the number of additional passengers from , and we randomly sampled the user’s seat from front passenger, middle back, right back, left back. The subjects could choose one of seven satisfaction levels on a Likert scale, between very satisfied (7) to very dissatisfied (1) with the middle being ‘neither satisfied nor dissatisfied’ (4).

Each subject was asked a total of six travel scenarios (each with a private and a shared ride). In order to eliminate subjects that may be selecting satisfaction levels at random, we added two sanity check scenarios. In these scenarios the cost of the shared ride was more expensive than the private ride. Since it is unreasonable for a person to be more satisfied with a shared ride, being both longer and more expensive, we have disqualified any subject who expressed her satisfaction in this question to be higher than her satisfaction from the private ride of that scenario. subjects failed one of these sanity tests, and were removed from our analysis.

subjects refused to answer the personal questions and were eliminated from our analysis as well. Of the remaining subjects were females and were males. Their age ranged from to with an average of and a median of . were employed while were unemployed. Each of the subjects had scenarios, resulting with data-points. The average satisfaction for a private trip was and a shared ride was .

4.2 Deep-Learning Based Model

Using the collected data we consider deep learning based models with a varying depth to find a good satisfaction model, that is, a model that will accurately predict user satisfaction levels of a new user, based on different features of the user and the user trip. We split the data into train, validation (dev) and test sets. We use mean squared error to measure the performance of each model. The neural network depth varied from 1 (linear regression) to 4 (3 hidden layers). Each hidden layer consisted of

neurons. We used early stopping [Prechelt1998], i.e., we used the validation set to determine when to stop training. Table 1 presents the results obtained by each of these models. Since the 2-hidden layers model performed best, we use it as our satisfaction function, this model achieved a root mean squared error of on the test set. We set the satisfaction of a private ride to ‘neither satisfied nor dissatisfied’ (4).

Model Train-error Validation error
Linear regression 1.680 1.734
1 hidden layer 1.621 1.711
2 hidden layers 1.592 1.696
3 hidden layers 1.480 1.785
Table 1: Train and validation error for the different model depths. Values indicate the root mean squared error (RMSE) of each model.

5 Experimental Evaluation

In this section we present a stochastic algorithm for the last mile variant. We assume that there are a sufficiently large number of vehicles so that any request could be satisfied, and that the capacity of each vehicle is passengers. We compare the performance of our algorithm, in terms of user satisfaction, to an optimal algorithm that uses a simpler satisfaction function. We show that the algorithm outperforms the optimal algorithm, and that emphasizes the importance of capturing a rich model of human satisfaction.

5.1 Stochastic-Based Satisfaction Algorithm (Simsat)

We now present, a practical algorithm for assigning passengers to vehicles with the objective of maximizing the sum on user satisfaction: Simsat (Algorithm 1). Simsat runs Floyd-Warshell on the graph at the initialization, to obtain the minimal travel time between every two vertices. Simsat then runs its main procedure as follows. Simsat shuffles all passengers and assigns every passenger to the vehicle that maximizes the current satisfaction sum. For computing the total satisfaction of a single vehicle (the SatFunc function in Algorithm 1), we use the nearest neighbor algorithm (the greedy approach) for ordering the passengers drop-offs (based upon the Floyd-Warsell matrix). The main procedure is repeated multiple times () and the assignment that yields the maximal total satisfaction is selected. The complexity of Simsat is clearly . The number of times the main procedure is repeated can vary; the more times it is repeated the higher the expected performance. Therefore, Simsat is an any-time algorithm.

Input: A graph (Graph), with source vertex
Passenger destinations list (Passengers),
A satisfaction function that returns the total satisfaction of all passengers in a vehicle (SatFunc),
Result: An assignment of all passengers to vehicles.
Compute Floyd-Warshell on Graph;
MaxSum := 0;
for i:=0 to  do
       Shuffle Passengers;
       SatSum := 0;
       Clear CabList;
       for CurrentPassenger : Passengers do
             MAX := -1;
             for CurrentCab : CabList do
                   if CurrentCab not full then
                        CurrentSat := SatFunc(CurrentCab);
                         Add CurrentPassenger to CurrentCab;
                         SatWithCurPass = SatFunc(CurrentCab);
                         Remove CurrentPassenger from CurrentCab;
                         if (SatWithCurPass - CurrentSat) larger than MAX  then
                              OptimalCab := CurrentCab;
                               MAX := SatWithCurPass - CurrentSat
                         end if
                        
                   end if
                  
             end for
            if MAX 0 then
                   Add CurrentPassenger to newCab;
                   Add newCab to CabList;
                  
            else
                   Add CurrentPassenger to OptimalCab;
                   SatSum += MAX;
             end if
            
       end for
      if (SatSum MaxSum) then
            MaxSum := SatSum;
             OptimalFullAssignment := CabList;
       end if
      
end for
Algorithm 1 The Simsat algorithm

5.2 Optimal Algorithm

We use the following method to obtain the optimal assignment. First, the algorithm runs Floyd-Warshell on the graph. The algorithm then solves a coin-change problem ([Harris et al.2008, p. 171]) to obtain all possible ways to split the number of passengers into vehicles. For example, when , we get , , etc. For each splitting option the algorithm iterates over all possible assignments (we explicitly handle multiple vehicles with the same number of passengers, since it does not matter which group of passengers travels in which vehicle if they are in the same size). For example, for a group of , it first iterates over all assignments of 4 passengers (there are such assignments), then, recursively calls the assignment function with and the remaining passengers. The recursive call iterates over all possible assignments of three people to two vehicles and preforms a recursive call with the remaining vehicles and passengers. For each vehicle, the algorithm computes all possible options for dropping off its passengers (this is done once for each set of users), and, based upon the Floyd-Warshell matrix and the satisfaction model, selects the most efficient travel order.

5.3 Data

We considered two different types of graphs, a randomly generated graph and a more realistic graph, the city of Toulouse, France111obtained from https://www.geofabrik.de/data/shapefiles_toulouse.zip. The random graph was created by placing

vertices uniformly on the plane. We then randomly chose a pair of vertices, and connected them with an edge with a probability that is proportional to their distance. The weight of each edge was determined by the air-distance multiplied by a random number (uniformly sampled) between 1 and 2, to model topological variance. The graph of the city of Toulouse is presented in Figure

1. This graph includes the actual distances between the different vertices. We cropped the graph to vertices, by running Dijkstra algorithm starting at the airport, sorting all vertices by their distance from the airport, and removing all farther away vertices (including those that are unreachable).

Figure 1: A graph created from a map of the city of Toulouse, France.

5.4 Experimental Settings

Being a last mile problem, we set the origin vertex to be the same for all passengers. That is, in the random graph we randomly generated an origin vertex. In the city of Toulouse the graph includes the Toulouse-Blagnac airport, and it was used as the origin vertex. The destination vertices were randomly sampled for every passenger using a uniform distribution over all vertices.

In the payment schedule we set to and to for the gain function. and were set according to the average U.S. wage. That is, average annual hours worked per worker in U.S. at 2016 was 1783, and the average annual income in the U.S. per worker in 2016 was $31,099. Dividing the two we get $17.5 per hour, or approximately $0.3 per minute. We set the average speed to 60 kph, and the cost per travel distance to . We tested 5 assignment algorithms:

  1. The optimal algorithm with the full satisfaction function (developed in section 4).

  2. Simsat with the full satisfaction function.

  3. The optimal algorithm with simpler satisfaction functions:

    1. Travel cost only.

    2. Travel time only.

    3. Time and cost according to the payment function (that is, the gain function is used as a substitute for user satisfaction).

All the algorithms were evaluated with the complete satisfaction function developed in section 4, regardless of the function actually used by the assignment algorithm.

Figure 2: Average satisfaction for 6, 7, 8, 9 and 10 passengers when using a random graph.
Figure 3: Average satisfaction for 6, 7, 8, 9 and 10 passengers when using a map of the city of Toulouse, France.

5.5 Results

Figure 2 presents the average satisfaction for 6,7,8,9 and 10 passengers when using a random graph, and Figure 3 presents the results for the city of Toulouse. The results were obtained by averaging over samples of passenger destinations. The results for the optimal method using travel time only were omitted, as it constantly yields an average user satisfaction of (since it assigns a private vehicle to each and every passenger). As depicted in both figures, our satisfaction oriented assignment method (Simsat) obtains results that are quite close to the optimal assignment. Simsat’s average satisfaction level is much closer to the optimal assignment than that of the optimal assignments using a simpler user-satisfaction model. These results indicate that it is more important to obtain a richer model of user satisfaction, than improving the performance of the assignment algorithm. That being said, we do not disregard the importance of improving the performance of the assignment algorithm and do intend to pursue additional algorithms that may perform better.

6 Conclusions & Future Work

Ridesharing has a true potential for improving the quality of life for many people [Cici et al.2013], and it is part of the general concept of sharing economy that is being evolved nowadays. However, despite both Uber and Lyft offering ride-sharing options, not many users elect to share their rides with additional passengers [Koebler2016, RSG2017]. Following the statement by Carnegie [Carnegie1936, p. 37], ”There is only one way to get anybody to do anything. And that is by making the other person want to do it.”, we believe that the key ingredient required for a widespread adaptation of ridesharing is to focus on user satisfaction.

The importance of the paper lies in its being the first to exclusively concentrate on a rich and realistic function of user satisfaction as the objective, which is (arguably) the most important aspect to consider for achieving a widespread adaption of ridesharing services. We use deep learning to model user satisfaction based upon data collected from actual human subjects. We present a satisfaction oriented assignment method (Simsat), and show that it outperforms optimal assignments using a simpler user-satisfaction model. These results indicate that it is more important to obtain a richer model of user satisfaction, than improving the performance of the assignment algorithm.

In future work we intend to extend our model to the more general ridesharing schenario, where people may have different origins. We also intend to build a game that will simulate an actual ride for the subjects; this should allow us to obtain more exact satisfaction levels. This game could include additional travel information such as the other passengers in the trip, and allow the subject to select her seat when entering a vehicle. Since users will be playing the game more than once, the satisfaction model can be further improved by personalization, taking into account user’s feedback on previous rounds.

References

  • [Agatz et al.2012] Niels Agatz, Alan Erera, Martin Savelsbergh, and Xing Wang. Optimization for dynamic ride-sharing: A review. European Journal of Operational Research, 223(2):295–303, 2012.
  • [Campbell and Savelsbergh2005] Ann Melissa Campbell and Martin WP Savelsbergh. Decision support for consumer direct grocery initiatives. Transportation Science, 39(3):313–327, 2005.
  • [Carnegie1936] Dale Carnegie. How to win friends and influence people. Simon and Schuster, 1936.
  • [Cheng et al.2014] Shih-Fen Cheng, Duc Thien Nguyen, and Hoong Chuin Lau. Mechanisms for arranging ride sharing and fare splitting for last-mile travel demands. In AAMAS, pages 1505–1506, 2014.
  • [Cici et al.2013] Blerim Cici, Athina Markopoulou, Enrique Frías-Martínez, and Nikolaos Laoutaris. Quantifying the potential of ride-sharing using call description records. In Proceedings of the 14th Workshop on Mobile Computing Systems and Applications, page 17, 2013.
  • [Cordeau and Laporte2003] Jean-François Cordeau and Gilbert Laporte.

    A tabu search heuristic for the static multi-vehicle dial-a-ride problem.

    Transportation Research Part B: Methodological, 37(6):579–594, 2003.
  • [Dantzig and Ramser1959] G. B. Dantzig and J. H. Ramser. The truck dispatching problem. Management Science, 6(1):80–91, 1959.
  • [Diana et al.2006] Marco Diana, Maged M Dessouky, and Nan Xia. A model for the fleet sizing of demand responsive transportation services with time windows. Transportation Research Part B: Methodological, 40(8):651–666, 2006.
  • [El-Sherbeny2010] Nasser A El-Sherbeny. Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods. Journal of King Saud University-Science, 22(3):123–131, 2010.
  • [Fu and Teply1999] Liping Fu and Stan Teply. On-line and off-line routing and scheduling of dial-a-ride paratransit vehicles. Computer-Aided Civil and Infrastructure Engineering, 14(5):309–319, 1999.
  • [Guerra2016] Erick Guerra. Planning for cars that drive themselves: Metropolitan planning organizations, regional transportation plans, and autonomous vehicles. Journal of Planning Education and Research, 36(2):210–224, 2016.
  • [Harris et al.2008] John Michael Harris, Jeffry L Hirst, and Michael J Mossinghoff. Combinatorics and graph theory, volume 2. Springer, 2008.
  • [Jaw et al.1986] Jang-Jei Jaw, Amedeo R Odoni, Harilaos N Psaraftis, and Nigel HM Wilson. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research Part B: Methodological, 20(3):243–257, 1986.
  • [Koebler2016] Jason Koebler. Why everyone hates uberpool?, 2016.
  • [Lehuédé et al.2014] Fabien Lehuédé, Renaud Masson, Sophie N Parragh, Olivier Péton, and Fabien Tricoire. A multi-criteria large neighbourhood search for the transportation of disabled people. Journal of the Operational Research Society, 65(7):983–1000, 2014.
  • [Lin et al.2012] Yeqian Lin, Wenquan Li, Feng Qiu, and He Xu. Research on optimization of vehicle routing problem for ride-sharing taxi. Procedia-Social and Behavioral Sciences, 43:494–502, 2012.
  • [Molenbruch et al.2017a] Yves Molenbruch, Kris Braekers, and An Caris. Typology and literature review for dial-a-ride problems. Annals of Operations Research, 2017.
  • [Molenbruch et al.2017b] Yves Molenbruch, Kris Braekers, An Caris, and Greet Vanden Berghe. Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation. Computers & Operations Research, 77:58–71, 2017.
  • [Paquette et al.2009] Julie Paquette, Jean-François Cordeau, and Gilbert Laporte. Quality of service in dial-a-ride operations. Computers & Industrial Engineering, 56(4):1721–1734, 2009.
  • [Parragh et al.2008a] Sophie N. Parragh, Karl F. Doerner, and Richard F. Hartl. A survey on pickup and delivery problems. part I: Transportation between customers and depot. Journal für Betriebswirtschaft, 58(1):21–51, 2008.
  • [Parragh et al.2008b] Sophie N. Parragh, Karl F. Doerner, and Richard F. Hartl. A survey on pickup and delivery problems. part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft, 58(1):81–117, 2008.
  • [Parragh et al.2009] Sophie N Parragh, Karl F Doerner, Richard F Hartl, and Xavier Gandibleux. A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Networks, 54(4):227–242, 2009.
  • [Parragh et al.2014] Sophie N Parragh, Jorge Pinho de Sousa, and Bernardo Almada-Lobo. The dial-a-ride problem with split requests and profits. Transportation Science, 49(2):311–334, 2014.
  • [Prechelt1998] Lutz Prechelt. Automatic early stopping using cross validation: quantifying the criteria. Neural Networks, 11(4):761–767, 1998.
  • [Psaraftis et al.2016] Harilaos N Psaraftis, Min Wen, and Christos A Kontovas. Dynamic vehicle routing problems: Three decades and counting. Networks, 67(1):3–31, 2016.
  • [Psaraftis1980] Harilaos N Psaraftis. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science, 14(2):130–154, 1980.
  • [RSG2017] Rsg 2017 survey results: Driver earnings, satisfaction and demographics, 2017.
  • [Santos et al.2011] Adella Santos, Nancy McGuckin, Hikari Yukiko Nakamoto, Danielle Gray, and Susan Liss. Summary of travel trends: 2009 national household travel survey. Technical report, 2011.
  • [Schilde et al.2011] Michael Schilde, Karl F Doerner, and Richard F Hartl. Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers & operations research, 38(12):1719–1730, 2011.
  • [Secomandi and Margot2009] Nicola Secomandi and François Margot. Reoptimization approaches for the vehicle-routing problem with stochastic demands. Operations research, 57(1):214–230, 2009.
  • [Secomandi2000] Nicola Secomandi. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Computers & Operations Research, 27(11):1201–1225, 2000.
  • [Shen et al.2016] Bilong Shen, Yan Huang, and Ying Zhao. Dynamic ridesharing. SIGSPATIAL Special, 7(3):3–10, 2016.
  • [Wallsten2015] Scott Wallsten. The competitive effects of the sharing economy: how is uber changing taxis? Technology Policy Institute, 22, 2015.
  • [Yang et al.2013] Jianjie Yang, Jin Li, Yun Chen, Xintong Liu, et al. Multi-objective distribution model and algorithm for online shopping express logistics. JCP, 8(10):2558–2564, 2013.