A comparative study of five parallel genetic algorithms using the traveling salesman problem
暂无分享,去创建一个
Anthony A. Maciejewski | Vwani P. Roychowdhury | Howard Jay Siegel | Lee Wang | A. A. Maciejewski | H. J. Siegel | V. Roychowdhury | Lee Wang | H. Siegel
[1] 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 .
[2] Averill M. Law,et al. Simulation Modeling and Analysis , 1982 .
[3] L. Darrell Whitley,et al. Optimization Using Distributed Genetic Algorithms , 1990, PPSN.
[4] Tilak Agerwala,et al. SP2 System Architecture , 1999, IBM Syst. J..
[5] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[6] E. Lawler,et al. Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .
[7] Dan Boneh,et al. On genetic algorithms , 1995, COLT '95.
[8] N. Biggs. THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .
[9] Reiko Tanese,et al. Distributed Genetic Algorithms , 1989, ICGA.