Z. Michalewicz
- 1 Antonisse, J. A New Interpretation of Schema Notation that Overturns the Binary Encoding Constraint. In {29}. Google Scholar
Digital Library
- 2 Brooke, A., Kendrick, D., and Meeraus, A. GAMS: A User's Guide. The Scientific Press, 1988.Google ScholarDigital Library
- 3 Bosworth, J., Foo, N., and Zeigler, B.P. Comparison of Genetic Algorithms with Conjugate Gradient Methods NASA (CR-2093),Washington, D.C., 1972.Google Scholar
- 4 Davis, L., (Ed.) Genetic Algorithms and Simulated Annealing Pitman, London, 1987. Google ScholarDigital Library
- 5 De Jong, K.A. Genetic Algorithms: A 10 Year Perspective In {9}, pp. 169-177. Google ScholarDigital Library
- 6 Dhar, V. and Ranganathan, N. Integer programming vs. expert systems: An experimental comparison Commun ACM 33, 3 (1990). Google ScholarDigital Library
- 7 Goldberg, D.E. Dynamic system control using rule learning and genetics algorithms In Proceedings of the International Joint Conference on Artificial Intelligence, 1985.Google Scholar
- 8 Goldberg, D.E. Genetic Algorithms in Search, Optimization and Machine Learning Addison Wesley, 1989. Google ScholarDigital Library
- 9 Grefenstette, J.J. Proceedings of the First International Conference on Genetic Algorithms. (Pittsburg, July 1985) Lawrence Erlbaum. Google ScholarDigital Library
- 10 Grefenstette, J.J. Optimization of control parameters for genetic algorithms. IEEE Trans Syst. Man, and Cybernetics, SMC-16, 1. 1986. Google ScholarDigital Library
- 11 Grefenstette, J.J. Incorporating Problem Specific Knowledge into Genetic Algorithms. In {4}.Google Scholar
- 12 Grefenstette, J.J. Proceedings of the Second International Conference on Genetic Algorithms. (Cambridge, July 1987). Lawrence Erlbaum.Google Scholar
- 13 Groves, L., Michalewicz, Z., Elia, P., Janikow, C. Genetic algorithms for drawing directed graphs. Proceedings of the Fifth International Symposium on Methodologies of Intelligent Systems. (Knoxville, 1990).Google Scholar
- 14 Holland, J. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Mich., 1975. Google ScholarDigital Library
- 15 Holland, J. Escaping Brittleness, in Machine Learning II. R. Michalski, J. Carbonell, T. Mitchel, Morgan Kaufmann, Los Altos, Calif., 1986.Google Scholar
- 16 Janikow, C., and Michalewicz, Z. Specialized genetic algorithms for numerical optimization problems. Proceedings of the International Conference on Tools for AI. (Washington, Nov. 1990).Google ScholarCross Ref
- 17 Janikow, C., and Michalewicz, Z. On the convergence problem in genetic algorithms. Fundamenta Informaticae (1991).Google Scholar
- 18 Leler, W. Constraint Programming Languages: Their Specifications and Generation. Addison Wesley, 1988. Google ScholarDigital Library
- 19 Michalewicz, Z., Vignaux, G.A., Groves, L. Genetic algorithms for optimization problems. Proceedings of the 1 l th NZ Computer Conference. (Wellington, New Zealand, Aug 1989).Google Scholar
- 20 Michalewicz, Z. EVA Programming Environment. UNCC Technical Report. 1990.Google Scholar
- 21 Michalewicz, Z. and Janikow, C. Genetic algorithms for numerical optimization. Statistics and Computing, 1, 2 (1991).Google ScholarCross Ref
- 22 Michalewicz, Z. and Schell J. Data Structures ~ Genetic Operators = Evolution Programs. UNCC Technical Report. 1990.Google Scholar
- 23 Michalewicz, Z., Vignaux, G.A., Hobbs, M. A genetic algorithm for the nonlinear transportation problem. ORSA Journal on Computing, 1991.Google ScholarCross Ref
- 24 Michalewicz, Z., Jankowski, A., Vignaux, G.A. The Constraints Problem in Genetic Algorithms, in Methodologies of Intelligent Systems: Selected Papers. M.L. Emrich, M.S. Phifer, B. Huber, M. Zemankova, Z. Ras (Eds), 1990.Google Scholar
- 25 Michalewicz, Z., Krawczyk, J., Kazemi, M, Janikow, C. Genetic algorithms and optimal control problems. Proceedings of the 29th IEEE Conference on Decision and Control. (Honolulu, Dec. 1990).Google ScholarCross Ref
- 26 Richardson, J.T., Palmer, M.R., Liepins, G., and Hilliard, M. Some Guidelines for Genetic Algorithms with Penalty Functions, in {29}. Google ScholarDigital Library
- 27 Sasieni, M., Yaspan, A., and Friedman, L. Operations Research Methods and Problems. John Wiley and Sons, 1959.Google Scholar
- 28 Schaffer, J., Caruana, R., Eshelman, L., and Das, R. A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization. In {29}. Google ScholarDigital Library
- 29 Schaffer, J. Proceedings of the Third International Conference on Genetic Algorithms. (George Mason Univ. June 1989. Morgan Kaufmann. Google ScholarDigital Library
- 30 Siedlecki, W. and Sklanski, J. Constrained Genetic Optimization via Dynamic Reward-Penalty Balancing and Its Use in Pattern Recognition. In {29}. Google ScholarDigital Library
- 31 Taha, H.A. Operations Research: An Introduction, 4th ed. Collier Macmillan, London, 1987. Google ScholarDigital Library
- 32 Vignaux, G.A. and Michalewicz, Z. Genetic algorithms for the transportation problem. Proceedings of the 5th International Symposium on Methodologies for Intelligent Systems. Charlotte, N.C. Oct. 1989.Google Scholar
- 33 Vignaux, G.A. and Michalewicz, Z. A genetic algorithm for the linear transportation problem. IEEE Trans. Syst., Man, and Cybernetics 21, 2. 1991.Google Scholar
Index Terms
- GENOCOP: a genetic algorithm for numerical optimization problems with linear constraints
Recommendations
An improved genetic algorithm with conditional genetic operators and its application to set-covering problem
The genetic algorithm (GA) is a popular, biologically inspired optimization method. However, in the GA there is no rule of thumb to design the GA operators and select GA parameters. Instead, trial-and-error has to be applied. In this paper we present an ...
Hybrid Taguchi-genetic algorithm for global numerical optimization
In this paper, a hybrid Taguchi-genetic algorithm (HTGA) is proposed to solve global numerical optimization problems with continuous variables. The HTGA combines the traditional genetic algorithm (TGA), which has a powerful global exploration capability,...
Kursawe and ZDT functions optimization using hybrid micro genetic algorithm (HMGA)
A hybrid micro genetic algorithm (HMGA) is proposed for Pareto optimum search focusing on the Kursawe and ZDT test functions. HMGA is a fusion of the micro genetic algorithm (MGA) and the elitism concept of fast Pareto genetic algorithm. The ...
Comments