Sciweavers

238 search results - page 21 / 48
» Parallel Ant Colonies for Combinatorial Optimization Problem...
Sort
View
EVOW
2005
Springer
14 years 1 months ago
Ant Algorithm for the Graph Matching Problem
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
Olfa Sammoud, Christine Solnon, Khaled Ghéd...
SYNASC
2005
IEEE
133views Algorithms» more  SYNASC 2005»
14 years 1 months ago
Emotional Ant Based Modeling of Crowd Dynamics
It is known that one of the most disastrous forms of collective human behavior is the kind of crowd stampede induced by panic. This situation often leads to fatalities as people a...
Soumya Banerjee, Crina Grosan, Ajith Abraham
NETWORKS
2007
13 years 7 months ago
Metaheuristics for the vehicle routing problem with loading constraints
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
Karl F. Doerner, Guenther Fuellerer, Richard F. Ha...
AUSAI
2004
Springer
14 years 28 days ago
Ant Colonies Discover Knight's Tours
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
Philip Hingston, Graham Kendall
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
14 years 1 months ago
Analyzing heuristic performance with response surface models: prediction, optimization and robustness
This research uses a Design of Experiments (DOE) approach to build a predictive model of the performance of a combinatorial optimization heuristic over a range of heuristic tuning...
Enda Ridge, Daniel Kudenko