What is Genetic operator

This chapter addresses the family of problems known in the literature as Capacitated Vehicle Routing Problems (CVRP). A procedure is introduced for the optimization of a version of the generic CVRP. It generates feasible clusters and, in a first step, yields a coding of their ordering. The next stage provides this information to a genetic algorithm for its optimization. A selective pressure process is added in order to improve the selection and subsistence of the best candidates. This arrangement allows improving the performance of the algorithm. We test it using Van Breedam and Taillard's problems, yielding similar results as other algorithms in the literature. Besides, we test the algorithm on real-world problems, corresponding to an Argentinean company distributing fresh fruit. Four instances, with 50, 100, 150 and 200 clients were examined, giving better results than the current plans of the company.