10 search results - page 1 / 2 » The Dynamic Knapsack Problem Revisited: A New Benchmark Prob... |
EVOW
2009
Springer
13 years 2 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
WEA
2010
Springer
13 years 11 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
CEC
2009
IEEE
13 years 9 months ago
2009
IEEE
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
EVOW
2009
Springer
13 years 11 months ago
2009
Springer
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
ESCIENCE
2006
IEEE
13 years 10 months ago
2006
IEEE
: A relatively new meta-heuristic, known as extremal optimisation (EO), is based on the evolutionary science notion that poorly performing genes of an individual are replaced by ra...