Sciweavers

48 search results - page 8 / 10
» An Ant Colony Optimisation Algorithm for the Set Packing Pro...
Sort
View
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
13 years 11 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
TEC
2008
98views more  TEC 2008»
13 years 7 months ago
Opposition-Based Differential Evolution
Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general we...
Shahryar Rahnamayan, Hamid R. Tizhoosh, Magdy M. A...
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
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
13 years 12 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
GEM
2010
13 years 5 months ago
A Suite of Metaheuristic Algorithms for Static Weapon-Target Allocation
Abstract-- The problem of allocating defensive weapon resources to hostile targets is an optimization problem of high military relevance. The need for obtaining the solutions in re...
Fredrik Johansson, Göran Falkman