Vehicle routing problem with pick-up and deliveries using genetic algorithm in express delivery services

Abstract

The Vehicle Routing Problem (VRP) is an extension of the Traveling Salesman Problem (TSP). It can be expanded into the vehicle routing problem with pick-up and delivery (VRP-PD). One of the current real problem is that there are drivers in various places to serve customers by picking up and shipping goods to/from their location within the same day. As this service gaining its popularity, more and more customers must be served making it necessary to determine the efficient and effective vehicle routes for simultaneous pickup and delivery activities. This study proposes a genetic algorithm-based approach to this problem. An example problem is conducted to assess its practicality before real problems application.The Vehicle Routing Problem (VRP) is an extension of the Traveling Salesman Problem (TSP). It can be expanded into the vehicle routing problem with pick-up and delivery (VRP-PD). One of the current real problem is that there are drivers in various places to serve customers by picking up and shipping goods to/from their location within the same day. As this service gaining its popularity, more and more customers must be served making it necessary to determine the efficient and effective vehicle routes for simultaneous pickup and delivery activities. This study proposes a genetic algorithm-based approach to this problem. An example problem is conducted to assess its practicality before real problems application.