Sciweavers

151 search results - page 20 / 31
» Ant Colony Optimization for the Ship Berthing Problem
Sort
View
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
14 years 12 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
IPPS
2006
IEEE
15 years 5 months ago
Ant stigmergy on the grid: optimizing the cooling process in continuous steel casting
The paper presents a new distributed metaheuristic algorithm in an optimal control problem related to the cooling process in the continuous casting of steel. The optimization task...
Peter Korosec, Jurij Silc, Bogdan Filipic, Erkki L...
FLAIRS
2006
15 years 1 months ago
Which Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
Koenraad Mertens, Tom Holvoet, Yolande Berbers
LSSC
2005
Springer
15 years 5 months ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova
CEC
2007
IEEE
15 years 6 months ago
The differential ant-stigmergy algorithm: an experimental evaluation and a real-world application
— This paper describes the so-called Differential Ant-Stigmergy Algorithm (DASA), which is an extension of the Ant-Colony Optimization for a continuous domain. An experimental ev...
Peter Korosec, Jurij Silc, Klemen Oblak, Franc Kos...