Placing computations by adaptive procedures

Artificial Intelligence in Engineering

Volumn 11, Issue 3 SPEC. ISS., 1997, Pages 307-317

  Hower, Walter ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Evolutionary placement computing; Topological layout relations

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; OPERATIONS RESEARCH; PROBLEM SOLVING; TOPOLOGY;

HETEROGENEOUS LAYOUT CONFIGURATIONS; PLACEMENT COMPUTING;

COMPUTER AIDED DESIGN;

EID: 0031191319     PISSN: 09541810     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0954-1810(96)00049-0     Document Type: Article

References (53)

1. Hower, W., Constraint satisfaction - algorithms and complexity analysis. Information Processing Letters, 11 August 1995, 55(3), 171-8.
2. Hower, W. & Jacobi, S., A distributed realization for constraint satisfaction. In Parallel Processing for Artificial Intelligence 2, Vol. 15 of Machine Intelligence and Pattern Recognition series, ed. H. Kitano et al. Elsevier Science Publishers B.V., Amsterdam, 1994, pp. 107-16.
3. Abel, D. J., Ooi, B. C., Tan, K. L., Power, R. & Yu, J. X., Spatial join strategies in distributed spatial DBMS. In Advances in Spatial Databases, Vol. 951 of Lecture Notes in Computer Science, ed. M. J. Egenhofer & J. R. Herring. Springer-Verlag, Berlin/Heidelberg, August 6-9, 1995, pp. 348-67.
4. Zahn, M. & Hower, W., Backtracking along with constraint processing and their time complexities. Journal of Experimental & Theoretical Artificial Intelligence, January-March 1996, 8(1), 63-74.
5. Hower, W. & Graf, W. H., A bibliographical survey of constraint-based approaches to CAD, graphics, layout, visualization, and related topics. Knowledge-Based Systems, 1996, 9(7), 449-464.
6. Hower, W., Bottom-up layout generation. Informatica, February 1996, 20(1), 57-63.
7. Hower, W., Haroud, D. & Ruttkay, Z. (eds.), Constraint Processing in Computer-Aided Design (CoPiCAD-94), Workshop Notes, Third International Conference on Artificial Intelligence in Design (AID'94), Swiss Federal Institute of Technology, Lausanne, Switzerland, 14-18 August 1994.
8. Dowsland, K. A. & Dowsland, W. B., Packing problems. European Journal of Operational Research, 1992, 56, 2-14.
9. Hadjiconstantinou, E. & Christofides, N., An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operational Research, May 18, 1995, 83(1), 39-56.
10. Bremermann, H. J., Optimization through evolution and recombination. In Self-organizing Systems 1962, ed. M. C. Yovits, G. T. Jacobi & G. D. Goldstein. Spartan Books, Washington, DC, 1962, pp. 93-106.
11. Davis, L. (ed.), Genetic Algorithms and Simulated Annealing, Research Notes in Artificial Intelligence. Pitman, London, Morgan Kaufmann, Los Altos, CA, 1987.
12. Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.
13. Forrest, S., Genetic algorithms: principles of natural selection applied to computation. Science, 13 August 1993, 261, 872-8.
14. Beasley, D., Bull, D. R. & Martin, R. R., An overview of genetic algorithms: Part 1, fundamentals. University Computing, 1993, 15(2), 58-69.
15. Beasley, D., Bull, D. R. & Martin, R. R., An overview of genetic algorithms: Part 2, research topics. University Computing, 1993, 15(4), 170-81.
16. Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution Programs. Third, revised and extended edition. Springer-Verlag, Berlin/Heidelberg, 1996.
17. Mitchell, M., An Introduction to Genetic Algorithms. Complex Adaptive Systems. A Bradford Book. The MIT Press, Cambridge, MA, 1996.
18. Aarts, E. & Korst, J., Simulated Annealing and Boltzmann Machines. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley, Chichester, 1989.
19. Rutenbar, R. A., Simulated annealing algorithms: an overview. IEEE Circuits and Devices Magazine, January 1989, 19-26.
20. Eglese, R. W., Simulated annealing: a tool for operational research. European Journal of Operational Research, 1990, 46(3), 271-281.
21. Nakakuki, Y. & Sadeh, N., Increasing the efficiency of simulated annealing search by learning to recognize (un)promising runs. In Twelfth National Conference on Artificial Intelligence, Seattle, Washington, July 31-August 4, 1994. American Association for Artificial Intelligence.
22. Løkketangen, A., Tabu search - using the search experience to guide the search process. An introduction with examples. AI Communications, June 1995, 8(2), 78-85.
23. Dockx, K. & Lutsko, J. F., SA/GA: survival of the fittest in Alaska. In Selecting Models from Data: AI and Statistics IV, ed. P. Cheeseman & R. W. Oldford. Springer-Verlag, 1994, pp. 463-9.
24. Leung, W.-n., Sheung, J., Chan, H. W. & Chan, M., An empirical study on search algorithms that utilize randomness. In PRICAI'94, Proceedings of the Third Pacific Rim International Conference on Artificial Intelligence. International Academic Publishers, Beijing, PR China, 15-18 August 1994, pp. 64-9.
25. Kido, T., Takagi, K. & Nakanishi, M., Analysis and comparisons of genetic algorithm, simulated annealing, TABU search, and evolutionary combination algorithm. Informatica, December 1994, 18(4), 399-410.
26. Reeves, C. R. (ed.), Modern Heuristic Techniques for Combinatorial Problems. Advanced Topics in Computer Science. Blackwell Scientific Publications, Oxford, 1993.
27. Schwefel, H.-P., Evolution and Optimum Seeking. Sixth-Generation Computer Technology Series. A Wiley-Interscience Publication. John Wiley, New York, 1995.
28. Schwefel, H.-P. & Rudolph, G., Contemporary evolution strategies. In Advances in Artificial Life, Vol. 929 of Lecture Notes in Artificial Intelligence, Subseries of Lecture Notes in Computer Science, ed. F. Moran et al., Springer-Verlag, Berlin/Heidelberg, June 4-6, 1995, pp. 893-907.
29. De Jong, K. & Spears, W., On the state of evolutionary computation. In ICGA-93, Proceedings of the Fifth International Conference on Genetic Algorithms, ed. S. Forrest. Morgan Kaufmann Publishers, San Mateo, California, 1993, pp. 618-23.
30. Rechenberg, I., Evolutionsstrategie '94, Vol. 1 of Werkstatt Bionik und Evolutionstechnik. Frommann-holzboog, Stuttgart, 1994.
31. Fogel, D. B., Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway, NJ, 1995.
32. Stube, B., Ein konstruktives Verfahren zur Plazierung allgemeiner Strukturen unter Berücksichtigung von Constraints. In Computergrafik und automatisierte Layout-synthese, ed. A. Iwainsky, Wartburg, 11-13 October 1993, GI. 3. Workshop, pp. 71-81.
33. Tsang, E. P. K. & Warwick, T., Applying genetic algorithms to constraint satisfaction optimization problems. In ECAI 90, Proceedings of the 9th European Conference on Artificial Intelligence, ed. L. C. Aiello. Stockholm, Sweden, August 6-10, 1990. European Coordinating Committee for Artificial Intelligence (ECCAI), Pitman Publishing, London, pp. 649-54.
34. Paredis, J., Genetic state-space search for constrained optimization problems. In IJCAI-93, Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, ed. R. Bajcsy. Chambéry, Savoie, France, August 28-September 3, 1993. IJCAII. Morgan Kaufmann, San Mateo, CA, pp. 967-72.
35. Eiben, A. E., Raué, P.-E. & Ruttkay, Zs., Heuristic genetic algorithms for constrained problems Part II: Empirical results. Rapportnr. IR-351, Artificial Intelligence Group, Faculteit der Wiskunde en Informatica, Vrije Universiteit Amsterdam, December 1994.
36. Bowen, J. A. & Dozier, G. V., Constraint satisfaction using a hybrid evolutionary hill-climbing algorithm that performs opportunistic arc and path revision. In Thirteenth National Conference on Artificial Intelligence, Portland, Oregon, August 4-8, 1996. American Association for Artificial Intelligence, AAAI Press, Menlo Park, CA.
37. Minton, S., Johnston, M. D., Philips, A. B. & Laird, P., Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. In Constraint-Based Reasoning, ed. E. C. Freuder & A. K. Mackworth. Special Issues of Artificial Intelligence, A Bradford Book, The MIT Press, Cambridge, MA, 1994, pp. 161-205.
38. Davis, L., Applying adaptive algorithms to epistatic domains. In IJCAI 85, Vol. I, ed. A. Joshi. Los Angeles, 18-23 August 1985. Morgan Kaufmann, Los Altos, California, pp. 162-4.
39. Smith, D., Bin packing with adaptive search. In Proceedings of an International Conference on Genetic Algorithms and their Applications, ed. J. J. Grefenstette. Lawrence Erlbaum Associates, Hillsdale, NJ, 1985, pp. 202-7.
40. Falkenauer, E. & Delchambre, A., A genetic algorithm for bin packing and line balancing. In Proceedings of the 1992 IEEE International Conference on Robotics and Automation, Nice, France, May 1992, pp. 1186-92.
41. Kröger, B., Guillotineable bin packing: A genetic approach. European Journal of Operational Research, August 3, 1995, 84(3), 645-61. Special Issue, Cutting and Packing.
42. Reeves, C., Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research, J. C. Baltzer A.G. Scientific Publishing Company, 1995.
43. Chan, H., Mazumder, P. & Shahookar, K., Macro-cell and module placement by genetic adaptive search with bitmap-represented chromosome. INTEGRATION, the VLSI journal, 1991, 12, 49-77.
44. Tam, K. Y., Genetic algorithms, function optimization, and facility layout design. European Journal of Operational Research, 1992, 63(2), 322-46.
45. Kado, K., Ross, P. & Corne, D., A study of genetic algorithm hybrids for facility layout problems. In The 6th International Conference on Genetic Algorithms (ICGA-95), University of Pittsburgh, PA, July 15-19, 1995.
46. Thornton, A. C., Genetic algorithms versus simulated annealing: satisfaction of large sets of algebraic mechanical design constraints. In Artificial Intelligence in Design '94, ed. J. S. Gero & F. Sudweeks. Kluwer Academic Publishers, Dordrecht, August 1994, pp. 381-98.
47. Kämpke, T., Simulated annealing: use of a new tool in bin packing. Annals of Operations Research, 1988, 16, 327-332.
48. Bolz, D. & Wittur, K., Die Umsetzung deklarativer Beschreibungen von Graphiken durch Simulated Annealing. In Graphik und KI, Vol. 239 of Informatik-Fachberichte, ed. K. Kansy & P. Wißkirchen. Springer-Verlag, GI-Fachgespräch, Königswinter, 3/4 April 1990, pp. 68-77.
49. Cagan, J., Shape annealing solution to the constrained geometric knapsack problem. Computer-Aided Design, October 1994, 26(10), 763-770.
50. Lüders, P. & Ernst, R., Das Automatisierte Bildschirm-layout - Ein Kombinatorisches Optimierungsproblem? Informatik Forschung und Entwicklung, 1995, 10(1), 1-13.
51. Souilah, A., Simulated annealing for manufacturing systems layout design. European Journal of Operational Research, May 4, 1995, 82(3), 592-614.
52. Bland, J. A. & Dawson, G. P., Tabu search and design optimization. Computer-Aided Design, April 1991, 23(3), 195-201.
53. Grigni, M., Papadias, D. & Papadimitriou, C., Topological inference. In IJCAI-95, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Vol. 1, ed. C. S. Mellish, Montréal, Québec, Canada, August 20-25, 1995. Morgan Kaufmann, San Mateo, CA, pp. 901-6.