Editor’s Pick – An Evolutionary Approach to Solve The Dynamic Multihop Ridematching
Sondes Ben Cheikh1, Christian Tahon2 and Slim Hammadi1
Abstract
The multihop ridesharing system generates a ridematching solution with an arbitrary number of transfers that respects personal preferences of the users and their time constraints with detour willingness. As it is considered to be NP-complete, an efficient metaheuristic is required in the application to solve the dynamic multihop ridematching problem. In this context, a novel approach, called Metaheuristics Approach Based on Controlled Genetic Operators (MACGeO), which is supported by an original dynamic coding, is developed to address the multihop ridematching problem. The performance of the proposed approach is measured via simulation scenarios, which feature various numbers of carpool drivers (vehicles) and riders (passengers). Experimental results show that the multihop ridematching could greatly increase the number of matched requests while minimizing the number of vehicles required.
Recent Posts
- Chapter Summary Report from SCS Beihang Student Chapter
- SCS Welcomes Dr. Gabriel Wainer as the New Editor-In-Chief of SIMULATION: Transactions of the Society for Modeling and Simulation International
- Forecasting Violent Events in the Middle East and North Africa Using the Hidden Markov Model and Regularized Autoregressive Models
- Misinformation Making a Disease Outbreak Worse: Outcomes Compared for Influenza, Monkey Pox, and Norovirus
- Assessing the Cognitive Complexity of Cyber Range Environments
Categories
Archives
- August 2021
- March 2021
- August 2020
- April 2020
- February 2020
- October 2019
- May 2019
- October 2018
- March 2018
- February 2018
- December 2017
- November 2017
- October 2017
- September 2017
- August 2017
- July 2017
- April 2017
- March 2017
- December 2016
- November 2016
- September 2016
- August 2016
- June 2016
- April 2016
- May 2015