Metaheuristics applied to vehicle routing. A case study. Part 2: genetic algorithm, compared to a heuristics solution

Simple item page
dc.contributor.authorGuillermo Vargas
dc.contributor.authorFelipe González Aristizábal
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T17:05:34Z
dc.date.available2026-03-22T17:05:34Z
dc.date.issued2007
dc.description.abstractThis 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.
dc.identifier.doi10.15446/ing.investig.v27n1.14795
dc.identifier.urihttps://doi.org/10.15446/ing.investig.v27n1.14795
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/62121
dc.language.isoen
dc.publisherNational University of Colombia
dc.relation.ispartofIngeniería e Investigación
dc.sourceUniversidad Nacional de Colombia
dc.subjectHeuristics
dc.subjectVehicle routing problem
dc.subjectGenetic algorithm
dc.subjectMetaheuristic
dc.subjectHeuristic
dc.subjectRouting (electronic design automation)
dc.subjectComputer science
dc.subjectMathematical optimization
dc.subjectLocal search (optimization)
dc.subjectAlgorithm
dc.titleMetaheuristics applied to vehicle routing. A case study. Part 2: genetic algorithm, compared to a heuristics solution
dc.typearticle

Files

Collections

Artículo Científico Publicado