A Study of Parallel Approaches in MOACOs for solving the Bicriteria TSP
•Transferir como PPS, PDF•
1 gostou•1,102 visualizações
In this work, the parallelization of some Multi-Objective Ant Colony Optimization (MOACO) algorithms has been performed. The aim is to get a better performance, not only in running time (usually the main objective when a distributed approach is implemented), but also improving the spread of solutions over the Pareto front (the ideal set of solutions). In order to do this, colony-level (coarse- grained) implementations have been tested for solving the Bicriteria TSP problem, yielding better sets of solutions, in the sense explained above, than a sequential approach.
![INDEX ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recomendados
Recomendados
Mais conteúdo relacionado
Mais procurados
Mais procurados (18)
Semelhante a A Study of Parallel Approaches in MOACOs for solving the Bicriteria TSP
Semelhante a A Study of Parallel Approaches in MOACOs for solving the Bicriteria TSP (20)
Mais de Antonio Mora
Mais de Antonio Mora (20)
Último
Último (20)
A Study of Parallel Approaches in MOACOs for solving the Bicriteria TSP
- 1. A Study of Parallel Approaches in MOACOs for Solving the Bicriteria TSP A.M. Mora , J.J. Merelo, P.A. Castillo, M.G. Arenas, P. García-Sánchez, J.L.J. Laredo Departamento de Arquitectura y Tecnología de Computadores. UNIVERSIDAD DE GRANADA International Work-Conference on Artificial Neural Networks 2011
- 4. Ant Colony Optimization (II) Pheromone trail ? CHOOSING A PATH
Notas do Editor
- These are the non-dominates solutions yielded in each part of the Pareto Front (search space) Better than the Mono-Processor approach Finds solutions in the edges of the PF
- Again the set of non-dominated solutions per processor Better than the Mono-Processor approach Finds solutions in the edges of the PF
- Using a different ACO in each of the colonies