Sciweavers

4 search results - page 1 / 1
» Genetic Forma Recombination in Permutation Flowshop Problems
Sort
View
EC
1998
100views ECommerce» more  EC 1998»
13 years 4 months ago
Genetic Forma Recombination in Permutation Flowshop Problems
This paper analyzes different representations for permutation flowshop problems. This is done using forma analysis to assess the quality of these representations with respect to m...
Carlos Cotta, José M. Troya
PPSN
2000
Springer
13 years 8 months ago
Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide t...
Carlos Cotta, José M. Troya
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
13 years 11 months ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
13 years 8 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis