Sciweavers

16596 search results - page 51 / 3320
» Generalized Assignment Problems
Sort
View
GECCO
2007
Springer
143views Optimization» more  GECCO 2007»
15 years 3 months ago
Learning and exploiting knowledge in multi-agent task allocation problems
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
Adam Campbell, Annie S. Wu
CEC
2008
IEEE
15 years 4 months ago
A parallel surrogate-assisted multi-objective evolutionary algorithm for computationally expensive optimization problems
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Robert Ivo...
JDA
2010
88views more  JDA 2010»
14 years 8 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
COR
2008
102views more  COR 2008»
14 years 9 months ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
FGCS
2000
83views more  FGCS 2000»
14 years 9 months ago
A Graph-based Ant System and its convergence
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
Walter J. Gutjahr