This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
Dimitris Fotakis, Spiridon D. Likothanassis, Stama...
Using a simple simulation model of evolution and learning this paper provides some evolutionary arguments on why Lamarckianlike inheritance - direct transfer of lifetime learning r...
Ingo Paenke, Bernhard Sendhoff, Jon Rowe, Chrisant...
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
This paper presents an abstract computation model of the evolution of camouflage in nature. The 2d model uses evolved textures for prey, a background texture representing the envi...
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...