Applying a Genetic Algorithm to a m-TSP: Case Study of a Decision Support System for Optimizing a Beverage Logistics Vehicles Routing Problem

Route optimization has become an increasing problem in the transportation and logistics sector within the development of smart cities. This article aims to demonstrate the implementation of a genetic algorithm adapted to a Vehicle Route Problem (VRP) in a company based in the city of Covilhã (Portugal). Basing the entire approach to this problem on the characteristic assumptions of the Multiple Traveling Salesman Problem (m-TSP) approach, an optimization of the daily routes for the workers assigned to distribution, divided into three zones: North, South and Central, was performed. A critical approach to the returned routes based on the adaptation to the geography of the Zones was performed. From a comparison with the data provided by the company, it is predicted by the application of a genetic algorithm to the m-TSP, that there will be a reduction of 618 km per week of the total distance traveled. This result has a huge impact in several forms: clients are visited in time, promoting provider-client relations; reduction of the fixed costs with fuel; promotion of environmental sustainability by the reduction of logistic routes. All these improvements and optimizations can be thought of as contributions to foster smart cities.Fundação para a Ciência e a Tecnologia (FCT—MCTES) for its financial support via the project UIDB/00151/2020 (C-MAST).info:eu-repo/semantics/publishedVersio