An overview of a synergetic combination of local search with evolutionary learning to solve optimization problems

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

Volumn 1821, Issue , 2000, Pages 129-138

  Loganantharaj, Rasiah ^a   Thomas, Bushrod ^a  

^a University of Louisiana at Lafayette   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957890309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45049-1_16     Document Type: Conference Paper

References (8)

1. Boyan, J.: Learning Evaluation Functions for Global Optimization and Boolean Satisfiability. Proceedings of AAAI (1998)
2. Davis, L.: Genetic Algorithms and Simulated Annealing, Research Notes in Artificial Intelligence. Morgan Kaufmann, New York (1987)
3. Du, J. Leung, J.Y.: Minimizing Total Tardiness on One Machine is NP-Hard. Mathematics of Operations Research, Vol. 15 (1990) 483-495
4. Grass J., Zilberstein, S.: Anytime Algorithm Development Tool. Sigart Bulletin, Vol. 7, No. 2 (1996)
5. Leon, V.J., Balakrishnan, R.: Strength and Adaptability of Problem-Space based Neighbor-hoods for Resource-constrained Scheduling. OR Spektrum, Vol 17. Springer-Verlag, Berlin Heidelberg New York (1995) 172-182
6. Loganantharaj R., Thomas, B.: Improving the Efficiency of the Ground Processing Schedul-ing System. NASA/ASEE Summer Faculty Research Report (1997)
7. Norman, B.A., Bean, J.C.: Random Keys Genetic Algorithm for Job Shop Scheduling. Technical Report 94-5, Dept. of Industrial and Operations Engineering, The University of Michigan (1994)
8. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, Third Re-vised and Extended Edition, Springer (1996)