The understanding of human behavior in sequential decision tasks is im-portant for economics and socio-psychological sciences. In search tasks,for example when individuals search for the best price of a product, theyare confronted in sequential steps with different situations and they haveto...

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

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

Genetic algorithms are sometimes disparagingly denoted as just a fancier form of a plain, stupidheuristic. One of the main reasons for this kind of critique is that users believed a GA could notguarantee global convergence in a certain amount of time.Because the proof of global convergence of...

When using gentic and evolutionary algorithms (GEAs) for the optimal communication spanning problem, the design of a suitable tree network encoding is crucial for finding good solutions. The link and node biased (LNB) encoding represents the structure of a tree network using a weighted vector...

This paper adresses the optimization of telecommunication networks for a multi-period horizon. Four heuristics are presented to cope with the problem to minimize the overall costsfor a network over several periods. For the minimization of cost we use a simple genetic algorithm (GE).[...]

When handling tree networks, researchers have sometimes tried using the pruefernumber representation for encoding networks, but GAs often degraded or broke down when used on this encoding. This paper investigates the locality of the pruefernumber and its effect on the performance of a Genetic...