The ant colony metaphor in continuous spaces using boundary search

This paper presents an application of the ant colony metaphor for continuous space optimization problems. The ant algortihm proposed works following the principle of the ant colony approach, i.e., a population of agents iteratively, cooperatively, and independently search for a solution. Each ant i...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Leguizamón, Guillermo
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2003
Materias:	Ciencias Informáticas Hormigas Optimization Algorithms ARTIFICIAL INTELLIGENCE Intelligent agents ant colony optimization evolutionary algorithms constraint optimization problems boundary search
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/22787
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem
por: Fernandez, Natalia, et al.
Publicado: (2001)

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

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

An ant system for the maximum independent set problem
por: Leguizamón, Guillermo, et al.
Publicado: (2001)

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

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

Optimization of tardiness related objectives in single machine environments via multirecombined evolutionary algorithms
por: San Pedro, María Eugenia de, et al.
Publicado: (2003)

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

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

A criteria to select genetic operators for solving CSP
por: Riff Rojas, María Cristina
Publicado: (2000)

A simple genetic algorithm for a minimal overlapping scheduling problem
por: Olivera, Alfredo, et al.
Publicado: (2004)

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

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

Hybridizing an immune artificial algorithm with epsilon constrained method
por: Aragón, Victoria S., et al.
Publicado: (2012)

Optimal auctions capturing constraints in sponsored search
por: Feuerstein, E., et al.

Optimal auctions capturing constraints in sponsored search
por: Heiber, Pablo Ariel, et al.
Publicado: (2009)

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

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)

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

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

Optimización multi-objetivo : Aplicaciones a problemas del mundo real
por: López, Javier
Publicado: (2015)

A hybrid metaheuristic based on differential evolution and local search with quadratic interpolation
por: Tardivo, María Laura, et al.
Publicado: (2012)

Una versión paralela del algoritmo evolutivo para optimización multiobjetivo NSGA-II
por: Nesmachnow, Sergio
Publicado: (2004)

Hybridizing multi-inver-over evolutionary algorithms with tabu search for the symmetric TSP
por: Bermúdez, Carlos, et al.
Publicado: (2001)

A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2000)

Evolutionary optimization in dynamic fitness landscape environments
por: Aragón, Victoria S., et al.
Publicado: (2003)

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

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)

Una versión paralela del NSGA II utilizando multi-threads
por: Ezzatti, Pablo
Publicado: (2004)

Evaluation of a master-slave parallel evolutionary algorithm applied to artificial intelligence for games in the xeon-phi many-core platform
por: Leopold, S.R., et al.

Evaluation of a master-slave parallel evolutionary algorithm applied to artificial intelligence for games in the xeon-phi many-core platform
por: Mocskos, Esteban Eduardo
Publicado: (2017)

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)

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)

M-ACO, un algoritmo de multicolonias de hormigas para el problema de múltiples ascensores
por: Molina, Silvia, et al.
Publicado: (2012)

El problema de la dispersión máxima en un entorno multi-objetivo
por: Machuca Cabral, Mauricio, et al.
Publicado: (2017)

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