Optimization Model for Electric Vehicle Routing Problem with Two Charging Options

Abstract

The use of electric vehicles recently is an alternative way to lower pollutants and the emissions of carbon dioxide resulting from the usage of motor vehicle fuel oil. The limited battery capacity of this electric vehicle is a problem for its users. Vehicle routing problem (VRP) is a problem of integer programming and combinatorial optimization that is frequently used in planning and decision-making processes. One application of this issue is to find the best path for delivering items from a corporation to customers. VRP problems are frequently utilized in order to reduce internal expenditure. Model optimization in this paper uses two rehcarging options, recharging and swapping battery. The purpose of this paper is to present a VRP optimization model for electric vehicle routing problems to find the best route option that minimizes the total of the fees for fixed vehicles, transit, charging, battery changing, and waiting.