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
- Assessing the Cognitive Complexity of Cyber Range Environments
- Toward reproducible disease models using the Systems Biology Markup Language
- The 2018 SCS Editor’s Choice Award has been Announced!
- Cyber threat assessment via attack scenario simulation using an integrated adversary and network modeling approach
- The protoscience of cybersecurity