DETERMINING ROUTE USING GENETIC ALGORITHM IN VEHICLE ROUTING PROBLEM TIME WINDOW IN PT.XYZ TO MINIMAZE DELAY
MUHAMMAD SAPTA RENGGA ROSYADI

Informasi Umum

Kode

19.04.184

Klasifikasi

658.72 - Procurement, Acquisition of equipment, materials, parts, subassemblies, supplies, tools, Procurement of office equipment and supplies

Jenis

Karya Ilmiah - Skripsi (S1) - Reference

Subjek

Supply Chain Management

Dilihat

48 kali

Informasi Lainnya

Abstraksi

PT XYZ is a distributor operated in the food industry, particularly rice. The location of distribution center is in the eastern region of West Java, Cirebon. PT XYZ don’t sell their product directly to end user and distributes goods to several retailers spread across eastern West Java, such as Cirebon area, Majalengka, and Indramayu. They have 19 customers in Cirebon. There is problem where customers demand can’t be fulfilled. This problem caused by several problem. The problem is most often caused by delays. Its because PT XYZ miscalculated when determining product delivery route. Therefore travel distance and time travel become longer. The problem contained in PT XYZ can be solved by Vehicle Routing Problem (VRP) that determination of vehicle route with various constraint. In this research have constraint that is service time of customer or time window and capacity of vehicle. To solve this VRP problem using nearest neighbor to find initial population, and optimized using Genetic Algorithm. The result of VRP using genetic algorithm can minimize 17.6% delay from existing condition. Keywords: Transportation, Vehicle Routing Problem, Time Window, Nearest Neighbor Algorithm, Genetic Algorithm

Koleksi & Sirkulasi

Seluruh 1 koleksi sedang dipinjam

Pengarang

Penerbit

Sirkulasi

Download / Flippingbook