This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Genetics-Based Learning of New Heuristics: Rational Scheduling of Experiments and Generalization
October 1995 (vol. 7 no. 5)
pp. 763-785

Abstract—In this paper we present new methods for the automated learning of heuristics in knowledge-lean applications and for finding heuristics that can be generalized to unlearned domains. These applications lack domain knowledge for credit assignment; hence, operators for composing new heuristics are generally model-free, domain independent, and syntactic in nature. The operators we have used are genetics-based; examples of which include mutation and cross-over. Learning is based on a generate-and-test paradigm that maintains a pool of competing heuristics, tests them to a limited extent, creates new ones from those that perform well in the past, and prunes poor ones from the pool. We have studied three important issues in learning better heuristics: 1) anomalies in performance evaluation, 2) rational scheduling of limited computational resources in testing candidate heuristics in single-objective as well as multiobjective learning, and 3) finding heuristics that can be generalized to unlearned domains. We show experimental results in learning better heuristics for 1) process placement for distributed-memory multicomputers, 2) node decomposition in a branch-and-bound search, 3) generation of test patterns in VLSI circuit testing, and 4) VLSI cell placement and routing.

[1] D.H. Ackley,A Connectionist Machine for Genetic Hill-Climbing.Boston, Mass.: Kluwer Academic, 1987.
[2] A.K. Aizawa and B.W. Wah,“Scheduling of genetic algorithms in a noisy environment,” Evolutionary Computation, vol. 2, no. 2, pp. 97-122, 1994.
[3] A.N. Aizawa and B.W. Wah,“A sequential sampling procedure for genetic algorithms,” Computers and Mathematics with Applications, vol. 27, no. 9/10, pp. 77-82, May 1994.
[4] R.E. Bechhofer,“A single-sample multiple-decision procedure for ranking means of normal populations with known variances,” Ann. Math. Statist., vol. 25, no. 1, pp. 16-39, Mar. 1954.
[5] R.E. Bechhofer,A.J. Hayter,, and A.C. Tamhane,“Designing experiments for selecting the largest normal mean when the variances are known and unequal:Optimal sample size allocation,” J. Statistical Planning and Inference, vol. 28, pp. 271-289, 1991.
[6] L.B. Booker,D.E. Goldberg,, and J.H. Holland,“Classifier systems and genetic algorithms,” Machine Learning: Paradigm and Methods, J. Carbonell, ed., MIT Press, 1990.
[7] L.-C. Chu and B.W. Wah,“Optimization in real time,” Proc. Real Time Systems Symp., pp. 150-159, Nov. 1991.
[8] L.-C. Chu,“Algorithms for combinatorial optimization in real time and their automated refinement by genetic programming,” PhD thesis, Dept. of Electrical and Computer Eng., Univ. of Illi nois, Urbana, Ill., May 1994.
[9] J.L. Devore,Probability and Statistics for Engineering and the Sciences.Monterey, Calif.: Brooks/Cole, 1982.
[10] J.M. Fitzpatrick and J.J. Grefenstette,“Genetic algorithms in noisy environments,” Machine Learning, vol. 3, no. 2/3, pp. 101-120, Oct. 1988.
[11] C.M. Fonseca and P.J. Fleming,“Genetic algorithms for multiobjective optimization: Formulation, discussion, and generalization,” Proc. Fifth Int’l Conf. Genetic Algorithms, pp. 416-423, June 1993.
[12] F.W. Gembicki,“Vector optimization for control with performance and parameter sensitivity indices,” PhD thesis, Case Western Reserve Univ., Cleveland, 1974.
[13] J.J. Grefenstette,C.L. Ramsey,, and A.C. Schultz,“Learning sequential decision rules using simulation models and competition,” Machine Learning, vol. 5, pp. 355-381, 1990.
[14] A. Ieumwananonthachai,A.N. Aizawa,S.R. Schwartz,B.W. Wah,, and J.C. Yan,“Intelligent mapping of communicating processes in distributed computing systems,” Proc. Supercomputing’91, pp. 512-521,Albuquerque, N.M., Nov. 1991.
[15] A. Ieumwananonthachai,A. Aizawa,S.R. Schwartz,B.W. Wah,, and J.C. Yan,“Intelligent process mapping through systematic improvement of heuristics,” J. Parallel and Distributed Computing, vol. 15, pp. 118-142, June 1992.
[16] J.R. Koza,Genetic Programming.Cambridge, Mass.: MIT Press, 1992.
[17] LayoutSynth92, International Workshop on Layout Synthesis, ftp site: mcnc.mcnc.org in directory /pub/benchmark, 1992.
[18] M.B. Lowrie and B.W. Wah,“Learning heuristic functions for numberic optimization problems,” Proc. Computer Software and Applications Conf., pp. 443-450,Chicago, Oct. 1988.
[19] P. Mehra and B.W. Wah,Load Balancing: An Automated Learning Approach. World Scientific Publishing Co. Pte. Ltd., 1995.
[20] A. Newell,J.C. Shaw,, and H.A. Simon,“Programming the logic theory machine,” Proc. 1957 Western Joint Computer Conf., pp. 230-240, 1957.
[21] T. Niermann and J. Patel, HITEC: A Test Generation Package for Sequential Circuits Proc. European Conf. Design Automation, pp. 214-218, 1991.
[22] J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, Mass., 1984.
[23] C.L. Ramsey and J.J. Grefenstette,“Case-based initialization of genetic algorithms,” Proc. Fifth Int’l Conf. Genetic Algorithms, pp. 84-91, June 1993.
[24] D.G. Saab,Y.G. Saab,, and J.A. Abraham,“CRIS: A test cultivation program for sequential VLSI circuits,” Proc. Int’l Conf. Computer Aided Design, pp. 216-219,Santa Clara, Calif., 1992.
[25] S.R. Schwarta and B.W. Wah,“Automated parameter tuning in stereo vision under time constraints,” Proc. Int’l Conf. Tools for Artificial Intelligence, pp. 162-169, Nov. 1992.
[26] C. Sechen and A. Sangiovanni-Vincentelli, "The TimberWolf Placement and Routing Package," IEEE J. Solid-State Circuits, vol. 20, no. 3, pp. 510-522, Apr. 1985.
[27] C. Sechen,VLSI Placement and Global Routing Using Simulated Annealing.Boston: Kluwer Academic, 1988.
[28] R.S. Sutton,“Temporal credit assignment in reinforcement learning,” PhD thesis, Univ. of Massachusetts, Amherst, Mass., Feb. 1984.
[29] C.-C. Teng and B.W. Wah, “An Automated Design System for Finding the Minimal Configuration of a Feed-Forward Neural Network,” Proc. IEEE Int'l Conf. Neural Networks, pp. 1295-1300, June 1994.
[30] Y.L. Tong and D.E. Wetzell,“Allocation of observations for selecting the best normal population,” Design of Experiments: Ranking and Selection, T.J. Santner and A.C. Tamhane, eds., pp. 213-224.New York: Marcel Dekker, 1984.
[31] B.W. Wah,“Population-based learning: A new method for learning from examples under resource constraints,” IEEE Trans. Knowledge and Data Engineering, vol. 4, no. 5, pp. 454-574, Oct. 1992.
[32] J.C. Yan and S.F. Lundstrom,“The Post-Game analysis framework—developing resource management strategies for concurrent systems,” IEEE Trans. Knowledge and Data Engineering, vol. 1, no. 3, pp. 293-309, Sept. 1989.
[33] C.F. Yu and B.W. Wah,“Learning dominance relations in combinatorial search problems,” IEEE Trans. Software Engineering, vol. 14, no. 8, pp. 1,155-1,175, Aug. 1988.

Index Terms:
Branch-and-bound search, generalization, genetics-based learning, heuristics, knowledge-lean applications, performance evaluation, process mapping, resource scheduling, VLSI circuit testing, VLSI placement and routing..
Citation:
Benjamin W. Wah, Arthur Ieumwananonthachai, Lon-Chan Chu, Akiko N. Aizawa, "Genetics-Based Learning of New Heuristics: Rational Scheduling of Experiments and Generalization," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 5, pp. 763-785, Oct. 1995, doi:10.1109/69.469821
Usage of this product signifies your acceptance of the Terms of Use.