Water cycle algorithm: implementation and analysis of solutions to the bi-bjective travelling salesman problem
This 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 gener...
- Autores:
-
Pimentel, Jairo
Ardila Hernandez, Carlos Julio
Niño, Elías
Jabba Molinares, Daladier
Ruiz-Rangel, Jonathan
- Tipo de recurso:
- Fecha de publicación:
- 2019
- Institución:
- Universidad Simón Bolívar
- Repositorio:
- Repositorio Digital USB
- Idioma:
- eng
- OAI Identifier:
- oai:bonga.unisimon.edu.co:20.500.12442/3973
- Acceso en línea:
- https://hdl.handle.net/20.500.12442/3973
- Palabra clave:
- Finite Deterministic Automaton
Genetic Algorithm
Water Cycle Algorithm
Travelling Salesman Problem
- Rights
- License
- Attribution-NonCommercial-NoDerivatives 4.0 Internacional
| Summary: | This 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. |
|---|