Abstract
This article presents one bio-inspired immune optimization approach for linear or nonlinear multi-objective chance-constrained programming with any a prior random vector distribution. Such approach executes in order sample-allocation, evolution and memory update within a run period. In these modules, the first ensures that those high-quality elements can attach large sample sizes in the noisy environment. Thereafter, relying upon one proposed dominance probability model to justify whether one individual is superior to another one; the second attempts to find those diverse and excellent individuals. The last picks up some individuals in the evolving population to update low-quality memory cells in terms of their dominance probabilities. These guarantee that excellent and diverse individuals evolve towards the Pareto front, even if strong noises influence the process of optimization. Comparative and experimental results illustrate that the Monte Carlo simulation and important sampling make the proposed approach expose significantly different characteristics. Namely, the former ensures it a competitive optimizer, but the latter makes it effective only for uni-modal or linear chance-constrained programming. The sensitivity analysis claims that such approach performs well when two sensitive parameters takes values over specific intervals.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ağpak K, Gökcen H (2007) A chance-constrained approach to stochastic line balancing problem. Eur J Oper Res 180:1098–1115
Beielstein T, Markon S (2002) Threshold selection, hypothesis test, and DOE methods. In: Proceedings of the congress evolutionary computation, Honolulu, pp 777–782
Biswas A, De AK (2012) A fuzzy programming method for solving multiobjective chance constrained programming problems involving log-normally distributed fuzzy random variables. In: Panigrahi BK et al (eds) SEMCCO 2012, LNCS 7677, pp 442–450
Branke J, Schmidt C, Schmeck H (2001) Efficient fitness estimation in noisy environments. In: Proceedings of genetic and evolutionary computation (GECCO01), Morgan Kaufmann, Burlington, pp 243–250
Bui LT, Essam D (2005) Fitness inheritance for noisy evolutionary multi-objective optimization. In: Proceedings of 2005 genetic and evolutionary Computation, New York, vol 1. pp 779–785
Charles V, Ansari SI, Khalid MM (2011) Multi-objective stochastic linear programming with general form of distributions. Int J Oper Res Optim 2(2):261–278
Daum DA, Deb K (2007) Reliability-based optimization for multiple constraints with evolutionary algorithms. In: IEEE congress on transactions on evolutionary computation, pp 911–918
Deb K (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2): 182–197
Deb K, Agrawal S, Pratab A et al (2000) A fast elitist multi-objective genetic algorithm for multi-objective optimization: NSGAII. In: Proceedings of the parallel problem solving from nature conference, vol 5. pp 849–858
Erick CZ (2004) Adaptive sampling for noisy problems. In: Proceedings of genetic evolutionary computation, Seattle, pp 265–270
Frank SA (2002) Immunology and evolution of infectious disease. Princeton University Press, Princeton
Han QH, Tang WS, Li GQ (2002) Chance-constrained portfolio problems. J Syst Eng 17(1): 87–92 (in chinese)
Hesterberg T (1995) Weighted average important sampling and defensive mixture distributions. Technometrics 37(12):185–194
Hou J, Zhao YK (2006) Mathematical models and optimization of dynamically admeasuring coal. J Taiyuan Univ Technol 37(4):486–488
Hughes EJ (2001) Constraint handling with uncertain and noisy multi-objective evolution. In: IEEE congress on transactions on evolutionary computation, vol 2, pp 963–970
Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments—a survey. IEEE Trans Evol Comput 9(3):303–317
Kato K, Sakawa M (2011) An interactive fuzzy satisficing method based on variance minimization under expectation constraints for multiobjective stochastic linear programming problems. Soft Comput 15:131–138
Loughlin DH, Ranjithan SR (1999) Chance-constrained genetic algorithms. In: Proceedings of the genetic evolutionary Computation Conference, pp 369–376
Masri H, Abdelaziz FB, Meftahi I (2010) A multiple objective stochastic portfolio selection program with partial information on probability distribution. In: Second international conference on computer and network technology, pp 537–539
Nagarajan A, Jeyaraman K (2010) Solution of chance constrained programming problem for multi-objective interval solid transportation problem under stochastic environment using fuzzy approach. Int J Comput Appl 10(9):19–29
Nguyen TT, Yang SX, Branke J (2012) Evolutionary ynamic optimization: a survey of the state of the art. Swarm Evol Comput 6:1–24
Pagnoncellet BK, Ahmed S, Shapiro A (2009) Sample average approximation method for chance constrained programming: theory and applications. J Optim Theory Appl 142(2):399–416
Pal BB, Sen S, Kumar M (2009) A linear approximation approach to chance constrained multiobjective decision making problems. In: First international conference on advanced computing, ICAC, pp 70–75
Poojari CA, Varghese B (2008) Genetic algorithm based technique for solving chance constrained problems. Eur J Oper Res 185:1128–1154
Pramanik S, Banerjee D (2012) Multi-objective chance constrained capacitated transportation problem based on fuzzy goal programming. Int J Comput Appl 44(20):42–46
Sahin KH, Diwekar UM (2004) Better optimization of nonlinear uncertain systems (bonus): a new algorithm for stochastic programming using re-weighting through kernel density estimation. Ann Oper Res 132:47–68
Singh TS, Chakrabarty D (2011) Chance-constrained multi-objective programming for optimal multi-layer aquifer remediation design. Eng Optim 43(4):417–432
Thangaraj R, Pant M, Bouvry P et al (2010) Solving multi-objective stochastic programming problems using differential evolution. In: Proceedings of SEMCCO’2010, pp 54–61
Xue QX, Yin LJ, Wu SW (2011) Optimization model of coal dynamic blending based on the ecological footprint of genetic algorithm. China collective economy. http://www.cnki.com.cn/Article
Yu J, Xu B, Shi Y (2009) The Pareto-frontier solution to the multi-project and multiple item stochastic chance-constrained investment combination. In: International conference on business intelligence and financial engineering, pp 510–513
Zhang ZH (2007) Immune optimization algorithm for constrained nonlinear multiobjective optimization problems. Appl Soft Comput 7(3):840–857
Zhang XX, Huang GH, Xi BD, et al. (2009) Inexact chance-constrained nonlinear programming method for coal blending in power plants. China Soc Electron Eng 29(5):11–15
Zhou A, Qu BY, Li H, Zhao SZ, et al. (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1(1):32–49
Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto evolutionary algorithm. IEEE Trans Evol Comput 3(4):257–271
Acknowledgments
This work is supported in part by National Natural Science Foundation NSFC (61065010, 61263005) and Doctoral Fund of Ministry of Education of China (20125201110003).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, Z., Wang, L. & Long, F. Immune optimization approach solving multi-objective chance-constrained programming. Evolving Systems 6, 41–53 (2015). https://doi.org/10.1007/s12530-013-9101-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12530-013-9101-x