Initialization in genetic algorithms for constraint satisfaction problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2084 LNCS, Issue PART 1, 2001, Pages 693-700

  Vela, Camino R ^a   Varela, Ramiro ^a   Puente, Jorge ^a  

^a UNIVERSITY OF OVIEDO   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; JOB SHOP SCHEDULING; ALGORITHMS; ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

HEURISTIC KNOWLEDGE; INITIAL POPULATION; JOB SHOP SCHEDULING PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 23044528421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45720-8_83     Document Type: Conference Paper

References (6)

1. Bierwirth, C., A Generalized Permutation Approach to Jobshop Scheduling with Genetic Algorithms. OR Spectrum, vol. 17 (1995) 87-92.
2. Grefenstette, J. J.: Incorporating problem specific knowledge in genetic algorithms. In: Genetic Algorithms and Simulated Annealing. Morgan Kaufmann (1987) 42-60.
3. Mattfeld, D. C.: Evolutionary Search and the Job Shop. Investigations on Genetic Algorithms for Production Scheduling. Springer-Verlag, November 1995.
4. Sadeh, N., Fox, M.S.: Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem. Artificial Intelligence, Vol. 86 (1996) 1-41.
5. Varela, R., Gomez, A., Vela, C. R., Puente, J., and Alonso, C.: Heuristic Generation of the Initial Population in Solving Job Shop Problems by Evolutionary Strategies. In: Foundations and Tools for Neural Modeling, LNCS, Procs. of IWANN'99 (Vol I), Springer-Verlag, Alicante, Spain, (June 1999) 690-697.
6. Varela, R., Vela, C. R, Puente, J., Gomez, A. and Vidal, A. M.: Solving Job-Shop Scheduling Problems by Means of Genetic Algorithms. In: The Practical Handbook of Genetic Algorithms, Ch. 8. Ed. Lance Chambers, Chapman & Hall/CRC (2001) 275-293.