3433 search results - page 175 / 687 » Heuristics for a bidding problem |
188
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
192
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
161
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...
156
click to vote
CAS
2008
15 years 6 months ago
2008
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
174
click to vote
EOR
2002
15 years 6 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...