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

In diesem Beitrag wird ein Simultanplanungsansatz für die Flugplanerstellung vorgestellt.Bisherige Ansätze zur Flugplanerstellung separieren das Problem und lassen deshalb Interdependenzenzwischen den Problemvariablen unberücksichtigt. In dem vorgestellten Planungsansatzwerden mittels eines...

This paper investigates how the use of the trivial voting (TV) mapping influences the performanceof genetic algorithms (GAs). The TV mapping is a redundant representation for binaryphenotypes. A population sizing model is presented that quantitatively predicts the influence ofthe TV mapping and...

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