PENYELESAIAN MASALAH RUTE KENDARAAN DENGAN TIME WINDOWS MENGGUNAKAN METODE PEMBANGKITAN KOLOM; ( SOLVING THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS USING COLUMN GENERATION METHOD )

PURWANINGSIH, VITRIYANI TRI, Indarsih

2016 | Skripsi | FMIPA

In this paper, we will explain about the vehicle routing problem with time windows. Vehicle routing problem with time windows (VRPTW) is a problem to find feasible path that will be passed by each vehicle with take the time limits and vehicle load capacity. The purpose of the VRPTW problem is to minimize the distance traveled by the vehicle with time constraints of customers through the feasible path. VRPTW problem will be formulated as a binary integer programming problem. Furthermore, VRPTW will be decomposed into master problem and subproblem. Assumed that all types of vehicles are homogeneous and using hard time windows on this VRPTW problem. Method to be used to solve the problem VRPTW is column generation. The method will look for a solution of the restricted master problem and approach the pricing problem, that is minimum reduced cost to find feasible paths that will be raised. The optimal solution is obtained when there is no longer a path that may be selected as the optimal route for the vehicle.

Kata Kunci : N