Palma-Blanco, AndresCassandro-De La Hoz, DanielaPaternina-Arboleda, Carlos2018-12-172022-04-042018-12-172022-04-042018-09978-0-9993443-1-62414-6390http://laccei.org/LACCEI2018-Lima/meta/FP293.htmlhttp://dx.doi.org/10.18687/LACCEI2018.1.1.293https://axces.info/handle/10.18687/2018102_293This paper considers a variant of the Vehicle Routing Problem (VRP) subject to time windows for every customer, multiple products and incompatibility between them. Since the problem is NP-hard, the approach to achieve feasible solutions is an Ant Colony System with Two-Pheromone with the objective of minimizing routing cost and vehicle fleet size. Experiments are carried out using instances from literature showing competitive solutions in relatively short computational times.EnglishLACCEI Licensehttps://laccei.org/blog/copyright-laccei-papers/Vehicle RoutingTime WindowsMultiple ProductsProduct IncompatibilityAnt Colony MetaheuristicArticle