Sciweavers

498 search results - page 36 / 100
» Optimization of Genetic Operators for Scheduling Problems
Sort
View
TSMC
2011
324views more  TSMC 2011»
15 years 1 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
IWANN
2001
Springer
15 years 11 months ago
A New Approach to Evolutionary Computation: Segregative Genetic Algorithms (SEGA)
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
Michael Affenzeller
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
16 years 3 days ago
Directional self-learning of genetic algorithm
In order to overcome the low convergence speed and prematurity of classical genetic algorithm, an improved method named directional self-learning of genetic algorithm (DSLGA) is p...
Lin Cong, Yuheng Sha, Licheng Jiao, Fang Liu
AIR
2004
130views more  AIR 2004»
15 years 6 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
IJON
2006
131views more  IJON 2006»
15 years 6 months ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...