Title
An Adaptive Large Neighborhood Search for relocating vehicles in electric carsharing services.
Abstract
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 profit, 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 bounding procedures to evaluate the solution quality when the optimal solution is not available.
Year
DOI
Venue
2019
10.1016/j.dam.2018.03.067
Discrete Applied Mathematics
Keywords
Field
DocType
One-way carsharing,Operator-based relocation,Profit optimization,Pick-up and delivery problem,Ruin and Recreate metaheuristic,Tabu search
Relocation,Discrete mathematics,Mathematical optimization,Integer programming,Mathematics,Tabu search,Metaheuristic,Large neighborhood search,Bounding overwatch
Journal
Volume
ISSN
Citations 
253
0166-218X
0
PageRank 
References 
Authors
0.34
21
3
Name
Order
Citations
PageRank
Maurizio Bruglieri111013.34
Ferdinando Pezzella2353.65
Ornella Pisacane311610.20