This paper presents and compares three heuristics for the combinatorial auctionproblem. Besides a simple greedy (SG) mechanism, two metaheuristics, a simulatedannealing (SA), and a genetic algorithm (GA) approach are developedwhich use the combinatorial auction process to an allocation with...

When using representations for genetic algorithms (GAs) every optimization problem canbe separated into a genotype-phenotype and a phenotype-tness mapping. The genotypephenotypemapping is the used representation and the phenotype-tness mapping is the problemthat should be solved.This paper...