Model Optimasi Vehicle Routing Problem pada Masalah Perutean Kendaraan Listrik dengan Time Windows, Recharging Stations dan Battery Swapping Stations

Abstract

The use of electric vehicles recently is an alternative solution to reduce pollution and carbon emissions due to the use of motor vehicle fuel oil. 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 various planning and decision-making processes, such as when deciding on the best route to take when delivering items from a business to customers. The only objective of VRP problems is frequently to reduce internal expenses. This paper’s goal is to propose a VRP optimization model for electric vehicle routing difficulties in order to determine the best possible routing option that minimizes the total of fixed vehicle expenses, transit costs, charging costs, battery swapping costs, and time window penalties.