dc.creatorPimentel, Jairo
dc.creatorArdila Hernandez, Carlos Julio
dc.creatorNiño, Elías
dc.creatorJabba Molinares, Daladier
dc.creatorRuiz-Rangel, Jonathan
dc.date.accessioned2019-09-13T22:13:10Z
dc.date.accessioned2022-11-14T19:38:13Z
dc.date.available2019-09-13T22:13:10Z
dc.date.available2022-11-14T19:38:13Z
dc.date.created2019-09-13T22:13:10Z
dc.date.issued2019
dc.identifier09740635
dc.identifierhttps://hdl.handle.net/20.500.12442/3973
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5180485
dc.description.abstractThis research is an implementation of the Water Cycle Algorithm (WCA) to solve the biobjective Travelling Salesman Problem, based on the kroAB100 problem in the TSPLIB library, and compare its performance to an alternative metaheuristic algorithm (MO Ant Colony BiCriterionAnt). Metrics such as generational distance, inverse generational distance, spacing, dispersion and maximum dispersion were used to compare the two algorithms. Results demonstrate that the Water Cycle Algorithm generates superior solutions to this category of problem according to most of the metrics.
dc.languageeng
dc.publisherInternational Journal of Artificial Intelligence
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional
dc.sourceVol. 17 No. 2 (2019) October
dc.sourceInternational Journal of Artificial Intelligence
dc.sourcewww.ceser.in/ceserp/index.php/ijai/article/view/6256
dc.subjectFinite Deterministic Automaton
dc.subjectGenetic Algorithm
dc.subjectWater Cycle Algorithm
dc.subjectTravelling Salesman Problem
dc.titleWater cycle algorithm: implementation and analysis of solutions to the bi-bjective travelling salesman problem
dc.typearticle


Este ítem pertenece a la siguiente institución