Neighborhood structures for genetic local search algorithms
暂无分享,去创建一个
[1] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .
[2] Hisao Ishibuchi,et al. Performance evaluation of genetic algorithms for flowshop scheduling problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[3] Hideo Tanaka,et al. Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems , 1994 .
[4] Nostrand Reinhold,et al. the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .
[5] Dirk Van Gucht,et al. The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem , 1989 .
[6] Hisao Ishibuchi,et al. Effectiveness of Genetic Local Search Algorithms , 1997, ICGA.
[7] Emile H. L. Aarts,et al. Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.
[8] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .