A Solution to Multi Capacitated Depot Vehicle Routing Problem with Pickup and Delivery Customers and Soft Time Window using Genetic Algorithm

This paper presents a genetic algorithm for multi capacitated depot vehicle routing problem with pickup and delivery customers and soft time window (MCD-VRPPD-STW). MCD-VRPPD-STW is an expansion of VRP problems. In this problem routes are constructed in a way that vehicles gather the requests and deliver them to the customer as no customer remains without providing service. Routes are serviced by homogeneous vehicles in a way that all transportation demands are gathered and delivered to the customers. What makes this problem special is the capacity that is considered for each depot. Each depot has a capacity and the capacities of depots are not same as each other. In the scheduling process, problem constraints (soft time window constraint, capacity constraint of depots and capacity constraints of vehicles) are satisfied. A Genetic Algorithm is provided to solve the proposed problem with new constraints. The algorithm is then implemented by MATLAB and the calculation results are presented.