A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
We present a theoretical analysis of Watson’s Hierarchicalif-and-only-if (HIFF) problem using a variety of tools. These include schema theory and course graining, the concept of...
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
We develop a multi-objective model for resource allocation problem in PERT networks with exponentially or Erlang distributed activity durations, where the mean duration of each ac...
Amir Azaron, Hideki Katagiri, Masatoshi Sakawa, Ko...