Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 31239

Select areas to restrict search in scientific publication database:
Sensitivity Analysis during the Optimization Process Using Genetic Algorithms
Genetic algorithms (GA) are applied to the solution of high-dimensional optimization problems. Additionally, sensitivity analysis (SA) is usually carried out to determine the effect on optimal solutions of changes in parameter values of the objective function. These two analyses (i.e., optimization and sensitivity analysis) are computationally intensive when applied to high-dimensional functions. The approach presented in this paper consists in performing the SA during the GA execution, by statistically analyzing the data obtained of running the GA. The advantage is that in this case SA does not involve making additional evaluations of the objective function and, consequently, this proposed approach requires less computational effort than conducting optimization and SA in two consecutive steps.
Digital Object Identifier (DOI):


[1] C. D. Chio, A. Brabazon, M. Ebner, M. Farooq, A. Fink, J. Grahl, G. Greenfield, P. Machado, M. O’Neill, E. Tarantino, and N. Urquhart, Applications of Evolutionary Computation. Springer, 2010.
[2] R. L. Johnston, Applications of Evolutionary Computation in Chemistry. Springer, 2004.
[3] C. Karr and L. M. Freeman, Industrial Applications of Genetic Algorithms. CRC Press, 1998.
[4] T. Back, U. Hammel, and H.-P. Schwefel, “Evolutionary computation: Comments on the history and current state,” IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 3–17, 1997.
[5] D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
[6] L. Davis, Handbook of Genetic Algorithms. Van Nostrand Reinhold Company, 1991.
[7] A. E. Eiben and J. Smith, Introduction to Evolutionary Computing. Springer, 2010.
[8] M. A. Rubio, A. Urquia, and S. Dormido, “An approach to the calibration of Modelica models,” in Proceedings of the 1st International Workshop on Equation-Based Object-Oriented Languages and Tools, 2007.
[9] K. Edwards, T. F. Edgar, and V. Manousiouthakis, “Kinetic model reduction using genetic algorithms,” Computers chem. Engng., vol. 22, pp. 239–246, 1998.
[10] M. L. Raymer, W. F. Punch, E. D. Goodman, L. A. Kuhn, and A. K. Jain, “Dimensionality reduction using genetic algorithms,” IEEE Transactions on Evolutionary Computation, vol. 4, no. 2, pp. 164 – 171, 2000.
[11] K. Chan, A. Saltelli, and S. Tarantola, “Sensitivity analysis of model output: variance-based methods make the difference,” in Proceedings of the Winter Simulation Conference, 1997.
[12] A. Saltelli, M. Ratto, T. Andres, F. Campolongo, J. Cariboni, D. Gatelli, M. Saisana, and S. Tarantola, Global Sensitivity Analysis: The Primer. Wiley, 2008.
[13] A. Saltelli, K. Chan, and E. M. Scott, Sensitivity Analysis. Wiley, 2008.
[14] W. Chen, X. Lu, C. Yao, G. Zhu, and Z. Xu, “An efficient approach based on bi-sensitivity analysis and genetic algorithm for calibration of activated sludge models,” Chemical Engineering Journal, vol. 259, pp. 845–853, 2015.
[15] M. Vazquez-Cruz, R. Guzman-Cruz, O. C.-P. I.L. Lopez-Cruz, I. Torres-Pacheco, and R. Guevara-Gonzalez, “Global sensitivity analysis by means of efast and sobol methods and calibration of reduced state-variable tomgro model using genetic algorithms,” Computers and Electronics in Agriculture, vol. 100, pp. 1–12, 2014.
[16] C. Andres, C. F. Valerio, and P. Franz, “Validation of an advanced lithium-ion battery model for electric and hybrid drive trains,” in EET-2008 European Ele-Drive Conference. International Advanced Mobility Forum, 2008.
[17] N. Nishida, Y. Takahashi, and S. Wakao, “Robust design optimization approach by combination of sensitivity analysis and sigma level estimation,” IEEE Transactions on Magnetics, vol. 44, no. 6, pp. 998–1001, 2008.
[18] D. G. Vieira, D. A. G. Vieira, W. M. Caminhas, and J. A. Vasconcelos, “A hybrid approach combining genetic algorithm and sensitivity information extracted from a parallel layer perceptron,” IEEE Transactions on Magnetics, vol. 41, no. 5, pp. 1740 – 1743, 2005.
[19] W. T. Eadie, Statistical Methods in Experimental Physics. Elsevier, 1983.
[20] R. L. Plackett, “Karl Pearson and the chi-squared test,” International Statistical Review, vol. 51, no. 1, pp. 59–72, 1983.
[21] H. Shimazaki and S. Shinomoto, “A method for selecting the bin size of a time histogram,” Neural Computation, vol. 19, no. 6, pp. 1503–1527, 2007.
[22] K. A. D. Jong, “An analysis of the behavior of a class of genetic adaptive systems,” Ph.D. dissertation, University of Michigan Ann Arbor, MI, USA, 1975.
[23] H. Muhlenbein, M. Schomisch, and J. Born, “The parallel genetic algorithm as function optimizer,” Parallel Computing, vol. 17, no. 6-7, pp. 619 – 632, 1991.
[24] T. Back, D. Fogel, and Z. Michalewicz, Handbook of Evolutionary Computation. Bristol and Oxford University Press, 1997.
Vol:15 No:05 2021Vol:15 No:04 2021Vol:15 No:03 2021Vol:15 No:02 2021Vol:15 No:01 2021
Vol:14 No:12 2020Vol:14 No:11 2020Vol:14 No:10 2020Vol:14 No:09 2020Vol:14 No:08 2020Vol:14 No:07 2020Vol:14 No:06 2020Vol:14 No:05 2020Vol:14 No:04 2020Vol:14 No:03 2020Vol:14 No:02 2020Vol:14 No:01 2020
Vol:13 No:12 2019Vol:13 No:11 2019Vol:13 No:10 2019Vol:13 No:09 2019Vol:13 No:08 2019Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007