Efficient heuristic algorithms for location of charging stations in electric vehicle routing problems

Vista sencilla de ítem
dc.contributor.authorGatica, G.
dc.contributor.authorAhumada, G.
dc.contributor.authorEscobar, J.W.
dc.contributor.authorLinfati, R.
dc.date.accessioned2019-04-23T15:13:12Z
dc.date.available2019-04-23T15:13:12Z
dc.date.issued2018
dc.descriptionIndexación: Scopus.es_ES
dc.descriptionThis work has been partially supported by CONICYT FONDECYT by grant 11150370, FONDEF IT17M10012 and the “Grupo de Logística y Transporte” at the Universidad del Bío-Bío.. This support is gratefully acknowledged.
dc.description.abstractEco-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 article 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. © 2012-2018. National Institute for R and D in Informatics.es_ES
dc.description.urihttps://sic.ici.ro/wp-content/uploads/2018/03/Art.-8-Issue-1-2018-SIC.pdf
dc.identifier.citationStudies in Informatics and Control, 27(1), pp. 73-82es_ES
dc.identifier.issn1220-1766
dc.identifier.otherDOI: 10.24846/v27i1y201808
dc.identifier.urihttp://repositorio.unab.cl/xmlui/handle/ria/8577
dc.language.isoenes_ES
dc.publisherNational Institute for R and D in Informaticses_ES
dc.subjectElectric vehiclees_ES
dc.subjectHeuristicses_ES
dc.subjectK-meanses_ES
dc.subjectVRPes_ES
dc.titleEfficient heuristic algorithms for location of charging stations in electric vehicle routing problemses_ES
dc.typeArtículoes_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
Gatica_Efficient_Heuristic_Algorithms.pdf
Tamaño:
857.49 KB
Formato:
Adobe Portable Document Format
Descripción:
TEXTO COMPLETO EN INGLES
Descargar
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descripción:
Descargar
Colecciones
FIng - Artículos de Revista