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...

This paper investigates GA approaches for solving the reliable communicationnetwork design problem. For solving this problem a graph withminimum cost must be found that satises a given network reliabilityconstraint. To consider the additional reliability constraint dierent approachesare...

This paper introduces a bi-objective winner determination problem which arises in the procurement oftransportation contracts via combinatorial auctions. The problem is modelled as an extension to the setcovering problem and considers the minimisation of the total procurement costs and the...