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

Abstract

Vehicle Routing Problem (VRP) has many applications in real systems, especially in distribution and transportation. The optimal determination of vehicle routes impacts increasing economic interests. This research aims to find the optimal solution in Vehicle Routing Problem Pick-up and Delivery with Time Windows (VRPPDTW). Targets of this problem included reducing distance travel and penalties. Three penalties that were considered are a capacity penalty, opening time capacity, and closing time capacity. An improved genetic algorithm was developed and used to determine the vehicle route. There were one main depot and 42 customers. This research raised the problem of a shipping and logistics company. Analysis of the results showed that the proposed route obtained from improved genetic algorithms (GA) was better than the existing route and previous algorithm. Besides, this research was carried out an analysis on the effect of the number of iterations on distance traveled, the number of penalties, and the fitness value. This algorithm could be applied in VRPPDTW and produces an optimal solution.

Keywords

• vrppdtw
• routing
• pickup and delivery
• time windows
• genetic algorithm