Model Optimisasi untuk Permasalahan Rute Kendaraan dengan Adanya Penjadwalan

Abstract

Vehicle Routing Problem (VRP) is one of the important issues in the logis- tics system. The VRP problem is a combinatorial optimization problem that is covered by the NP (Hard Problem) NP problem. The scheduling factor for fleet use, driver scheduling and delivery process scheduling increases the combinatorial nature of VRP, which results in increasing the level of difficulty both in terms of modeling and problem solving. This study aims to develop a vehicle routing problem model to find the optimal route used by the vehicle fleet that starts at the central depot in order to meet and satisfy customer demand. This study pro- duces an optimization model for VRP problems that includes scheduling, as well as methods for solving the optimization model.