论文信息 - Uniting probabilistic methods for optimization

Uniting probabilistic methods for optimization

We integrate the following probabilistic search methods: simulated annealing, [a probabilistic version oil tabu search, and [a radically-modified version ofl genetic algorithms. In addition, we use a rejectionless version of simulated annealing, alone or in combination with the other two methods, while in contrast to previous work neither explicitly nor implicitly altering the cooling schedule. We note the implication of this for speed-up when searches are carried out independently on parallel processors.

Bennett L. Fox | B. Fox

[1] H. Johnson,et al. A comparison of 'traditional' and multimedia information systems development practices , 2003, Inf. Softw. Technol..

[2] Billy E. Gillett,et al. A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks , 1991, INFORMS J. Comput..

[3] Linus Schrage,et al. A guide to simulation , 1983 .

[4] J. Keilson. Markov Chain Models--Rarity And Exponentiality , 1979 .

[5] G. Shedler,et al. Simulation of Nonhomogeneous Poisson Processes by Thinning , 1979 .

[6] Kenneth J. Supowit,et al. Simulated Annealing Without Rejected Moves , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[9] Paul Bratley,et al. A guide to simulation (2nd ed.) , 1986 .

[10] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .

[11] T. Chiang,et al. On the convergence rate of annealing processes , 1987 .

[12] L. Devroye. Non-Uniform Random Variate Generation , 1986 .

[13] Chiang Tzuu-Shuh,et al. On the convergence rate of annealing processes , 1988 .

[14] Bennett L. Fox,et al. Integrating and accelerating tabu search, simulated annealing, and genetic algorithms , 1993, Ann. Oper. Res..