Performance Analysis of Greedy-based Construction Heuristics on Classical Vehicle Routing Problem

Vehicle Routing Problem (VRP) has been studying in the past 60 years, many versions of basic VRP has also been extended. In this paper, we introduce and design some greedy-based construction heuristics to obtain better initial feasible solutions for some classical VRP with time windows (VRPTW). This construction heuristics include basic greedy heuristics (BG), global K-greedy heuristics (GKG), random greedy heuristics (RG) and random K-greedy heuristics (RKG). At last the performance analysis of these heuristics is given about basic VRPTW and VRPTW with roaming delivery locations (VRPTW-RDL). Some interesting conclusions is given.