Masalah Penentuan Rute Kendaraan Antarjemput Roti

Abstract

Product distribution is one of important activitis for a company. In this paper we discussed a pickup and delivery problem in a company. The objective is to find an optimal route in the framework of vehicle routing problem with pickup and delivery with time windows (VRPPDTW). We provided an illustrative example which describes a pickup and delivery process in a bread company with 1 depot, 10 customers, and 7 units of vehicles. In the first stage we decided the minimum number of vehicles required. Then, in the second stage, we determined the route with minimum cost. LINGO 11.0 is utilized in solving the problem.