Sciweavers

273 search results - page 51 / 55
» Genetic local search for multi-objective combinatorial optim...
Sort
View
SLS
2007
Springer
103views Algorithms» more  SLS 2007»
15 years 4 months ago
Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through
Stochastic Local Search (SLS) is quite effective for a variety of Combinatorial (Optimization) Problems (COP). However, the performance of SLS depends on several factors and getti...
Steven Halim, Roland H. C. Yap
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 3 months ago
Combining competent crossover and mutation operators: a probabilistic model building approach
This paper presents an approach to combine competent crossover and mutation operators via probabilistic model building. Both operators are based on the probabilistic model buildin...
Cláudio F. Lima, Kumara Sastry, David E. Go...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 2 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
CEC
2005
IEEE
15 years 4 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
GECCO
2004
Springer
15 years 3 months ago
Non-stationary Subtasks Can Improve Diversity in Stationary Tasks
Low diversity in a genetic algorithm (GA) can cause the search to become stagnant upon reaching a local optimum. To some extent, non-stationary tasks avoid this problem, which woul...
Christopher Willis-Ford, Terence Soule