We propose an Adaptive Large Neighborhood Search metaheuristic to solve a vehicle relocation problem arising in the management of electric carsharing systems. The solution approach, aimed to optimize the total prot, is tested on three real-like benchmark sets of instances. It is compared with a Tabu Search, ad hoc designed for this work, with a previous Ruin and Recreate metaheuristic and with the optimal results obtained via Mixed Integer Linear Programming. We also develop a bounding procedure to evaluate the solution quality when the optimal solution is not available.
File in questo prodotto:
Non ci sono file associati a questo prodotto.