Exploiting Constraints as Background Knowledge for Genetic Algorithms: A Case-Study for Scheduling
暂无分享,去创建一个
[1] Takeshi Yamada,et al. Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.
[2] Lawrence Davis,et al. Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.
[3] L. Darrell Whitley,et al. Optimizing Neural Networks Using FasterMore Accurate Genetic Search , 1989, ICGA.
[4] D. E. Goldberg,et al. Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .
[5] Heinz Mühlenbein,et al. Parallel Genetic Algorithms in Combinatorial Optimization , 1992, Computer Science and Operations Research.
[6] Marco Dorigo,et al. Genetic Algorithms and Highly Constrained Problems: The Time-Table Case , 1990, PPSN.
[7] Zbigniew Michalewicz,et al. Handling Constraints in Genetic Algorithms , 1991, ICGA.
[8] Gunar E. Liepins,et al. Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.
[9] S. S. Panwalkar,et al. A Survey of Scheduling Rules , 1977, Oper. Res..
[10] Jan Paredis,et al. Intelligent modelling, simulation and Scheduling of discrete production Processes , 1992, Computer Science and Operations Research.
[11] Geoffrey E. Hinton,et al. How Learning Can Guide Evolution , 1996, Complex Syst..
[12] Ron Shonkwiler,et al. Parallel Genetic Algorithms , 1993, ICGA.
[13] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .