Authors:
Elhem Elkout
1
;
2
;
Houssem Eddine Nouri
3
;
2
and
Olfa Belkahla Driss
4
;
2
Affiliations:
1
Ecole Nationale des Sciences de l’Informatique, University of Manouba, Tunisia
;
2
LARIA UR22ES01, Ecole Nationale des Sciences de l’Informatique, University of Manouba, Tunisia
;
3
Institut Supérieur d’Informatique et de Gestion de Kairouan, University of Kairouan, Tunisia
;
4
Ecole Supérieure de Commerce de Tunis, University of Manouba, Tunisia
Keyword(s):
Green Transport, Green Share-A-Ride Problem, Simulated Annealing, Crossover Operator, Multi-Agent.
Abstract:
This research addresses the Green share-a-ride problem (Green-SARP), which is an extension of the share-a-ride problem (SARP) by considering a limited driving range of vehicles in combination with limited refueling infrastructure. The goal of Green-SARP is to remove the possibility of a vehicle running out of fuel during a route by allowing refueling at any alternative fuel station. In this work, we present a new simultaneous Simulated Annealing-based Crossover within a Multi-Agent model (SAC-MA) to solve Green-SARP. In fact, adding to the neighbor operators, the crossover operator is integrated to diversify the search allowing to explore new areas in the search space. Experimental studies are carried out in order to evaluate the performance of our approach, based on new generated data instances, allowing to show its efficiency compared to a Simulated Annealing algorithm (SA).