Approach to vehicle routing with exact, heuristic and environmental procedures: a case study
DOI:
https://doi.org/10.5585/exactaep.v17n1.8171Keywords:
Traveling Salesman Problem (TSP), Metaheuristics, Freight Transportation, Optimization, Greenhouse gases.Abstract
This paper aims to present an alternative of optimized routing of private collective transport to a chemical industry, in the municipality of Curitiba-PR, Brazil. In order to reach it, it was applied the mathematical model of the Traveling Salesman Problem (TSP), the p-Median and the heuristics Iterated Local Search (ILS), Tabu Search (TS), Simulated Annealing (SA) and the Clarke & Wright Savings algorithm in a comparative way. The mathematical models used here were relevant to the research, as well as the heuristics techniques, with computational time less than one second and good proximity to the optimal result. It was possible to optimize 83% of total distance of the route and 79% of carbon dioxide emissions in relation to the initial condition. As the methodology is generic, it could be applied to several applications.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2019 Exacta
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.