Abstract
A number of population-based constrained optimization techniques are offered in the literature. Usually, a least amount of 50 population size is required to solve constrained optimization problems proficiently that results in large computation cost also. In this paper, a hybrid optimization technique, constrained Nelder–Mead self-organizing migrating algorithm (C-NMSOMA), has been projected that works with 20 population size only. It works with aim not only to handle constraints but also to condense the computation cost also. To confirm the claim, an experiment has been conducted for a set of ten constraint optimization problems by varying the population size from 20 to 100. C-NMSOMA works best with population size 20. To show its effectiveness over other algorithms, a convincing comparison has been made between the best results available by these algorithms and results obtained by C-NMSOMA using population size 20 only. Experimental results demonstrate that the presented algorithm C-NMSOMA is a robust optimization technique that yields feasible and viable solutions in lesser number of function evaluations using lesser population size. It combines the features of self-organizing migrating algorithm (SOMA) and Nelder–Mead (NM) simplex search. NM simplex search has been used as a crossover operator to produce new individuals in the solution space. A constraint handling technique based on preserving the feasibility of solutions with initialized feasible population has been adopted.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bertsekas, D.P.: Constrained optimization and lagrange multiplier methods. In: Linear Network Optimization: Algorithms and Codes. M.I.T. Press London LTD. (1991)
Homaifar, A., Qi, C.X., Lai, S.H.: Constrained optimization via genetic algorithms. Simulation 62, 242–253 (1994)
Fletcher, R.: An ideal penalty function constrained optimization. IMA J. Appl. Math. 15, 319–342 (1975)
Boggs, P.T., Tolle, Jon W.: Sequential quadratic programming. Acta Numer. 4 (1995)
Lasdon, L.S., Fox, R.L., Ratner, M.W.: Nonlinear optimization using the generalized reduced gradient method. RAIRO-Oper. Res. Rech. Oper. 8, 73–103 (1974)
Dou, J., Wang, X.J.: An efficient evolutionary programming. In: International Symposium on Information Science and Engineering, ISISE’08, pp. 401– 404 (2008)
Michalewicz, Z.: Genetic algorithms, numerical optimization and constraints. In: Echelman, L.J. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 151–158 (1995)
Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186, 311–338 (2000)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983). https://doi.org/10.1126/science.220.4598.671
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science (1995)
Lampinen, J.: A constraint handling approach for the differential evolution algorithm. In: Proceedings of the 2002 Congress on Evolutionary Computation (CEC’2002), IEEE Service Center, Piscaaway, New Jersey, pp. 1468–1473 (2002)
Yang, X.S.: Harmony search as a metaheuristic algorithm. In: Geem, Z.W. (ed.) Music-Inspired Harmony Search Algorithm. Studies in Computational Intelligence, vol. 191, pp. 1–14. Springer Berlin, Heidelberg (2009)
Rashedi, E., Nezamabadi-pour, H., Saaryazdi, S.: GSA: a gravitational search algorithm. Inf. Sci. 179, 2232–2248 (2009)
Eskander, H., Sadollah, A., Bahreininejad, A., Hamdi, M.: Water cycle algorithm-A novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput. Struct. 110–111, 151–166 (2012)
Eskander, H., Sadollah, A., Bahreininejad, A., Hamdi, M.: Mine blast algorithm-A new population based algorithm for solving constrained engineering optimization problems. Appl. Soft Comput. 13, 2592–2612 (2013)
Michalewicz, Z., Attia, N.F.: Evolutionary optimization of constrained problems. In: Proceedings of Third Annual Conference on Evolutionary Programming, World Scientific, River Edge, NJ, pp. 998–1008 (1994)
Joines, J.A., Houck, C.R.: On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GAs. In: Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Orlando, FL, USA, pp. 587–602 (1994)
Smith, A.E., Coit, D.W.: Constraint handling techniques-penalty functions. In: Handbook of Evolutionary Computation, Institute of Physics Publishing and Oxford University Press, Bristol, U.K., Chapter C 5.2 (1997)
Coello, C.A.C.: Theoretical and numerical constraint handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput. Methods Appl. Mech. Eng. 191, 1245–1287 (2002)
Mezura-Montes, E., Coello, C.A.C.: A simple evolution strategy to solve constrained optimization problems. In: Cantú-Paz, E. et al. (eds.) Genetic and Evolutionary Computation—GECCO 2003. Lecture Notes in Computer Science, vol. 2723. Springer, Berlin, Heidelberg (2003)
Mezura-Montes, E., Coello, C.A.C.: Adding a diversity mechanism to a simple evolutionary strategy to solve constrained optimization problems. In: Proceedings of IEEE International Congress on Evolutionary Computation (CEC’2003). IEEE Neural Network Society, vol. 1, pp. 6–13 (2003)
Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186, 311–338 (2000)
Hu, X., Eberhart, R.: Solving constrained nonlinear optimization problems with particle swarm optimization. In: Proceedings of 6th World Multiconference on Systemics, Cybernetics and Informatics (SCI) (2002)
Sun, C., Zeng, J., Pan, J.: A new method for constrained optimization problems to produce initial values. In: Chinese Control and Decision Conference (CCDC’09), pp. 2690–2692 (2009)
Coello, C.A.C., Mezura-Montes, E.: Constraint-handling in genetic algorithms through the use of dominance based tournament selection. Adv. Eng. Inf. 16, 193–203 (2002)
Deb, K., Agarwal, S.: A niched-penalty approach for constraint handling in genetic algorithms. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna (1999)
Akhtar, S., Tai, K., Ray, T.: A socio-behavioural simulation model for engineering design optimization. Eng. Optim. 34, 341–354 (2002)
Chelouah, R., Siarry, P.: A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions. Eur. J. Oper. Res. 161, 636–654 (2005)
Durand, N., Alliot, J.: A combined Nelder-Mead simplex and genetic algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference GECCO’99, vol. 99, pp. 1–7 (1999)
Hedar, A., Fukushima, M.: Derivative-free filter simulated annealing method for constrained continuous global optimization. J. Global Optim. 35, 521–549 (2006)
Long, Q., Wu, C.: A hybrid method combining genetic algorithm and hook-jeeves method for constrained global optimization. J. Ind. Manag. Optim. 10, 1279–1296 (2014)
Deep, K., Dipti: A self organizing migrating genetic algorithm for constrained optimization. Applied Mathematics and Computation, vol. 198, pp. 237–250 (2008)
Singh, D., Agrawal, S.: Self organizing migrating algorithm with Nelder-Mead crossover and log-logistic mutation for large scale optimization. In: Acharjya, D., Dehuri, S., Sanyal, S. (eds.) Computational Intelligence for Big Data Analysis. Adaptation, Learning, and Optimization, vol. 19, pp. 143–164. Springer (2015)
Pulido, G.T., Coello, C.A.C.: A constraint-handling mechanism for particle swarm optimization. In: IEEE Congress on Evolutionary Computation (CEC’2004), vol. 2, pp. 1396–1403 (2004)
Datta, R., Costa, M.F.P., Deb, K., Gaspar-Cunha, A.: An evolutionary algorithm based pattern search approach for constrained optimization. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1355–1362 (2013)
Aguirre, A.H., Zavala, A.E.M., Diharce, E.V., Rionda, S.B.: COPSO: constrained optimization via PSO algorithm. In: Center for Research in Mathematics (CIMAT), Technical report No. I-07-04/22-02-2007
Stanarevic, N., Tuba, M., Bacanin, N.: Modified artificial bee colony algorithm for constrained problems optimization. Int. J. Math. Models Methods Appl. Sci. 5, 644–651 (2011)
Wu, J.-Y.: Solving constrained global optimization problems by using hybrid evolutionary computing and artificial life approaches. Math. Probl. Eng. 2012, Article ID 841410, 36 pp (2012). https://doi.org/10.1155/2012/841410
Zhang, C., Li, X., Gao, L., Wu, Q.: An improved electromagnetism-like mechanism algorithm for constrained optimization. Expert Syst. Appl. (Elsevier) 40, 5621–5634 (2013)
Zhao, W., Wang, L., Yin, Y., Wang, B., Wei, Y., Yin, Y.: An improved backtracking search algorithm for constrained optimization problems. In: Buchmann, R., Kifor, C.V., Yu, J. (eds.) Knowledge Science, Engineering and Management. KSEM’2014. Lecture Notes in Computer Science, vol 8793, pp. 222–233. Springer (2014)
Mezura-Montes, E., Coello, C.A.C., Tun-Morales, E.I.: Simple feasibility rules and differential evolution for constrained optimization. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L.E., Sossa, H. (eds.) In: MICAI 2004: Advances in Artificial Intelligence. MICAI 2004. Lecture Notes in Computer Science, vol. 2972. Springer, Berlin, Heidelberg (2004)
Zahara, E., Kao, Y.T.: Hybrid Nelder-Mead simplex search and particle swarm optimization for constrained engineering design problems. Expert Syst. Appl. (Elsevier) 36, 3880–3886 (2009)
Runarson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4, 284–294 (2000)
Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gümüs, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization. Kluwer, Boston, Mass, USA (1999)
Mezura-Montes, E., Coello, C.A.C.: Useful infeasible solutions in engineering optimization with evolutionary algorithms. In: Gelbukh, A., de Albornoz, Á., Terashima-Marín, H. (eds.) MICAI 2005: Advances in Artificial Intelligence. MICAI’2005. Lecture Notes in Computer Science, vol. 3789. Springer, Berlin, Heidelberg
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
1.1 Constrained Problems
The first six functions are well-known benchmark taken from Runarsson and Yao [43].
Problem 01
\( 0 \le {\text{x}}_{\text{i}} \le 1 \), i = 1, .., 9; \( 0 \le {\text{x}}_{\text{i}} \le 100 \), i = 10, 11, 12; \( 0 \le {\text{x}}_{13} \le 1 \).
The global minimum optimal solution is:
Problem 02
where n = 20 and \( 0 \le {\text{x}}_{\text{i}} \le 10 \), i = 1, …, n.
The global maximum optimal solution is:
Problem 03
where n= 10 and \( 0 \le {\text{x}}_{\text{i}} \le 1 \), i = 1, …, n.
The global maximum optimal solution is:
Problem 04
The global minimum optimal solution is:
Problem 05
The global maximum optimal solution is:
Problem 06
The global minimum optimal solution is:
Problem 07 This problem has been taken from handbook of test problems in local and global optimizations [44].
The optimal solution of the problem is:
Problem 08 This problem was proposed by Mezura and Coello [45].
The global minimum solution is:
Problem 09
The global minimum optimal solution is:
Problem 10
The global minimum optimal solution is:
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Singh, D., Agrawal, S. (2019). Fine-Tuned Constrained Nelder–Mead SOMA. In: Bansal, J., Das, K., Nagar, A., Deep, K., Ojha, A. (eds) Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 817. Springer, Singapore. https://doi.org/10.1007/978-981-13-1595-4_44
Download citation
DOI: https://doi.org/10.1007/978-981-13-1595-4_44
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1594-7
Online ISBN: 978-981-13-1595-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)