Optimization model for electric vehicle routing problem

Recently, the usage of electric vehicles has emerged as a viable alternative to reducing pollution and carbon emissions caused by the burning of motor vehicle fuel. The limited battery capacity of this electric vehicle is a problem for its users. Vehicle routing problem (VRP) is an integer programming and combinatorial optimization issue that is frequently utilized in many planning and decision-making processes, such as when deciding on the best route to take when delivering goods from a business to customers. VRP issues are frequently used with the sole objective of reducing internal fees. The goal of this study is to offer a VRP optimization model for electric vehicle routing problems in order to identify the best possible routing solution that minimizes the total fee of the fixed vehicle, transit fee, charging fee, battery shifting fee, and time windows penalty.