Abstract
This work investigates a simple and practical bio-immune optimization approach to solve a kind of chance-constrained programming problem without known noisy attributes, after probing into a lower bound estimate of sample size for any random variable. Such approach mainly consists of sample allocation, evaluation, proliferation and mutation. The former two, depending on a lower bound estimate acquired, not only decide the sample size of random variable and the importance level of each evolving B cell, but also ensure that such B cell is evaluated with low computational cost; the third makes diverse B cells participate in evolution and suppresses the influence of noise; the last, which associates with the information on population diversity and fitness inheritance, creates diverse and high-affinity B cells. Under such approach, three similar immune algorithms are derived after selecting different mutation rules. The experiments, by comparison against two valuable genetic algorithms, have illustrated that these immune algorithms are competitive optimizers capable of effectively executing noisy compensation and searching for the desired optimal reliable solution.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Y. Jin, J. Branke. Evolutionary optimization in uncertain environments–a survey. IEEE Transactions on Evolutionary Computation, vol. 9, no. 3, pp. 303–317, 2005.
L. H. Lee, N. A. Pujowidianto, L. W. Li, C. Chen, C. M. Yap. Approximate simulation budget allocation for selecting the best design in the presence of stochastic constraints. IEEE Transactions on Automatic Control, vol. 57, no. 11, pp. 2940–2945, 2012.
A. Nemirovski, A. Shapiro. Convex approximations of chance constrained programs. SIAM Journal on Optimization, vol. 17, no. 4, pp. 969–996, 2006.
D. L. Olson, S. R. Swenseth. A linear approximation for chance-constrained programming. Journal of the Operational Research Society, vol. 38, no. 3, pp. 261–267, 1987.
L. Zhang, L. Wang, D. Z. Zheng. Hypothesis-test based genetic algorithm for stochastic optimization problems. Control Theory and Applications, vol. 21, no. 6, pp. 885–889, 2004.
A. K. Kahng, B. Liu, Q. K.Wang. Stochastic power/ground supply voltage prediction and optimization via analytical placement. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 15, no. 8, pp. 904–912, 2007.
A. Di Pietro, L. While, L. Barone. Applying evolutionary algorithms to problems with noisy, time-consuming fitness functions. In Proceedings of Congress on Evolutionary Computation, IEEE, Portland Oregon, USA, vol. 2, pp. 1254–1261, 2004.
N. V. Sahinidis. Optimization under uncertainty: Stateof- the-art and opportunities. Computers & Chemical Engineering, vol. 28, vol. 6–7, pp. 971–983, 2004.
H. Agarwal. Reliability Based Design Optimization: Formulations and Methodologies, Ph.D. dissertation, University of Notre Dame, USA, 2004.
K. Deb, S. Gupta, D. Daum. Reliability-based optimization using evolutionary algorithms. IEEE Transactions on Evolutionary Computation, vol. 13, no. 5, pp. 1054–1074, 2009.
J. Luedtke. A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Mathematical Programming, vol. 146, no. 1–2, pp. 219–244, 2013.
F. F. Dong, Y. Liu, L. Qian, H. Sheng, Y. H. Yang, H. C. Guo, L. Zhao. Interactive decision procedure for watershed nutrient load reduction: An integrated chance-constrained programming model with risk-cost tradeoff. Environmental Modelling & Software, vol. 61, pp. 166–173, 2014.
C. B. Wu, G. H. Huang, W. Li, Y. L. Xie, Y. Xu. Multistage stochastic inexact chance-constraint programming for an integrated biomass-municipal solid waste power supply management under uncertainty. Renewable and Sustainable Energy Reviews, vol. 41, pp. 1244–1254, 2015.
C. W. Cao, X. S. Gu, Z. Xin. Chance constrained programming models for refinery short-term crude oil scheduling problem. Applied Mathematical Modelling, vol. 33, no. 3, pp. 1696–1707, 2009.
H. Zhang, P. Li. Chance constrained programming for optimal power flow under uncertainty. IEEE Transactions on Power Systems, vol. 26, no. 4, pp. 2417–2424, 2011.
K. Ağpak, H. Gókçen. A chance-constrained approach to stochastic line balancing problem. European Journal of Operational Research, vol. 180, no. 3, pp. 1098–1115, 2007.
M. T. Rantanen, M. Juhola. A configuration deactivation algorithm for boosting probabilistic roadmap planning of robots. International Journal of Automation and Computing, vol. 9, no. 2, pp. 155–164, 2012.
C. A. Poojari, B. Varghese. Genetic algorithm based technique for solving chance constrained problems. European Journal of Operational Research, vol. 185, no. 3, pp. 1128–1154, 2008.
Y. Tenne. An optimization algorithm employing multiple metamodels and optimizers. International Journal of Automation and Computing, vol. 10, no. 3, pp. 227–241, 2013.
L. N. de Castro, J. Timmis. Artificial Immune Systems: A New Computational Intelligence Approach, Berlin, Germany: Springer-Verlag, 2002.
E. Hart, J. Timmis. Application areas of AIS: The past, present and the future. Applied Soft Computing, vol. 8, no. 1, pp. 191–201, 2008.
V. Cutello, G. Nicosia, M. Pavone. Real coded clonal selection algorithm for unconstrained global optimization using a hybrid inversely proportional hypermutation operator. In Proceedings of the 21st Annual ACM Symposium on Applied Computing, SAC 2006, ACM, Dijon, France, vol. 2, pp. 950–954, 2006.
V. Cutello, G. Nicosia, M. Pavone, J. Timmis. An immune algorithm for protein structure prediction on lattice models. IEEE Transactions on Evolutionary Computation, vol. 11, no. 1, pp. 101–117, 2007.
D. Dasgupta, S. H. Yu, F. Nino. Recent advances in artificial immune systems: Models and applications. Applied Soft Computing, vol. 11, no. 2, pp. 1574–1587, 2011.
Q. Y. Zhao, R. Yang, F. Duan. An immune clonal hybrid algorithm for solving stochastic chance-constrained programming. Journal of Computational Information Systems, vol. 8, pp. 8295–8302, 2012.
Z. H. Zhang, L. Wang, M. Liao. Adaptive sampling immune algorithm solving joint chance-constrained programming. Journal of Control Theory and Applications, vol. 11, no. 2, pp. 237–246, 2013.
F. O. de França, F. J. Von Zuben, L. N. de Castro. An artificial immune network for multimodal function optimization on dynamic environments. In Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation, ACM, New York, USA, pp. 289–296, 2005.
Z. H. Zhang, T. Xin. Immune algorithm with adaptive sampling in noisy environments and its application to stochastic optimization problems. IEEE Computational Intelligence Magazine, vol. 2, no. 4, pp. 29–40, 2007.
J. Luedtke, S. Ahmed. A sample approximation approach for optimization with probabilistic constraints. SIAM Journal on Optimization, vol. 19, no. 2, pp. 674–699, 2008.
B. K. Pagnoncelli, S. Ahmed, A. Shapiro. Sample average approximation method for chance constrained programming: Theory and applications. Journal of Optimization Theory and Applications, vol. 142, no. 2, pp. 399–416, 2009.
F. M. Burnet. The Clonal Selection Theory of Acquired Immunity, Cambridge, UK: Cambridge University Press, 1959.
K. Deb, M. Goyal. A combined genetic adaptive search (GeneAS) for engineering design. Computer Science and Informatics, vol. 26, pp. 30–45, 1996.
B. Varghese, C. A. Poojari. Genetic algorithm based technique for solving chance constrained problems arising in risk management. Technical Report, Carisma, 2004.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported in part by National Natural Science Foundation NSFC (Nos. 61563009 and 61065010) and Doctoral Fund of Ministry of Education of China (No. 20125201110003).
Zhu-Hong Zhang received his M. Sc. degree from Department of Mathematics, Guizhou University, China in 1998 and Ph.D. degree from College of Automation, Chongqing University, China in 2004. He is a professor at Guizhou University, China. Prof. Zhang has been an associate editor affiliated with Journal of Applied Soft Computing since 2010. He has published about 80 refereed journal and conference papers and also one book on modern intelligent algorithms (the 2nd author).
His research interests include evolutionary computation, immune optimization, uncertain programming, control theory, and visual neural networks.
ORCID iD: 0000-0001-7619-1040
Kai Yang received his B. Sc. and M. Sc. degrees from Departments of Mechanical Engineering and Computer Science, Guizhou University, China in 1998 and 2008, respectively. He is currently a Ph.D. degree candidate at College of Computer Science, Guizhou University, China.
His research interests include immune optimization and stochastic programming.
Da-Min Zhang received his M. Sc. and Ph.D. degrees from Guizhou University, China in 2005 and 2010, respectively. He, as a professor at Guizhou University, has published about 30 refereed journal and conference papers.
His research interest include computer system integration, software development and complex networks.
Rights and permissions
About this article
Cite this article
Zhang, ZH., Yang, K. & Zhang, DM. Sample bound estimate based chance-constrained immune optimization and its applications. Int. J. Autom. Comput. 13, 468–479 (2016). https://doi.org/10.1007/s11633-016-0997-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11633-016-0997-z