A complexity task of optimization in logistic distribution: A new approach to the green multi-objective vehicle routing problem

Logistic distribution involves many costs for organizations. Therefore, opportunities for optimization in this respect are always welcome. The purpose of this work is to present a methodology to provide a solution to a complexity task of optimization in Multi-objective Optimization for Green Vehicle Routing Problem (MOOGVRP). The methodology, illustrated using a case study (employee transport problem) and instances from the literature, was divided into three stages: Stage 1, “data treatment”, where the asymmetry of the routes to be formed and other particular features were addressed; Stage 2, “metaheuristic approaches” (hybrid or non-hybrid), used comparatively, more specifically: NSGA-II (Non-dominated Sorting Genetic Algorithm II), MOPSO (Multi-Objective Particle Swarm Optimization), which were compared with the new approaches proposed by the authors, CWNSGA-II (Clarke and Wright’s Savings with the Non-dominated Sorting Genetic Algorithm II) and CWTSNSGA-II (Clarke and Wright’s Savings, Tabu Search and Non-dominated Sorting Genetic Algorithm II); and, finally, Stage 3, “analysis of the results”, with a comparison of the algorithms. Using the same parameters as the current solution, an optimization of 5.2% was achieved for Objective Function 1 (OF{\displaystyle _{1}}; minimization of CO{\displaystyle _{2}} emissions) and 11.4% with regard to Objective Function 2 (OF{\displaystyle _{2}}; minimization of the difference in demand), with the proposed CWNSGA-II algorithm showing superiority over the others for the approached problem. Furthermore, a complementary scenario was tested, meeting the constraints required by the company concerning time limitation. For the instances from the literature, the CWNSGA-II and CWTSNSGA-II algorithms achieved superior results.