Guillermo VargasFelipe González Aristizábal2026-03-222026-03-22200610.15446/ing.investig.v26n3.14768https://doi.org/10.15446/ing.investig.v26n3.14768https://andeanlibrary.org/handle/123456789/54211Citaciones: 4This paper deals with VRP (vehicle routing problem) mathematical formulation and presents some methodologies used by different authors to solve VRP variation. This paper is presented as the springboard for introducing future papers about a manufacturing company’s location decisions based on the total distance traveled to distribute its product.enVehicle routing problemMetaheuristicOperations researchRouting (electronic design automation)Variation (astronomy)Product (mathematics)EngineeringComputer scienceMathematical optimizationIndustrial engineeringMetaheuristics applied to vehicle routing. A case study. Part 1: formulating the problemarticle