Model Optimasi Vehicle Routing Problem dan Implementasinya

Abstract

A class of distribution of commodities problem can be modeled mathematically as a combinatorial optimization in the form of application of graph theory, namely Vehicle Routing Problem (VRP). VRP is a generalization of Travelling Salesman Problem (TSP), which can be described as the problem of designing routes of vehicles from a depot to a set of customers that minimized the total travel distance of vehicles. The routes must be started and ended at the depot, visited each customer only once by exactly one vehicle. VRP can be extended further by associating capacity of the vehicles, this class of problem is called Capacitated Vehicle Routing Problem (CVRP). The aims of this research are to formulate the model for distribution of commodities as a CVRP and to implement it for the distribution problem of Serambi Indonesia news paper in the area of Banda Aceh. This problem is solved by branch and bound method using LINGO 8.0 software. The results show that, optimal routes are shorter than the existing routes.