Sciweavers

444 search results - page 35 / 89
» Solving Mastermind Using Genetic Algorithms
Sort
View
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
13 years 9 months ago
Rank based variation operators for genetic algorithms
We show how and why using genetic operators that are applied with probabilities that depend on the fitness rank of a genotype or phenotype offers a robust alternative to the Sim...
Jorge Cervantes, Christopher R. Stephens
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
14 years 8 days ago
A tree-based genetic algorithm for building rectilinear Steiner arborescences
A rectilinear Steiner arborescence (RSA) is a tree, whose nodes include a prescribed set of points, termed the vertices, in the first quadrant of the Cartesian plane, and whose tr...
William A. Greene
OL
2010
128views more  OL 2010»
13 years 7 months ago
A biased random-key genetic algorithm for road congestion minimization
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment proble...
Luciana S. Buriol, Michael J. Hirsch, Panos M. Par...
CEC
2007
IEEE
14 years 3 months ago
Modified genetic algorithm for job-shop scheduling: A gap utilization technique
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
14 years 2 months ago
A multi-objective genetic algorithm for robust design optimization
Real-world multi-objective engineering design optimization problems often have parameters with uncontrollable variations. The aim of solving such problems is to obtain solutions t...
Mian Li, Shapour Azarm, Vikrant Aute