Minimizing capacity of Electric Vehicle Battery using Bottleneck Traveling Salesman Problem

Abstract

Electrical vehicle technology has now developed. Various public transportation can start using electric power sources. However, there are battery capacity constraints. When the distance is too far, the battery capacity is not sufficient to provide the required power. In this paper, we will explain how the bottleneck travel salesman problem is applied to minimize battery capacity requirements. So that vehicles can choose the right route by minimizing the maximum distance between destinations. The optimization process is carried out with the Brute Force algorithm and python programming language.