Authors:
Arthur T. Gómez
1
;
Cristiano Galafassi
2
and
Leonardo Chiwiacowsky
2
Affiliations:
1
Universidade do Vale do Rio dos Sinos, Brazil
;
2
University of the Sinos Valley and, Brazil
Keyword(s):
Metaheuristics, Tabu Search, Genetic Algorithms, Vehicle Routing Problem.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Computational Intelligence
;
Evolutionary Computing
;
Genetic Algorithms
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Optimization Algorithms
;
Soft Computing
Abstract:
This paper addresses the Capacitated Vehicle Routing Problem with Time Windows, with constraints related to the vehicle capacity and time windows for customer service. To solve this problem two different metaheuristics are used: Tabu Search and Genetic Algorithms. Based on these techniques a hybrid algorithm is developed. The main goal is the development of a Hybrid Algorithm focused on the Vehicle Routing Problem which uses the intensification power of the Tabu Search and the diversification power of the Genetic Algorithms, in order to obtain good quality solutions without compromising the computational time. In the experiments are combined policies of diversification and intensification in Tabu Search and Genetic Algorithm to verify the efficiency and robustness of the proposed hybrid algorithm. Finally, the results are compared with the best heuristic and exact methods results found in the literature. The Hybrid Algorithm here proposed shows efficiency and robustness, with several
optimal solutions achieved.
(More)