An ant system for the maximum independent set problem

Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., the Traveling Salesperson Problem). More recently, promising results were obtained for solving the Multiple Knapsack Problem by introducing a modification of the standard Ant System a...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Leguizamón, Guillermo, Michalewicz, Zbigniew, Schutz, Martín
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2001
Materias:	Ciencias Informáticas Hormigas Optimization Heuristic methods ARTIFICIAL INTELLIGENCE ant colony optimization maximum independent set problem combinatorial optimization metaheuristics
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/23384
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

A new metaheuristic and its application to the Steiner problems in graphs
por: Urrutia, S., et al.

A new metaheuristic and its application to the Steiner problems in graphs
por: Urrutia, Sebastián, et al.
Publicado: (2001)

An ant colony optimization algorithm for job shop scheduling problem
por: Flórez, Edson, et al.
Publicado: (2013)

The ant colony metaphor in continuous spaces using boundary search
por: Leguizamón, Guillermo
Publicado: (2003)

Current applications of ant systems for subset problems
por: Leguizamón, Guillermo
Publicado: (2000)

Parallel ant algorithms for the minimum tardy task problem
por: Alba Torres, Enrique, et al.
Publicado: (2004)

An improved ant colony algorithm for the job shop scheduling problem
por: Leguizamón, Guillermo, et al.
Publicado: (2002)

Metaheurísticas Multinivel para la Resolución del Set Covering Problem
por: Valenzuela, Claudio, et al.
Publicado: (2011)

New ACO algorithm for image edge detection
por: Martínez, C.A., et al.

New ACO algorithm for image edge detection
Publicado: (2014)

An ACO approach for the Parallel Machines Scheduling Problem
por: Gatica, Claudia R., et al.
Publicado: (2008)

The ant colony metaphor for multiple knapsack problem
por: Cena, Marcelo Guillermo, et al.
Publicado: (2000)

Optimal Instrumentation: Adjustment and Hybridization of a Simulated Annealing Based Technique
por: Hernández, José Luis, et al.
Publicado: (2019)

A Three-level Scheduler to Execute Scientific Experiments on Federated Clouds
por: Pacini, E., et al.

A Three-level Scheduler to Execute Scientific Experiments on Federated Clouds
Publicado: (2015)

A Many-objective Ant Colony Optimization applied to the Traveling Salesman Problem
por: Riveros, Francisco, et al.
Publicado: (2016)

Extensión de algoritmos ACO usando conceptos de Tabu Search
por: Arito, Franco, et al.
Publicado: (2009)

Broker Scheduler based on ACO for Federated Cloud-based scientific experiments
por: Pacini, E., et al.

Broker Scheduler based on ACO for Federated Cloud-based scientific experiments
Publicado: (2016)

Applications of combinatorial optimization
Publicado: (2010)

A tabu search heuristic for the equitable coloring problem
por: Méndez Díaz, I., et al.

A tabu search heuristic for the equitable coloring problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2014)

An ACO model for a non-stationary formulation of the single elevator problem
por: Molina, Silvia, et al.
Publicado: (2007)

Integer and combinatorial optimization /
por: Nemhauser, George, et al.
Publicado: (1999)

Optimización de rutas en el transporte de personas para la pequeña y mediana empresa
por: Villagra, Andrea, et al.
Publicado: (2016)

Parallel ant system applied to the multiple knapsack problem
por: Cena, Marcelo Guillermo, et al.
Publicado: (1998)

A bio-inspired scheduler for minimizing makespan and flowtime of computational mechanics applications on federated clouds
por: Pacini, E., et al.

A bio-inspired scheduler for minimizing makespan and flowtime of computational mechanics applications on federated clouds
Publicado: (2016)

A functional programming approach to a computational biology problem
por: Krasnogor, Natalio, et al.
Publicado: (1997)

An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
por: Balseiro, S.R., et al.

An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
por: Loiseau, Irene
Publicado: (2011)

Ant colonies using arc consistency techniques for the set partitioning problem
por: Crawford, Broderick, et al.
Publicado: (2006)

An approach to support generic topologies in distributed PSO algorithms in Spark
por: Pardo, Xoán C., et al.
Publicado: (2023)

Towards distributed reasoning for behavioral optimization
por: Cebulla, Michael
Publicado: (2006)

Metaheuristics for feature selection in handwritten digit recognition
por: Seijas, L.M., et al.

Metaheuristics for feature selection in handwritten digit recognition
por: Seijas, Leticia María
Publicado: (2016)

An immune artificial algorithm for dynamic optimization problems: a case of study
por: Aragón, Victoria S., et al.
Publicado: (2009)

Optimización de algoritmos PSO mediante regresión exponencial
por: Azar, Miguel Augusto, et al.
Publicado: (2015)

Optimización basada en colonias de hormigas: una aplicación a la distribución de sobres
por: Ojeda, Adrián, et al.
Publicado: (2015)

Robust control optimization with metaheuristics /
por: Feyel, Philippe
Publicado: (2017)