A Ride-Sharing Problem with Meeting Points and Return Restrictions

  title={A Ride-Sharing Problem with Meeting Points and Return Restrictions},
  author={Wenyi Chen and M. Mes and J. M. Schutten and Job Quint},
  journal={Transp. Sci.},
Ride sharing has been widely acknowledged as an effective solution for reducing travel costs, congestion, and pollution. This paper considers the ride-sharing problem of the scheduled commuter and ... 
Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions
As a consequence of the sharing economy attaining more popularity, there has been a shift toward shared-use mobility services in recent years, especially those that encourage users to share their p...
The Customer is Always Right: Customer-Centered Pooling for Ride-Hailing Systems
It is proved that it is individually rational and weakly dominant for a customer to participate in CCP, but not for PCP, and it is shown that pooling can benefit all stakeholders in on-demand transportation. Expand
Modeling and solving the multimodal car- and ride-sharing problem
A two-layer decomposition algorithm based on column generation is proposed, where the master problem ensures that each request can only be covered at most once, and the pricing problem generates new promising routes by solving a kind of shortest path problem in a time-space network. Expand
Designing a ride-sharing transportation system for assignment and transfer of passengers to a common destination
A numerical example is implemented on the model to evaluate the applicability of the model which indicates the efficiency of employing fuzzy programming and considering both of the objective functions using goal programming. Expand
Real-world meeting points for shared demand-responsive transportation systems
This paper presents a three-step workflow for solving the SDRT problem with meeting points (SDRT-MP), where customers are clustered into similar groups, then meeting (and divergence) points are determined for each cluster. Expand
Crowdsourcing Incentives for Multi-Hop Urban Parcel Delivery Network
This paper proposes to crowdsource the parcel delivery task to urban vehicles to utilize their spare capacities, thus improving the efficiency while reducing traffic congestions. Expand
Planning of truck platoons: A literature review and directions for future research
This paper provides a framework to classify various new transportation planning problems that arise in truck platooning, surveys relevant operations research models for these problems in the literature and identifies directions for future research. Expand
Planning of Truck Platoons: A Literature Review and Directions for Future Research
A truck platoon is a set of virtually linked trucks that drive closely behind one another using automated driving technology. Benefits of truck platooning include cost savings, reduced emissions, andExpand
A Mutual Selection Mechanism of Ride-Hailing Based on Hidden Points
The mutual selection mechanism proposed has improved user satisfaction by 5%-21% compared to the traditional methods of order-snatching mechanism and order-sending mechanism, which has significantly improved passenger satisfaction and solved the problem that the existing platform cannot meet the passengers’ individual travel needs. Expand
Self-organized carpools with meeting points
These findings, along with the introduction of a new efficient carpool enumeration technique, have important practical implications for the design of modern carpooling systems in the development of more effective and sustainable uses of transportation resources. Expand


Optimization for dynamic ride-sharing: A review
This paper systematically outline the optimization challenges that arise when developing technology to support ride-sharing and survey the related operations research models in the academic literature. Expand
The benefits of meeting points in ride-sharing systems
We investigate the potential benefits of introducing meeting points in a ride-sharing system. With meeting points, riders can be picked up and dropped off either at their origin and destination or atExpand
The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta
Simulation results indicate that the use of sophisticated optimization methods instead of simple greedy matching rules substantially improve the performance of ride-sharing systems, and it appears that sustainable populations of dynamic ride- sharing participants may be possible even in relatively sprawling urban areas with many employment centers. Expand
A Priori Approach Of Real-Time Ridesharing Problem With Intermediate Meeting Locations
The core of a new strategy of the ridesharing system is presented, allowing the driver and the rider to meet each other at an intermediate starting location and to separate at another intermediate ending location not necessarily their origins and destinations, respectively to reduce both the driver's detour and the total travel cost. Expand
Ridesharing: The state-of-the-art and future directions
Although ridesharing can provide a wealth of benefits, such as reduced travel costs, congestion, and consequently less pollution, there are a number of challenges that have restricted its widespreadExpand
Multi-Hop Ride Sharing
This work engineer the ride sharing problem by searching a graph that represents a timetable network similar to those used for train networks and achieves about an order of magnitude higher speedups over Dijkstra’s algorithm than what could be expected from previous work. Expand
Dynamic ridesharing: Is there a role for dedicated drivers?
Growing congestion is a problem faced by cities around the world. Traditional solutions considered include new capital works to increase network capacity and expanding public transport offerings toExpand
Car and Ride Sharing Concept as a Product Service System – Simulation as a Tool to Reduce Environmental Impacts
Automotive road traffic makes up a substantial part of environmental impacts. Efficient road traffic is only possible with an integrated approach decreasing the number of used cars for the distanceExpand
Evolutionary Multiobjective Route Planning in Dynamic Multi-hop Ridesharing
This work presents an evolutionary multiobjective route planning algorithm for solving the route planning problem in the dynamic multi-hop ridesharing and indicates that the evolutionary approach is able to provide a good quality set of route plans and outperforms the generalized label correcting algorithm in term of runtime. Expand
The ridematching problem with time windows in dynamic ridesharing: A model and a genetic algorithm
Experation results indicate that the idea of dynamic ridesharing is feasible and the proposed algorithm is able to solve the ridematching problem with time windows in reasonable time. Expand