Sciweavers

883 search results - page 16 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
EOR
2007
90views more  EOR 2007»
13 years 7 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
GECCO
1999
Springer
126views Optimization» more  GECCO 1999»
13 years 11 months ago
Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling)
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
Stephen Y. Chen, Stephen F. Smith
CORR
2010
Springer
427views Education» more  CORR 2010»
13 years 5 months ago
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algori
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
Poonam Garg
EMMCVPR
1997
Springer
13 years 11 months ago
Genetic Algorithms for Ambiguous Labelling Problems
Consistent labelling problems frequently have more than one solution. Most work in the "eld has aimed at disambiguating early in the interpretation process, using only local ...
Richard Myers, Edwin R. Hancock
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
13 years 11 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria