Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
