Generating Epsilon-Efficient Solutions in Multiobjective Optimization by Genetic Algorithm

Download Download as PDF (Size:642KB)  HTML   XML  PP. 395-409  
DOI: 10.4236/am.2017.83032    278 Downloads   359 Views  


We develop a new evolutionary method of generating epsilon-efficient solutions of a continuous multiobjective programming problem. This is achieved by discretizing the problem and then using a genetic algorithm with some derived probabilistic stopping criteria to obtain all minimal solutions for the discretized problem. We prove that these minimal solutions are the epsilon-optimal solutions to the original problem. We also present some computational examples illustrating the efficiency of our method.

Cite this paper

Rahmo, E. and Studniarski, M. (2017) Generating Epsilon-Efficient Solutions in Multiobjective Optimization by Genetic Algorithm. Applied Mathematics, 8, 395-409. doi: 10.4236/am.2017.83032.


[1] Ruzika, S. and Wiecek, M.M. (2005) Approximation Methods in Multiobjective Programming. Journal of Optimization Theory and Applications, 126, 473-501.
[2] Ghaznavi-Ghosoni, B.A., Khorram, E. and Soleimani-damaneh, M. (2013) Scalarization for Characterization of Approximate Strong/Weak/Proper Efficiency in Multi-Objective Optimization. Optimization, 62, 703-720.
[3] Loridan, P. (1984) -Solutions in Vector Minimization Problems. Journal of Optimization Theory and Applications, 42, 265-276.
[4] Engau, A. and Wiecek, M.M. (2007) Generating -Efficient Solutions in Multiobjective Programming. European Journal of Operational Research, 177, 1566-1579.
[5] Engau, A. and Wiecek, M.M. (2007) Exact Generation of Epsilon-Efficient Solutions in Multiple Objective Programming. OR Spectrum, 29, 335-350.
[6] Laumanns, M., Thiele, L., Deb, K. and Zitzler, E. (2002) Combining Convergence and Diversity in Evolutionary Multiobjective Optimization. Evolutionary Computation, 10, 263-282.
[7] Schutze, O., Laumanns, M., Tantar, E., Coello Coello, C.A. and Talbi, E.-G. (2007) Convergence of Stochastic Search Algorithms to Gap-Free Pareto Front Approximations. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2007), 892-899.
[8] Studniarski, M. (2011) Finding All Minimal Elements of a Finite Partially Ordered Set by Genetic Algorithm with a Prescribed Probability. Numerical Algebra, Control and Optimization, 1, 389-398.
[9] Vose, M.D. (1999) The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge.
[10] Reeves, C.R. and Rowe, J.E. (2003) Genetic Algorithms—Principles and Perspectives: A Guide to GA Theory. Kluwer, Boston.
[11] Rudolph, G. and Agapie, A. (2000) Convergence Properties of Some Multi-Objective Evolutionary Algorithms. In: Zalzala, A., et al., Eds., Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), Vol. 2, IEEE Press, Piscataway, 1010-1016.
[12] Osman, M.S., Abo-Sinna, M.A. and Mousa, A.A. (2005) An Effective Genetic Algorithm Approach to Multiobjective Resource Allocation Problems (MORAPs). Applied Mathematics and Computation, 163, 755-768.
[13] Deb, K., Pratap, A., Agarwal, S. and Meyarivan, T. (2002) A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6, 182-197.

comments powered by Disqus

Copyright © 2017 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.