Impact of neighbourhood size on the process of simulated annealing: computational experiments on the flowshop scheduling problem

Computers and Industrial Engineering

Volumn 37, Issue 1, 1999, Pages 285-288

  Liu, Jiyin ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

FLOWSHOP SCHEDULING; NEIGHBORHOOD SIZE;

SIMULATED ANNEALING;

EID: 0032599538     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(99)00075-3     Document Type: Article

References (9)

1. Cheh, K.M., J.B. Goldberg and R.G. Askin (1991). A note on the effect of neighbourhood structure in simulated annealing. Computers and Operations Research, 18. 537-547.
2. Goldstein, L. and M. Waterman (1988). Neighborhood size in the simulated annealing algorithm. American Journal of Mathematical and Management Sciences, 8, 409-423.
3. Kirkpatrick, S., C.D. Gellat and M.P. Vecchi (1983). Optimization by simulated annealing. Science, 220. 671-680.
4. Koulamas, C., S.R. Antony and R. Jaen (1994). A survey of simulated annealing applications to operations research problems. Omega, 22, 41-56.
5. Liu, J. (1997). Controlling the parameters in simulated annealing for flowshop scheduling. Proceedings of the 14th International Conference of Production Research, 1478-1481.
6. Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285.
7. Van Laarhoven P.J.M. and E.H.L. Aarts (1988). Simulated Annealing: Theory and Applications. Kluwer, Dordrecht.
8. Yao, X. (1991). Simulated annealing with extended neighbourhood. International Journal of Computer Mathematics, 40, 169-189.
9. Yao, X. (1993). Comparison of different neighbourhood sizes in simulated annealing. Proceedings of the Fourth Australian Conference on Neural Networks (ACNN'93), 216-219.