|dc.description.abstract||Ridesharing services, whose aim is to gather travelers with similar itineraries and compatible schedules, are able to provide substantial environmental and social benefits through reducing the use of private vehicles. When the operations of a ridesharing system is optimized, it can also save travelers a significant amount of transportation cost. The economic benefits associated with ridesharing in turn attract more travelers to participate in ridesharing services and thereby improve the utilization of transportation infrastructure capacity.
This study addresses two of the most challenging issues in designing an efficient and sustainable ridesharing service: ridesharing optimization and ridesharing market design. The first part of the dissertation formally defines the large-scale ridesharing optimization problem, characterizes its complexity and discusses its relation to classic relevant problems like the traveling salesman problem (TSP) and the vehicle routing problem (VRP). A mixed-integer program (MIP) model is developed to solve the ridesharing optimization problem. Since the ridesharing optimization problem is NP-hard, the MIP model is not able to solve larger instances within a reasonable time. An insertion-based heuristic is developed to get approximate solutions to the ridesharing optimization problem. Experiments showed that ridesharing can significantly reduce the system-wide travel cost and vehicle trips. Evaluation of the heuristic solution method showed that the heuristic approach can solve the problem very fast and provide nearly-optimal (98%) solutions, thus, confirming its efficiency and accuracy.
From a societal perspective, the ridesharing optimization model proposed in this dissertation provided substantial system-wide travel cost saving (25%+) and vehicle-trip saving (50%) compared to non-ridesharing situation. However, the system-level optimal solution might not completely align with individual participant interest. The second part of this dissertation formulates this issue as a fair cost allocation problem through the lens of the cooperative game theory.
A special property of the cooperative ridesharing game is that, its characteristic function values are calculated by solving an optimization problem. We characterize the game to be monotone and subadditive, but non-convex. Several concepts of fairness are investigated and special attention is paid to a solution concept named nucleolus, which aims to minimize the maximum dissatisfaction in the system. However, finding the nucleolus is very challenging because it requires solving the ridesharing optimization problem for every possible coalition, whose number grows exponentially as the number of participants increases in the system. We break the cost allocation (nucleolus finding) problem into a master-subproblem structure and two subproblems are developed to generate constraints for the master problem. We propose a coalition generation procedure to find the nucleolus and approximate nucleolus of the game. When the game has a non-empty core, in the approximate nucleolus scheme the coalitions are computed only when it is necessary, and the approximate nucleolus scheme produces the actual nucleolus. Experimental results showed that, when the game has an empty core, the approximate nucleolus is close to the actual nucleolus. Results also showed that, regardless of the emptiness of the game, by using our algorithm, only a small fraction (1:6%) of the total coalition constraints were generated to compute the approximate nucleolus, and the approximate nucleolus is close to the actual nucleolus.||