Abstract
Due to the vagaries of optimization problems encountered in practice, users resort to different algorithms for solving different optimization problems. In this paper, we suggest an optimization procedure which specializes in solving multi-objective, multi-global problems. The algorithm is carefully designed so as to degenerate to efficient algorithms for solving other simpler optimization problems, such as single-objective uni-global problems, single-objective multi-global problems and multi-objective uni-global problems. The efficacy of the proposed algorithm in solving various problems is demonstrated on a number of test problems. Because of it’s efficiency in handling different types of problems with equal ease, this algorithm should find increasing use in real-world optimization problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Deb, K.: Genetic algorithms in multi-modal function optimization. Master’s thesis, Tuscaloosa, AL, University of Alabama (1989)
Deb, K.: Optimization for Engineering Design: Algorithms and Examples. Prentice-Hall, New Delhi (1995)
Deb, K.: An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering 186(2–4), 311–338 (2000)
Deb, K.: Multi-objective optimization using evolutionary algorithms. Wiley, Chichester (2001)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2000)
Eshelman, L.J.: The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In: Foundations of Genetic Algorithms 1 (FOGA-1), pp. 265–283 (1991)
Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 41–49 (1987)
Jensen, M.T.: Reducing the run-time complexity of multiobjective EAs. IEEE Transcations to Evolutionary Computation 7(5), 503–515 (2003)
Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. Journal of the Association for Computing Machinery 22(4), 469–476 (1975)
Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer, Boston (1999)
Pétrowski, A.: A clearing procedure as a niching method for genetic algorithms. In: IEEE 3rd International Conference on Evolutionary Computation (ICEC1996), pp. 798–803 (1996)
Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deb, K., Tiwari, S. (2005). Omni-optimizer: A Procedure for Single and Multi-objective Optimization. In: Coello Coello, C.A., HernĂ¡ndez Aguirre, A., Zitzler, E. (eds) Evolutionary Multi-Criterion Optimization. EMO 2005. Lecture Notes in Computer Science, vol 3410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31880-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-31880-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24983-2
Online ISBN: 978-3-540-31880-4
eBook Packages: Computer ScienceComputer Science (R0)