A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The Vehicle Routing Problem (VRP) is one of the well-known NP hard problems requiring excessive time to be exactly solved. Therefore, for solving this type of problems, some researchers implemented meta-heuristics such as Genetic Algorithm (GA). In this paper, we study the Capacitated VRP (CVRP) which has some constraints on the capacities of the vehicles used in VRP. The goal of this study is to observe the impact of the selected operators of GA on the quality of the generated solutions.doi:10.13189/ujes.2016.040301 fatcat:uns3df7xnvcwta5t2nvkivv7jy