A Metaheuristic based on Non-Dominated Sorting Genetic Algorithm II, applied to the Vehicle Routing Problem of Perishable Products

This article presents a new algorithm based on non-dominated sorting genetic algorithm II (NSGA II) for the distribution of perishable products, which minimizes the number of damaged products and the total distance traveled in the delivery of these. Both algorithms were tested in instances of the literature of 50 and 100 clients, to evaluate the quality and efficiency of the same. From the analysis, it was obtained that the proposed algorithm has the capacity to generate better results comparing it with the NSGA II for instances of 50 clients. However, their solutions lose quality when the instances are 100 clients and the complexity of the problem increases. Therefore, the decision makers have now, as a tool, this comparison for the planning of routes of perishable products according to the number of clients. © 2019 Centro de Informacion Tecnologica. All rights reserved.