Optimizing simulated annealing schedules with genetic programming

European Journal of Operational Research

Volumn 92, Issue 2, 1996, Pages 402-416

  Bölte, Andreas ^a   Thonemann, Ulrich Wilhelm ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Genetic programming; Optimization; Quadratic assignment problem; Simulated annealing

Indexed keywords

COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIALS; SCHEDULING; SIMULATED ANNEALING;

ANNEALING SCHEDULES; GENETIC PROGRAMMING; QUADRATIC ASSIGNMENT PROBLEM;

OPERATIONS RESEARCH;

EID: 0030196437     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00350-5     Document Type: Article

References (38)

1. Anily, S., and Federgruen, A., "Simulated annealing methods with general acceptance probability", Journal of Applied Probability 24 (1987) 657-667.
2. Armour, G.C., and Buffa, E.S., "A heuristic algorithm and simulation approach to the relative location of facilities", Management Science 9/2 (1963) 294-304.
3. Bazaraa, M.S., and Sherali, M.D., "Bender's partitioning scheme applied to a new formulation of the Quadratic Assignment Problem", Naval Research Logistics Quarterly 27/1 (1980) 29-41.
4. Bölte, A., Modelle und Verfahren zur innerbetrieblichen Standortplanung, Physica-Verlag, Heidelberg, 1994.
5. Burkard, R.E., "Quadratic Assignment Problems", European Journal of Operational Research 15 (1984) 283-289.
6. Burkard, R.E., and Offermann, J., "Entwurf von Schreibmaschinentastaturen mittels Quadratischer Zuordnungsprobleme", Zeitschrift für Operations Research 21 (1977) 121-132.
7. Burkard, R.E., and Rendl, F., "A thermodynamically motivated simulation procedure for combinatorial optimization procedures". European Journal of Operational Research 17 (1984) 169-174.
8. Connolly, D.T., "An improved annealing scheme for the QAP", European Journal of Operational Research 46 (1990) 93-100.
9. Davis, L., Genetic Algorithms and Simulated Annealing, Research Notes in Artificial Intelligence, Pitman, 1987.
10. Davis, L., and Ritter, F., "Schedule optimization with probabilistic search", IEEE (1987) 231-235.
11. Dutta, A., and Koehler, G., "A Whinston: On optimal allocation in a distributed processing environment", Management Science 28 (1982) 839-853.
12. Gavett, J.W., and Plyter, N.V., "The optimal assignment of facilities to locations by branch and bound", Operations Research 14/2 (1966) 210-232.
13. Geman, S., and Geman, D., "Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images",IEEE Transactions on Pattern Analysis and Machine Intelligence 6/5 (1984) 721-741.
14. Gilmore, P.C., "Optimal and suboptimal algorithms for the Quadratic Assignment Problem", SIAM Journal 10/2 (1962) 305-313.
15. Glover, F., "Tabu Search, Part I", ORSA Journal on Computing 1 (1989) 190-206.
16. Glover, F., "Tabu Search, Part II", ORSA Journal on Computing 2 (1990) 4-32.
17. Golden, B.L., and Skiscim, C.C., "Using Simulated Annealing to solve routing and location problems", Naval Research Logistics Quarterly 33/2 (1986) 261-279.
18. Hillier, F.S., "Quantitative tools for plant layout analysis", Journal of Industrial Engineering 14/1 (1963) 33-40.
19. Hillier, F.S., and Connors, M.M., "Quadratic Assignment Problem algorithms and the location of indivisible facilities", Management Science 13 (1966) 42-57.
20. Holland, J.H., Adoption in Natural and Artificial Systems, University of Michigan Press, 1975.
21. Huntley, C.L., and Brown, D.E., "A parallel heuristic for Quadratic Assignment Problems", Computers and Operations Research 18/3 (1991) 275-289.
22. Kirkpatrick, S., Gelatti, C.D., and Vecchi, M.P., "Optimization by Simulated Annealing", Science 220 (1983) 671-680.
23. Koopmans, T.C., and Beckman, M.J., "Assignment problems and the location of economic activities", Econometrica 25/1 (1957) 53-76.
24. Koza, J.R., Genetic Programming: On the Programming of Computers by Means of Natural Selection and Genetics. MIT Press, Cambridge, MA, 1993.
25. Lawler, E.L., "The Quadratic Assignment Problem", Management Science 9/4 (1963) 586-599.
26. Lee, R.C., and Moore, J.M., "CORELAP - Computerized Relationship Layout Planning", Journal of Industrial Engineering 18/3 (1967) 195-200.
27. Lundy, M., and Mess, A., "Convergence of an annealing algorithm", Mathematical Programming 34 (1986) 111-124.
28. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E., "Equation of state calculation by fast computing machines", Journal of Chemical Physics 21 (1953) 1087-1092.
29. Nugent, C.E., Vollmann, T.E., and Ruml, J., "An experimental comparison of techniques for the assignment of facilities to locations", Operations Research 16/1 (1968) 150-173.
30. Sahni, S., and Gonzalez, T., "P-complete approximation problems", Journal of the Association for Computing Machinery 23 (1976) 555-565.
31. Schwarze, J., Grundlagen der Statistik: Wahrscheinlichkeitsrechnung und induktive Statistik, Verlag Neue Wirtschafts-Briefe, 1986.
32. Skorin-Kapov, J., "Tabu Search applied to the Quadratic Assignment Problem", ORSA Journal on Computing 2/1 (1990) 33-45.
33. Steinberg, L., "The backboard wiring problem: A placement algorithm," SlAM Review 3 (1961) 37-50.
34. Thonemann, U.W., Verbesserung des Simulated Annealing unter Anwendung Genetischer Programmierung am Beispiel des Diskreten Quadratischen Layoutproblems, Master's Thesis, Lehrstuhl für Betriebswirtschaftslehre, insbes. Produktionswirtschaft, Universität Paderborn, Germany, November 1992.
35. Thonemann, U.W., "Finding improved annealing schedules with Genetic Programming," Proceedings of The First IEEE Conference on Evolutionary Computation, 1994, 391-395.
36. Vollmann, T., and Buffa, E., "The facilities layout problem in perspective," Management Science 12 (1966) 450-468.
37. Wilensky, R., Common LISPcraft, Norton, 1986.
38. Wilhelm, M.R., and Ward, T.L., "Solving Quadratic Assignment Problems by Simulated Annealing," IIE Transactions 19/1 (1987) 107-119.