Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/2594
Título: | Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behaviour |
---|---|
Autor/a: | Comellas Padró, Francesc de Paula; Martínez Navarro, Jesús |
Otros autores: | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
Abstract: | This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the problem to solve, and evolves in a way similar to real life insects. We test the algorithm on a classical difficult problem, the $k$-coloring of a graph, and we compare its performance in relation to a standard genetic algorithm and another multiagent system. The results show that this algorithm is faster and outperforms the other methods for a range of random graphs with different orders and densities. Moreover, the method is easy to adapt to solve different NP-complete problems. |
Materia(s): | -Àrees temàtiques de la UPC::Matemàtiques i estadística -Combinatorics -Algorithms -evolutionary algorithm -k-coloring -graphs -bumblebees -Combinacions (Matemàtica) -Algorismes -Classificació AMS::05 Combinatorics -Classificació AMS::68 Computer science::68W Algorithms |
Derechos: | Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
Tipo de documento: | Objeto de conferencia |
Compartir: |