Parallel ant system applied to the multiple knapsack problem

Interesting real world combinatorial problems are NP-complete and many of them are hard to solve by using traditional methods. However, several heuristic methods have been developed in order to obtain timely suboptimal solutions. Most of those heuristic methods are also naturally suitable for a para...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Cena, Marcelo Guillermo, Leguizamón, Guillermo
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	1998
Materias:	Ciencias Informáticas Informática parallel programming distributed systems Combinatorial algorithms colony systems combinatorial optimization multiple knapsack problem
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/24565
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

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 runnable functional formal memetic algorithm framework
por: Krasnogor, Natalio, et al.
Publicado: (1998)

Alternative strategies for asynchronous migration-controlled schemes in parallel genetic algorithm
por: Ochoa, Claudio, et al.
Publicado: (1999)

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

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

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 system for the maximum independent set problem
por: Leguizamón, Guillermo, et al.
Publicado: (2001)

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

Parallelization of the N-queens problem : Load unbalance analysis.
por: De Giusti, Laura Cristina, et al.
Publicado: (2003)

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

Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda-Bront, J.J., et al.

Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda Bront, Juan José, et al.
Publicado: (2014)

Learning classifier systems for optimisation problems: A case study on fractal travelling salesman problem
por: Tabacman, M., et al.

Learning classifier systems for optimisation problems: A case study on fractal travelling salesman problem
por: Tabacman, Maximiliano, et al.
Publicado: (2008)

A multirecombinative evolutionary approach to solve the parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000)

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

A study of alternative selection mechanisms for multiple cossover per couple in genetic algorithms
por: Esquivel, Susana Cecilia, et al.
Publicado: (1998)

Knapsack problems : Algorithms and computer implementations
por: Martello, Silvano
Publicado: (1990)

Applications of combinatorial optimization
Publicado: (2010)

4-(N<sup>2</sup>-1) Puzzle: parallelization and performance on clusters
por: Sanz, Victoria María, et al.
Publicado: (2009)

Solving parallel problems by OTMP model
por: Piccoli, María Fabiana, et al.
Publicado: (2003)

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

Evolutionary-statistical system for uncertainty reduction problems in wildfires
por: BIanchini, Germán, et al.
Publicado: (2012)

Evolutionary approaches for the parallel task scheduling problem : the representation issue
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)

Representing parallel programs with MPI by exploiting a graph-based approach
por: Sato, Liria Matsumoto, et al.
Publicado: (2001)

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

Handbook of genetic algorithms /
Publicado: (1991)

Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda-Bront, J.J., et al.

Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda Bront, Juan José, et al.
Publicado: (2013)

4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clusters
por: Sanz, Victoria María, et al.
Publicado: (2010)

On extending de Bruijn sequences
por: Becher, V., et al.

On extending de Bruijn sequences
por: Becher, Verónica Andrea, et al.
Publicado: (2011)

Skeletal parallel programming
por: Saez, Fernando, et al.
Publicado: (2007)

Solving unrestricted parallel machine scheduling problems via evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2003)

An algorithm to deal with due date violation in a multi-objective scheduling problem
por: Ibáñez, Francisco S., et al.
Publicado: (2003)

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)

On bulk-synchronous distributed-memory parallel processing of relational-database transactions
por: Marín, Mauricio, et al.
Publicado: (2001)