Generating an initial solution for capacitated vehicle routing problem by using sequential insertion algorithm

Abstract

This research discussed about the extension of the Vehicle Routing Problem (VRP) called the Capacitated Vehicle Routing Problem (CVRP). CVRP deals with the distribution of goods between depots and customers restricted to a single capacity constraint. The main objective of this research is to construct, allocate and arrange customers among routes designed involving a fleet of homogeneous vehicles. Heuristic method, that is, the Sequential Insertion algorithm will be adapted in generating an initial solution to the problem. Our case study is to solve the CVRP involving 100 customers with limitation that every customers is visited by exactly once with only one vehicle where the total demand on each route must be within the vehicle's capacitylimit. Thus, coding of the Sequential Insertion algorithm based on the developed pseudocodes is completed by using the c++ Language Programming in order to generate the initial solution of the CVRP.