193 search results - page 3 / 39 » Chromosome Reuse in Genetic Algorithms |
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
ISCIS
2003
Springer
14 years 3 months ago
2003
Springer
This study describes an alternative concurrency approach in genetic algorithms. Inspiring from implicit parallelism in a physical chromosome, a vertical concurrency is introduced. ...
DEXAW
2008
IEEE
14 years 4 months ago
2008
IEEE
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
ICONIP
2009
13 years 7 months ago
2009
This paper presents a method for a short-term stock index prediction. The source data comes from the German Stock Exchange (being the target market) and two other markets (Tokyo St...
SAC
2000
ACM
14 years 2 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...