Algorithms for the location problem of electric vehicles charging stations

• Autor(a) principal: da Silva, Yngrith Soares
• Data de Publicação: 2019
• Outros Autores: Mestria, Mário
• Tipo de documento: Artigo
• Idioma: por
• Título da fonte: Revista Produção Online
• Texto Completo: https://www.producaoonline.org.br/rpo/article/view/3324
• topic: Electric vehicles. Optimization. Metaheuristics. Chemical Reaction Optimization. Greedy algorithm.; Veículos elétricos. Otimização. Metaheurística. Otimização por reações químicas. Algoritmo guloso.

The Problem of Location of Electric Vehicle Charging Stations (PLEVCS) is an important problem in transportation, logistics and involves the determination of an efficient network that guarantees for all customers to access its stations with the minimum travel distance. The problem is NP-hard and complex because involving a number of the constraints and the scale of real-world applications. Thus, the heuristic methods to solve the PLEVCS are fundamental and this paper presents algorithms using an adapted optimization model from the literature. The model selects a set of charging stations to place from the candidate location sites. The objective is to minimize the charging station fixed cost and the electric vehicles travel cost. The model was applied to a metropolitan region using straight-line and realistic trips. The results showed that the algorithms for the PLEVCS found feasible solutions at a low computational time. The proposed algorithms were performed on the existing literature database.