Efficient heuristic algorithms for location of charging stations in electric vehicle routing problems
Cargando...
Archivos
Fecha
2019
Autores
Profesor/a Guía
Facultad/escuela
Idioma
en
Título de la revista
ISSN de la revista
Título del volumen
Editor
Universidad Andrés Bello
Nombre de Curso
Licencia CC
Licencia CC
Resumen
Eco-responsible transportation contributes at making a difference for companies
devoted to product delivery operations. Two specific problems related to operations
are the location of charging stations and the routing of electric vehicles. The first one
involves locating new facilities on potential sites to minimise an objective function
related to fixed and operational opening costs. The other one, electric vehicle routing
problem, involves the consolidation of an electric-type fleet in order to meet a
particular demand and some guidelines to optimise costs. It is determined by the
distance travelled, considering the limited autonomy of the fleet, and can be restored
by recharging its battery. The literature provides several solutions for locating and
routing problems and contemplates restrictions that are closer to reality. However,
there is an evident lack of techniques that addresses both issues simultaneously. The
present thesis offers four solution strategies for the location of charging stations and
a heuristic solution for fleet routing. The best results were obtained by applying the
location strategy at the site of the client (relaxation of the VRP) to address the
routing problem, but it must be considered that there are no displacements towards
the recharges. Of all the other three proposals, K-means showed the best
performance when locating the charging stations at the centroid of the cluster.
Notas
Tesis (Magíster en Ciencias de la Computación)
Palabras clave
Vehículos Eléctricos, Programación Heurística