An Improved Genetic Algorithm for Vehicle Routing Problem Pick-up and Delivery with Time Windows

M. F. Ibrahim (a)* , M. M. Putri (a), D. Farista (a), D. M. Utama (b)
a Logistics Engineering Department, Universitas Internasional Semen Indonesia, Kompleks PT. Semen Indonesia (Persero) Tbk Jl. Veteran Gresik, Indonesia
b Industrial Engineering Department, Universitas Muhammadiyah Malang, Jl. Raya Tlogomas No. 246, Malang 65144, Indonesia
* Corresponding author: faisalibrahim.ie@gmail.com

ABSTRACT

Vehicle Routing Problems (VRP) have many applications in real systems, especially in distribution and transportation. The optimal determination of vehicle routes impacts increasing economic interests and expected logistical planning results. This research seeks to find the optimal solution in Vehicle Routing Problem Pick-up and Delivery with Time Windows (VRPPDTW). With targets including reducing mileage, travel time, and transportation costs by always paying attention to existing constraints. An improved genetic algorithm is developed and used to determine the vehicle route. There are one main depot and 42 branch offices scattered. This research raises the problem of a shipping and logistics company. Analysis of the results shows that the proposed route obtained from improved genetic algorithms (GA) is better in all aspects compared to the company's existing route and previous algorithm. Besides, this research carried out an analysis effect of the number of iterations on distance traveled, the number of penalties, and the fitness value. This algorithm can be applied in VRPPDTW and produces an optimal solution.

Keywords: VRPPDTW Routing Pick-up and Delivery Time Windows Genetic Algorithm

Full Paper: Download Full Paper

Plagiarism Check: Download Check Plagiarism

Peer Review: Download Peer Review

Bukti Korespondensi: Download Korespondensi