Penyelesaian open vehicle routing problem menggunakan metode heuristik

Abstract

This research is study of literature from the journal entitled A Heuristic Method for The Open Vehicle Routing Problem prepared by D Sariklis and S Powell in 2000. The issue is about management of goods distribution with a vehicle route that starts from the depot and stopped at the end customer, the vehicle is not required to return to the depot and each customer is visited by exactly one vehicle and its demand is totally satisfied. The objective is to generate the set of route that minimize the total travelling cost. This problem is an open problem to be solved using heuristic methods. The heuristic methods used in this study using Prim’s algorithm to find minimum spanning tree (MST) and the penalty method to modify the MST in order to form a chain. The heuristic methods are used to generate the set of routes that form a chain.