An evolutionary approach to solve the dynamic multihop ridematching problem

Cheikh, Sondes Ben; Tahón, Christian; Hammadi, Slim

doi:10.1177/0037549716680025

Cited by 10 publications

(3 citation statements)

References 19 publications

(54 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A dynamic multi-hop ride-matching problem is introduced and solved using a metaheuristic approach based on controlled genetic operators [63]. Apart from the ridesharing system that featured meeting points and multiple hops, in [64] a multi-hop ridesharing system that incorporates meeting points is proposed.…”

Section: Many-to-many Ridesharing Problemmentioning

confidence: 99%

Shared Mobility Problems: A Systematic Review on Types, Variants, Characteristics, and Solution Approaches

et al. 2021

View full text Add to dashboard Cite

The Shared Mobility Problems (SMP) with the rideshare concept based on sharing a vehicle are fast becoming a trend in many urban cities around the world. Examples of these problems are like ridesharing, carpooling, taxisharing, buspooling, vanpooling, and multi-modal ridesharing. This is the new way to access transportation services by those who are propelling the sharing economy, where access rather than ownership is the new norm. This paper provides a systematic review of SMP using the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analysis) method. A total of 110 papers from the last decade are selected from 12 abstracts and citation databases to be reviewed and classified. This is done based on the problem types, variants, characteristics, and solution approaches. The current trends and analysis of the survey findings are also summarised. From this systematic review, it is observed that both the time window and multi-objective problems are popular among the researchers, while the minimisation of the total cost is the main concern in the literature of the SMP. Both static and dynamic cases of the SMP are the most researched where heuristic and metaheuristic approaches are widely adopted by the researchers in the literature. Finally, challenges and suggestions for future work are discussed and highlighted.

show abstract

Section: Many-to-many Ridesharing Problemmentioning

confidence: 99%

Shared Mobility Problems: A Systematic Review on Types, Variants, Characteristics, and Solution Approaches

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Also, in [13], a solution to a multiple-driver multiple-rider ride-matching using a genetic algorithm and ant-colony optimization is proposed. Ben Cheikh et al [20] also present an evolutionary algorithmic approach to solve the multi-hop ridesharing problem.…”

Section: Multi-hop Ridesharingmentioning

confidence: 99%

SRide: An Online System for Multi-Hop Ridesharing

2020

View full text Add to dashboard Cite

In the context of smart cities, ridesharing in urban areas is gaining researchers’ interest and is considered to be a sustainable transportation solution. In this paper, we present SRide (Shared Ride), a multi-hop ridesharing system as a mode of sustainable transportation. Multi-hop ridesharing is a type of ridesharing in which a rider travels in multiple hops to reach a destination, transferring from one driver to another between hops. The key problem in multi-hop ridesharing is to find an optimal itinerary or route plan for a rider from an origin to a destination in a dynamic, online setting. SRide adopts a novel approach to finding itineraries for riders suited to the online nature of the problem. The system represents ride offers as a time-dependent directed graph and finds itineraries dynamically by updating the graph incrementally and decrementally as ride offers are updated in the system. The system’s distinguishing feature is its incremental and decremental operation, which is enabled by employing dynamic single-source shortest-path algorithms. We conducted two extensive simulation studies to evaluate its performance. Metrics, including the matching rate, savings in total system-wide vehicle-miles, and total system-wide driving times were measured. In the first study, SRide’s dynamic update algorithms were compared with their non-dynamic versions. Results show that SRide’s algorithms run up to thirteen times faster than their non-dynamic versions. In the second study, we used data from the travel demand model for metropolitan Atlanta in the US state of Georgia, to assess the benefits of multi-hop ridesharing. Results show that matching rates increase up to 68%, saving in total system-wide vehicle-miles of up to 12%, and reduction in the total system-wide driving time of up to 12.86% is achieved.

show abstract

“…Moreover, in our previous related papers (17) and (16), we have proposed an evolutionary approach to man-age the real time multi-hop ridematching issue, where assignments are handled by an independent mechanism. By contrast, in the present Tabu Search based Methaheuristc, the assignments' process is a part of the global optimization algorithm and passengers are assigned on an as-needed.…”

Section: Introductionmentioning

confidence: 99%

A Tabu Search based metaheuristic for dynamic carpooling optimization

Cheikh-Graiet

Dotoli

Hammadi

2020

Computers & Industrial Engineering

Self Cite

View full text Add to dashboard Cite

The carpooling problem consists in matching a set of riders' requests with a set of drivers' offers by synchronizing their origins, destinations and time windows. The paper presents the so-called Dynamic Carpooling Optimization System (DyCOS), a system which supports the automatic and optimal ridematching process between users on very short notice or even en-route. Nowadays, there are numerous research contributions that revolve around the carpooling problem, notably in the dynamic context. However, the problem's high complexity and the real time aspect are still challenges to overcome when addressing dynamic carpooling. To counter these issues, DyCOS takes decisions using a novel Tabu Search based metaheuristic. The proposed algorithm employs an explicit memory system and several original searching strategies developed to make optimal decisions automatically. To increase users' satisfaction, the proposed metaheuristic approach manages the transfer process and includes the possibility to drop off the passenger at a given walking distance from his destination or at a transfer node. In addition, the detour concept is used as an original aspiration process, to avoid the entrapment by local solutions and improve the generated solution. For a rigorous assessment of generated solutions , while considering the importance and interaction among the optimization criteria, the algorithm adopts the Choquet integral operator as an aggregation approach. To measure the effectiveness of the proposed method, we develop a simulation environment based on actual carpooling demand data from the metropolitan area of Lille in the north of France.

show abstract

An evolutionary approach to solve the dynamic multihop ridematching problem

Cited by 10 publications

References 19 publications

Shared Mobility Problems: A Systematic Review on Types, Variants, Characteristics, and Solution Approaches

Shared Mobility Problems: A Systematic Review on Types, Variants, Characteristics, and Solution Approaches

SRide: An Online System for Multi-Hop Ridesharing

A Tabu Search based metaheuristic for dynamic carpooling optimization

Contact Info

Product

Resources

About