Dynamic programming for the electric vehicle orienteering problem with multiple technologies
Year: 2018
Type: conference-paper
Abstract: Motivation: the EVRPThe Electric VRP is usually defined with the following data:• a complete graph G = (V , R, E ), where• V is the set of customer vertices;• R is the set of recharge stations;• E is the set of edges (weighted, non oriented);• a special vertex 0 in R (the depot);• for each edge e ∈ E :• an amount of energy consumed de ;• a traveling time te ;• a demand q i for each i ∈ V ;• a service time s i for each vertex i ∈ V ∪ R;• the number of available vehicles, W ;• the vehicle capacity Q;• the maximum route duration T ;• the battery capacity B. The EVRP with multiple technologies: referencesWe consider the variation of the EVRP with• battery amortization (easy to handle);• partial recharges (makes the problem mixed-integer);• multiple technologies (makes the problem considerably harder).EVRP problem:• NP-
Authors: Dario Bezzi, Alberto Ceselli, Giovanni Righini
Institution: University of Milan
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3084500259
