Hybridizing a genetic algorithm with local search and heuristic seeding

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

Volumn 2687, Issue , 2003, Pages 329-336

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

^a UNIVERSITY OF OVIEDO   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC KNOWLEDGE; LOCAL SEARCH; LOCAL SEARCH METHOD; SCHEDULING PROBLEM;

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; NEURAL NETWORKS; ALGORITHMS; LOCAL SEARCH (OPTIMIZATION);

PROBLEM SOLVING; HEURISTIC METHODS;

EID: 34247625724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44869-1_42     Document Type: Article

References (8)

1. Bierwirth, C.: A Generalized Permutation Approach to Jobshop Scheduling with Genetic Algorithms. OR Spectrum, Vol. 17 (1995) 87-92.
2. Bierwirth, C, Mattfeld, D.: Production Scheduling and Rescheduling dwdith Genetic Algoritthms. Evolutionary Computation, Vol. 7(1)(1999) 1-17.
3. Giffler, B. Thomson, G. L.: Algorithms for Solving Production Scheduling Problems. Operations Reseach 8 (1960) 487-503.
4. Matfeld, D. C.: Evolutionary Search and the Job Shop. Investigations on Genetic Algorithms for Production Scheduling. Springer-Verlag, November 1995.
5. 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.
6. Taillard, E.: Bechmarcks for basic scheduling problems. European Journal of Operational Research, Vol 64 (1993) 278-285.
7. Varela, R., Vela, C. R., Puente, J., Gómez A.: A knowledge-based evolutionary strategy for scheduling problems with bottlenecks. European Journal of Operational Research, Vol 145 (2003) 57-71.
8. Vela, C. R., Varela, R., Puente, J.: Initialization in Genetic Algorithms for Constraint Satisfaction Problems. J. Mira and A. Prieto (eds.), IWANN 2001, LNCS 2084 (2001) 693-700.