We address a routing problem where a vehicle with limited time, loading capacity and battery autonomy can optionally serve a set of customers, each providing a profit. Such a problem is of particular relevance both because of its practical implications in sustainable transportation and its use as a sub-problem in Green Vehicle Routing column generation algorithms. We propose a dynamic programming approach to obtain both primal and dual bounds to the value of the optimal solutions, a fast greedy heuristics and a very large scale neighbourhood search procedure.
Heuristics for a green orienteering problem / S. Basso, M. Casazza, A. Ceselli - In: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2017[s.l] : University of Cologne, 2017. - pp. 1-4 (( Intervento presentato al 15. convegno 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2017 tenutosi a Cologne nel 2017.
|Titolo:||Heuristics for a green orienteering problem|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
Settore MAT/09 - Ricerca Operativa
|Data di pubblicazione:||2017|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|