Adaptive parameter control of evolutionary algorithms to improve quality-time trade-off

Applied Soft Computing Journal

Volumn 9, Issue 2, 2009, Pages 527-540

  Aine, Sandip ^a   Kumar, Rajeev ^a   Chakrabarti, P P ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Dynamic programming; Evolutionary algorithm; Meta reasoning; Parameter control; Quality time trade off; Standard cell placement problem; Traveling salesman problem

Indexed keywords

ADAPTIVE ALGORITHMS; ALGORITHMS; COMMERCE; DYNAMIC PROGRAMMING; ELECTRIC BATTERIES; EVOLUTIONARY ALGORITHMS; PROBLEM SOLVING; PROGRAMMING THEORY; STANDARDS; SYSTEMS ENGINEERING; TRAVELING SALESMAN PROBLEM;

EVOLUTIONARY ALGORITHM; META-REASONING; PARAMETER CONTROL; QUALITY-TIME TRADE-OFF; STANDARD CELL PLACEMENT PROBLEM;

QUALITY CONTROL;

EID: 58549100893     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2008.07.001     Document Type: Article

References (40)

1. Eiben A.E., Marchiori E., and Valkó V.A. Evolutionary algorithms with on-the-fly population size adjustment. Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (2004) 41-50
2. Smith J., and Fogarty T.C. Self adaptation of mutation rates in a steady state genetic algorithm. Proceedings of the 7th International Conference on Evolutionary Computation (1996) 318-323
3. Zhu K.Q., and Liu Z. Population diversity in permutation-based genetic algorithm. Proceedings 15th European Conference on Machine Learning (2004), Springer Verlag 537-547
4. Glickman M., and Sycara K. Reasons for premature convergence of self-adapting mutation rates. Proceedings of the 2000 Congress on Evolutionary Computation, Vol. 1 (2000) 62-69
5. Yang S. Adaptive crossover in genetic algorithms using statistics mechanism. Proceedings of the 8th international conference on Artificial Life (2002), MIT Press 182-185
6. Eiben A.E., Hinterding R., and Michalewicz Z. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3 2 (1999) 124-141
7. Wolpert D., and Macready W.G. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1 1 (1997) 67-82
8. Davis L. Adapting operator probabilities in genetic algorithms. Proceedings of the 3rd international conference on Genetic algorithms (1989), Morgan Kaufmann Publishers Inc., San Francisco, CA, USA 61-69
9. Cicirello V., and Smith S. Modeling GA performance for control parameter optimization. Proceedings of the Genetic and Evolutionary Computation Conference:GECCO-2000 (2000)
10. Grefenstette J. Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics 16 1 (1986) 122-128
11. Lee M.A., and Takagi H. Dynamic control of genetic algorithms using fuzzy logic techniques. In: Forrest S. (Ed). Proc. of the Fifth Int. Conf. on Genetic Algorithms (1993), Morgan Kaufmann, San Mateo, CA 76-83
12. Herrera F., and Lozano M. Adaptation of genetic algorithm parameters based on fuzzy logic controllers. In: Herrera F., and Verdegay J.L. (Eds). Genetic Algorithms and Soft Computing (1996), Physika-Verlag 95-125
13. Julstrom B.A. Adaptive operator probabilities in a genetic algorithm that applies three operators. Proceedings of ACM Symposium on Applied Computing (SAC) (1997) 233-238
14. Lis J., and Lis M. Self-adapting parallel genetic algorithm with the dynamic mutation probability, crossover rate and population size. Proceedings of the 1st Polish National Conference on Evolutionary Computation. Ocina Wydawnica Politechniki Warszawskiej (1996) 324-329
15. Dean T., and Boddy M. An analysis of time-dependent planning. Proceedings of 6th National Conference on Artificial Intelligence (AAAI 88) (1988), AAAI Press, St. Paul, MN 49-54
16. Boddy M., and Dean T. Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence 67 (1994) 245-285
17. E.J. Horvitz, Computation and action under bounded resources, Ph.D. thesis, Stanford University (1990).
18. Hansen E.A., and Zilberstein S. Monitoring and control of anytime algorithms: A dynamic programming approach. Artificial Intelligence 126 1-2 (2001) 139-157
19. Larson K., and Sandholm T. Using performance profile trees to improve deliberation control. Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence (2004), AAAI Press, San Jose, California, USA 73-79
20. Russell S.J., and Zilberstein S. Composing real-time systems. In: Mylopous J., and Reiter R. (Eds). Proceedings of the 12th International Conference on Artificial Intelligence (ICJAI-91) (1991), Morgan Kaufmann Publisher Inc., San Mateo, CA, USA 212-217
21. Horvitz E.J. Reasoning about beliefs and actions under computational resource constraints. Proceedings of Workshop on Uncertainty in Artificial Intelligence (1987), AAAI Press
22. S. Zilberstein, Operational rationality through compilation of anytime algorithms, Ph.D. thesis, Computer Science Division, University of California at Berkeley (1993).
23. Finkelstein L., and Markovitch S. Optimal schedules for monitoring anytime algorithms. Artificial Intelligence 126 1-2 (2001) 63-108
24. Garvey A., and Lesser V. Design-to-time real-time scheduling, IEEE Transactions on Systems. Man and Cybernetics 23 6 (1993) 1491-1502
25. Garvey A., and Lesser V. Design-to-time scheduling and anytime algorithms. SIGART Bulletin 7 2 (1996) 16-19
26. Aine S., Kumar R., and Chakrabarti P.P. Adaptive control of anytime algorithm parameters. Proc. Indian International Conference on Artificial Intelligence (2005) 72-87
27. Aine S., Chakrabarti P.P., and Kumar R. Improving the performance of cad optimization algorithms using on-line meta-level control. VLSI Design (2006), IEEE Computer Society 683-688
28. Fukunaga A.S. Genetic algorithm portfolios. Proceedings of the Congress on Evolutionary Computation, Vol. 2 (2000), IEEE Press, La Jolla, CA, USA 1304-1311
29. Gomes C.P., and Selman B. Algorithm portfolios. Artificial Intelligence 126 1-2 (2001) 43-62
30. Ld L.D.W. The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. Proceedings of the 3rd international conference on genetic algorithms (1989) 116-123
31. Jaszkiewicz A. Genetic local search for multi-objective combinatorial optimization. European Journal of Operational Research 137 (2002) 50-71
32. Shahookar K., and Mazumder P. A genetic approach to standard cell placement using meta-genetic parameter optimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 9 5 (1990) 500-511
33. Aine S., Kumar R., and Chakrabarti P.P. Adaptive parameter control of evolutionary algorithms under run-time constraints. Advanced trends in soft-computing techniques (2005), Springer, Verlag, Cranfield, UK
34. Bertsekas D.P. Dynamic Programming: Deterministic and Stochastic Models (1987), Prentice-Hall, Englewood Cliffs, NJ
35. Horvitz E., and Rutledge G. Time-dependent utility and action under uncertainty. Proceedings of 7th Conference on Uncertainty in Artificial Intelligence (1991), AAAI Press, Los Angeles, CA 151-158
36. Swartz W., and Sechen C. Timing driven placement for large standard cell circuits. Proceedings of ACM/IEE Design Automation Conference (1995) 211-215
37. S. Aine, P.P. Chakrabarti, R. Kumar, An automated meta-level control framework for optimizing the quality-time trade-off of vlsi algorithms, Accepted for Publication in IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems (TCAD).
38. Brglez F., and Fujiwara H. A neutral netlist of 10 combinational benchmark circuits and a target translator in Fortran. Proceedings of IEEE Int'l Symposium Circuits and Systems (ISCAS 85) (1985), IEEE Press, Piscataway, NJ 677-692
39. Wang M., Yang X., and Sarrafzadeh M. Dragon2000: Standard-cell placement tool for large industry circuits. ICCAD '00: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000), IEEE Press, Piscataway, NJ, USA 260-263
40. S. Aine, R. Kumar, P.P. Chakrabarti, An adaptive framework for solving mulitple hard problems under time constraints, in: In Proc. International Conference on Computational Intelligence and Security (CIS-05), LNAI 3801/3802, Springer, Xi'an, China, 2005, pp. 57-64.