Sciweavers

351 search results - page 4 / 71
» Evaluation of Different Metaheuristics Solving the RND Probl...
Sort
View
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 7 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
ESWA
2007
131views more  ESWA 2007»
13 years 7 months ago
Case-based selection of initialisation heuristics for metaheuristic examination timetabling
Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many...
Sanja Petrovic, Yong Yang, Moshe Dror
CEC
2010
IEEE
13 years 8 months ago
The differential Ant-Stigmergy Algorithm for large-scale global optimization
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
Peter Korosec, Katerina Taskova, Jurij Silc
JUCS
2007
186views more  JUCS 2007»
13 years 7 months ago
An Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems
: Recently, Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. A quick review of the literature reveals that re...
Hongbo Liu, Ajith Abraham
EVOW
2005
Springer
14 years 1 months ago
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
Juan José Pantrigo, Abraham Duarte, Á...