Guillermo VargasFelipe González Aristizábal2026-03-222026-03-22200710.15446/ing.investig.v27n1.14795https://doi.org/10.15446/ing.investig.v27n1.14795https://andeanlibrary.org/handle/123456789/62121This paper presents a solution to a vehicle-routing problem by using two different techniques. In the first instance, a genetic algorithm was applied (different experiments were done); later on the cluster first-route second methodology was used via heuristic sweep and local search, respectively. The results of the different techniques were then compared.enHeuristicsVehicle routing problemGenetic algorithmMetaheuristicHeuristicRouting (electronic design automation)Computer scienceMathematical optimizationLocal search (optimization)Algorithmarticle