Vinicius Veloso de Melo
ABSTRACT
We have developed an algorithm for reduction of search-space, called Domain Optimization Algorithm (DOA), applied to global optimization. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. DOA basically worksusing simple models for search-space regions to identify and eliminate non-promising regions. The proposed approach has shown relevant results for tests using hard benchmark functions.
- G. E. P. Box, W. G. Hunter, and J. S. Hunter. Statistics for experimenters. John Willey, New York, 1978.Google Scholar
- A. Carlisle and G. Dozier. An off-the-shelf pso. In Proceedings of the Workshop on Particle Swarm Optimization, pages 1--6, Indianapolis, IN, 2001.Google Scholar
- K. Y. Chan, M. E. Aydin, and T. C. Fogarty. A taguchi method-based crossover operator for the parametrical problems. In R. Sarker, R. Reynolds, H. Abbass, K. C. Tan, B. McKay, D. Essam, and T. Gedeon, editors, Proceedings of the 2003 Congress on Evolutionary Computation CEC2003, pages 971--977, Canberra, 8--12 December 2003. IEEE Press.Google ScholarCross Ref
- S. Chen and S. Smith. Improving genetic algorithms by search space reduction (with applications to flow shop scheduling). In GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference. Morgan Kaufmann, 1999.Google Scholar
- D. R. Cox. Planning of Experiments, volume 1. John Wiley and Sons, Inc, 1958.Google Scholar
- R. C. Eberhart and J. Kennedy. A new optimizer using particle swarm theory. In Proceedings of the Sixth International Symposium on Micromachine and Human Science., pages 39--43, Nagoya, Japan, 1995.Google ScholarCross Ref
- R. A. Fisher. The Design of Experiments. Oliver and Boyd, Ltd, Edinburgh and London, 1935.Google Scholar
- D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989. Google ScholarDigital Library
- M. J. Guerra and D. Donaire. Estatistica indutiva: teoria e aplicações. Livraria Ciência e Tecnologia Editora, São Paulo, 2 edition, 2000.Google Scholar
- L. Guo and I. Matta. Search space reduction in qos routing. Comput. Networks, 41(1):73--88, 2003. Google ScholarDigital Library
- D. Heckerman, D. Geiger, and M. Chickering. Learning bayesian networks: The combination of knowledge and statistical data. Technical report, Microsoft Research, Redmond, WA., 1994.Google Scholar
- K. Hinkelmann and O. Kempthorne. Design and Anaysis of Experiments: Introduction to Experimental Design, volume 1. Wiley Series in Probability and Mathematical Statistics, 1994.Google Scholar
- J. J. Liang, P. N. Suganthan, and K. Deb. Novel composition test functions for numerical global optimization. In IEEE Swarm Intelligence Symposium, pages 68--75, 2005.Google ScholarCross Ref
- K.-H. Liang, X. Yao, and C. Newton. Combining landscape approximation and local search in global optimization. In Proceedings of the 1999 Congress on Evolutionary Computation, volume 2, pages 1514--1520, Piscataway, NJ, 1999. IEEE Press.Google Scholar
- K.-H. Liang, X. Yao, and C. Newton. Evolutionary search of approximated n-dimensional landscapes. International Journal of Knowledge-Based Intelligent Engineering Systems, 4(3):172--183, July 2000.Google Scholar
- Y. W. Lung and Y. Wang. An orthogonal genetic algorithm with quantization for global numerical oplimization. In IEEE Transactions on Ewlurionary Computation, volume 5, pages 41--53, 2001. Google ScholarDigital Library
- S. R. S. Magalhaes. A avaliação de métodos para a comparação de modelos de regressão por simulação de dados. Master's thesis, (Mestrado em Estatistica e Experimentação Agropecuária), Universidade Federal de Lavras, Lavras, 2002.Google Scholar
- D. C. Montgomery. Design and Anaysis of Experiments, volume 1. John Wiley and Sons, Inc, 1997. Google ScholarDigital Library
- R. H. Myers and D. C. Montgomery. Response Surface Methodology: Process and Product Optimization Using Designed Experiments. Wiley, New York, second edition, 2002. Google ScholarDigital Library
- M. Pelikan, D. E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Technical Report 99018, IlliGAL Report, 1999.Google Scholar
- A. Ratle. Kriging as a surrogate fitness landscape in evolutionary optimization. Artif. Intell. Eng. Des. Anal. Manuf., 15(1):37--49, 2001. Google ScholarDigital Library
- C. R. Reeves and C. C. Wright. Epistasis in genetic algorithms: an experimental design perspective. In 6th International Conference on Genetic Algorithms, San Mateo, CA, 1995. Morgan Kaufmann. Google ScholarDigital Library
- C. R. Reeves and C. C. Wright. An experimental design perspective on genetic algorithms. In D. Whitley and M. Vosa (Eds.). Foundations of Genetic Algorithms 3, San Mateo, CA, 1995. Morgan Kaufmann. Google ScholarDigital Library
- M. Srinivas and L. M. Patnaik. Learning neural network weights using genetic algorithms--improving performance by search-space reduction. 1991 IEEE International Joint Conference on Neural Networks, 3(IEEE Cat. No. 91CH3065-0):2331-2336, 18-21 Nov 1991.Google ScholarCross Ref
- P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y.-P. Chen, A. Auger, and S. Tiwari. Problem definitions and evaluation criteria for the cec 2005 special session on real-parameter optimization. Technical Report KanGAL Report 2005005, Nanyang Technological University, Singapore, 2005.Google Scholar
- X. Yao, Y. Liu, K.-H. Liang, and G. Lin. Fast evolutionary algorithms. Advances in evolutionary computing: theory and applications, pages 45--94, 2003. Google ScholarDigital Library
- F. Yates. The Design and Anaysis of Factorial Experiments. Number 35. Commonwealth Bureau of Soil Society, Tech. Comm., 1935.Google Scholar
- Q. Zhang and Y. Lung. An orthogonal genetic algorithm for multimedia multicast routing. IEEE Transactions on Evolutionary Computation, 3(I):53--62, 1999. Google ScholarDigital Library
Index Terms
- Improving global numerical optimization using a search-space reduction algorithm
Recommendations
Comparative study of diversity based parallel dual population genetic algorithm for unconstrained function optimisations
The genetic algorithms GAs metaheuristic deals with large scale combinatorial optimisation problems. It is biologically inspired by the method, based on the principle of survival of the fittest. In GAs, the concept of multiple populations offers an ...
Memory, evolutionary operator, and local search based improved Grey Wolf Optimizer with linear population size reduction technique
AbstractOptimization of multi-modal functions is challenging even for evolutionary and swarm-based algorithms as it requires an efficient exploration for finding the promising region of the search space, and effective exploitation to precisely ...
Dynamic partition search algorithm for global numerical optimization
This paper presents a novel evolutionary algorithm entitled Dynamic Partition Search Algorithm (DPSA) for global optimization problems with continuous variables. The DPSA is a population-based stochastic search algorithm in nature, which mainly consists ...
Comments