50 search results - page 1 / 10 » An Improved Time-Sensitive Metaheuristic Framework for Combi... |
WEA
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
HOLOMAS
2009
Springer
13 years 2 months ago
2009
Springer
Abstract. This paper introduces a framework based on multi-agent system for solving problems of combinatorial optimization. The framework allows running various metaheuristic algor...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
AUSAI
2005
Springer
13 years 6 months ago
2005
Springer
Abstract. Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identi...
JPDC
2006
13 years 4 months ago
2006
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO