Sciweavers

697 search results - page 1 / 140
» Improving EAs for Sequencing Problems
Sort
View
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
13 years 8 months ago
Improving EAs for Sequencing Problems
Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. Howeve...
Wolfgang Günther, Rolf Drechsler
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
13 years 10 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
EVOW
2008
Springer
13 years 6 months ago
A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
Gregory J. Barlow, Stephen F. Smith
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 8 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
13 years 10 months ago
A hybrid evolutionary algorithm for the p-median problem
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
István Borgulya