next up previous
Next: About this document Up: No Title Previous: Acknowledgments

References

1
Aarts, E. H, J. Korst, and P. J. van Laarhoven, ``Simulated annealing,'' in Local Search in Combinatorial Optimization, E. H. Aarts and J. K. Lenstra (eds.), John Wiley and Sons. (to appear in 1997)

2
Abramson, D, ``Constructing school timetables using simulated annealing: sequential and parallel algorithms,'' Management Science, 37(1), 98-113, 1991.

3
Abramson, D., H. Dang, and M. Krishnamoorthy, ``An Empirical Study of Simulated Annealing Cooling Schedules,'' Griffith Univ. report, Nathan, Qld, Aus. 1994; ``Simulated Annealing Cooling Schedules for the School Timetabling Problem,'' submitted to Asia Pacific Journal of Operations Research, 1996.

4
Applied Simulated Annealing, Rene Vidal (ed), Lecture Notes in Economics and Mathematical Systems no. 396, Springer-Verlag, 1993.

5
de Werra, D, ``An introduction to timetabling,'' European Journal of Operational Research, 19, 151-162, 1985.

6
Diekmann, R, R. Lüling, and J. Simon, ``Problem independent distributed simulated annealing and its applications,'' in Applied Simulated Annealing, R. V. Vidal (ed), Lecture Notes in Economics and Mathematical Systems, Springer 1993.

7
Dowsland, K., Using Simulated Annealing for Efficient Allocation of Students to Practical Classes. Stat and OR Group, EBMS, Univ College of Swansea, UK, 1993.

8
Dowsland, K. and J. Thompson, ``Variants of Simulated Annealing for the Examination Timetabling Problem,'' Working Paper, Statistics and OR Group, European Business Management School, Swansea SA2 8PP, UK. (1994)

9
Eiselt H. A, and G. Laporte, ``Combinatorial Optimization Problems with Soft and Hard Requirements,'' J. Operational Research Society, vol. 38, No. 9, pp. 785-795, 1987.

10
Elmohamed, S., G. C. Fox, P. Coddington, ``Course Scheduling using Mean-Field Annealing, Part I: algorithm and Part II: implementation,'' Northeast Parallel Architectures Center technical report SCCS-782, Syracuse University, 1996.

11
Elmohamed, S., P. Coddington, G.C. Fox, ``Academic Scheduling using Simulated Annealing with a Rule-Based Preprocessor'', Northeast Parallel Architectures Center technical report SCCS-781, Syracuse University, 1997.

12
Gisl tex2html_wrap_inline1051 n, L, Bo S tex2html_wrap_inline1053 derberg, C. Peterson, ``Teachers and Classes with Neural Nets,'' Inter. Jr. of Neural Systems 1, 167 (1989).

13
Gisl tex2html_wrap_inline1051 n, L, Bo S tex2html_wrap_inline1053 derberg, C. Peterson, ``Scheduling High Schools with Neural Nets,'' Lund University Preprint LU-TP-91-9, Lund, Sweden (1991), (appeared in Neural Computation 1992).

14
Hogg, T, B. Huberman, and C. Williams (editors), Artificial Intelligence, special issue on Phase transitions and the search space, 81, 1996.

15
Hopfield, J. J, and D. W. Tank, ``Neural Computation of Decisions in Optimization Problems,'' Biological Cybernetics 52, 141 (1985).

16
Huang, M, F. Romeo, and A. Sangiovanni-Vincentelli, ``An efficient general cooling schedule for simulated annealing,'' IEEE International Conf. on Computer Aided Design (ICCAD), 1986, pp. 381-384.

17
Johnson, D, C. Aragon, L. McGeoch, and C. Schevon, ``Optimization by Simulated Annealing: an Experimental Evaluation, Part I (Graph Partitioning),'' Operations Research 37, 865-892 (1989).

18
Johnson, D, C. Aragon, L. McGeoch, and C. Schevon, ``Optimization by Simulated Annealing: an Experimental Evaluation, Part II (Graph Coloring and number partitioning),'' Operations Research 39, No. 3, 865-892 (1991).

19
Johnson, D, and L. McGeoch, ``The Traveling Salesman Problem: A Case Study in Local Optimization,'' in Local Search in Combinatorial Optimization, E. H. Aarts and J. K. Lenstra (eds.), Wiley and Sons. (to appear in 1997).

20
Kirkpatrick, S, C. D. Gelatt, Jr., and M. P. Vecchi, ``Optimization by Simulated Annealing,'' Science 220 (13 May 1983), 671-680.

21
Kirkpatrick, S, ``Optimization by simulated annealing: Quantitative studies,'' J. Stat. Physics 34 (1984), 976-986.

22
Lister, R.,''Annealing Networks and Fractal Landscapes,'' Proc. IEEE Int. Conf. on Neural Nets, March 1993, Vol. I, pp 257-262.

23
Miner, S., S. Elmohamed, and H. W. Yau, ``Optimizing Timetabling Solutions Using Graph Coloring,'' 1995 NPAC REU program, NPAC, Syracuse University, 1995.

24
Mouritsen, O. G., Computer Studies of Phase Transitions and Critical Phenomena. Springer-Verlag, Berlin, 1984.

25
Otten, R, and L. van Ginneken, The Annealing Algorithm. Kluwer Academic Publishers, 1989.

26
Peterson, C, and Bo S tex2html_wrap_inline1053 derberg, ``Artificial Neural Networks and Combinatorial Optimization Problems,'' To appear in Local Search in Combinatorial Optimization, E.H.L. Aarts and J.K. Lenstra, eds. Wiley and Sons. (to appear 1997)

27
Peterson, C, and Bo S tex2html_wrap_inline1053 derberg, ``A New Method for Mapping Optimization Problems onto Neural Nets'', International Jr. of Neural Systems 1, 3 (1989).

28
Schaerf, A, ``A survey of automated timetabling,'' Department of Software Technology, Report CS-R9567, CWI, Amsterdam, The Netherlands.

29
Thompson, J, and K. Dowsland, ``General Cooling Schedules for Simulated Annealing Based Timetabling Systems,'' Proceedings of the 1st International Conf. on the Practice and Theory of Automated Timetabling, Napier Univ., Edinburgh 1995.

30
van Laarhoven, P. J. and E. H. Aarts, Simulated Annealing: Theory and Applications. D. Reidel, Dordrecht (1987).

31
White, S. R, ``Concepts of scale in simulated annealing,'' Proceedings of the IEEE Int. Conference on Circuit Design, pp 646-651, 1984.


Saleh Elmohamed
Tue Apr 29 19:08:49 EDT 1997