A Graph-Based Lamarckian–Baldwinian Hybrid for the Sorting Network Problem
| Autor: | Byung-Ro Moon, Sung-Soon Choi |
|---|---|
| Rok vydání: | 2005 |
| Předmět: |
Scheme (programming language)
Computer science business.industry Heuristic (computer science) Sorting Graph theory Supercomputer Theoretical Computer Science Computational Theory and Mathematics Encoding (memory) Genetic algorithm Sorting network Artificial intelligence business computer Algorithm Software computer.programming_language |
| Zdroj: | IEEE Transactions on Evolutionary Computation. 9:105-114 |
| ISSN: | 1089-778X |
| Popis: | A hybrid genetic algorithm (GA) is proposed for the optimal sorting network problem. Based on a graph-theoretical viewpoint, we devised a solution repair heuristic which incorporates a strong local optimization. We also propose a new encoding scheme which combines the characteristics of Lamarckian and Baldwinian GAs. Using a single-CPU PC, we obtained results comparable to previous results obtained with supercomputers. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|