A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem

Abstract

In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and a driver can carry multiple riders. We propose a pre-processing procedure to reduce the size of the problem, and devise a decomposition algorithm to solve the original ride-matching problem to optimality by means of solving multiple smaller problems. We conduct extensive numerical experiments to demonstrate the computational efficiency of the proposed algorithm and show its practical applicability to reasonably-sized dynamic ride-matching contexts. Finally, in the interest of even lower solution times, we propose heuristic solution methods, and investigate the trade-offs between solution time and accuracy.

Cited by in corpus (9)

• Route-cost-assignment with joint user and operator behavior as a many-to-one stable matching assignment game
• The Internet of Federated Things (IoFT): A Vision for the Future and In-depth Survey of Data-driven Approaches for Federated Learning
• A generalized ride-matching approach for sustainable shared mobility
• A bilevel approach for compensation and routing decisions in last-mile delivery
• An algorithm for integrating peer-to-peer ridesharing and schedule-based transit system for first mile/last mile access
• Eco-Mobility-on-Demand Fleet Control with Ride-Sharing
• Modeling Ride-Sourcing Matching and Pickup Processes based on Additive Gaussian Process Models
• Ridesharing in the era of Mobility as a Service (MaaS): An Activity-based Approach with Multimodality and Intermodality
• An Optimization Framework for the Time-Dependent Electric Vehicle Routing Problem with Shared Mobility: A Step Toward Smart Cities