Study on Techniques for Solving Constrained Optimization Problem
Abstract
The foundation of optimization techniques can be traced from 300 BC when Euclid recognized the minimum distance between two points to be length of straight line amalgamation the two. He also proved that a square has the greatest area among the rectangles with given total length of edges. Heron proved in 100 BC that light travels between two points through the path with shortest length when reflecting from a mirror. This paper studies on Techniques for Solving Constrained Optimization Problem.
Downloads
References
2. Cagnina, L., Esquivel, S., and Gallard, R., 2004. Particle Swarm Optimization for sequencing problems: a case study. In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation (CEC 2004). Portland, Oregon, USA. 20-23 June. IEEE Press, 536–541.
3. Eberhart, R.C. and Shi, Y., 2000. Comparing Inertia Weights and Constriction Factors in Particle Swarm Optimization. In: Proceedings of the 2000 IEEE Congress on Evolutionary Computation (CEC’2000). Piscataway, New Jersey, USA. 16-19 July IEEE Press, 84–88.
4. Hamida, S.B. and Schoenauer, M., 2002. ASCHEA: New Results Using Adaptive Segregational Constraint Handling. In: Proceedings of the Congress on Evolutionary Computation 2002 (CEC’2002). Honolulu, Hawaii. 12-17 May. IEEE Service Center, 884–889.
5. Knowles, J.D. and Corne, D.W., 2000. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy. Evolutionary Computation, 8 (2), 149–172.
6. Li, L.J., et al., 2007. A heuristic particle swarm optimizer for optimization of pin connected structures. Computers and Structures, 85 (7–8), 340–349.
7. Zhang, W.J. and Xie, X.F., 2003. DEPSO: Hybrid Particle Swarm with Differential Evolution Operator. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC 2003), Vol. 4. Washington DC, USA. 5-8 October. IEEE, 3816–3821
8. Toscano-Pulido, G. and Coello Coello, C.A., 2004. A Constraint-Handling Mechanism for Particle Swarm Optimization. In: Proceedings of the Congress on Evolutionary Computation 2004 (CEC 2004). Portland, Oregon, USA. 20-23 June. Piscataway, New Jersey: IEEE Service Center, 1396–1403.
9. Runarsson, T.P. and Yao, X., 2000. Stochastic Ranking for Constrained Evolutionary Optimization. IEEE Transactions on Evolutionary Computation, 4 (3), 284–294.
10. Koziel, S. and Michalewicz, Z., 1999. Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization. Evolutionary Computation, 7 (1), 19–44.
11. Hamida, S.B. and Schoenauer, M., 2002. ASCHEA: New Results Using Adaptive Segregational Constraint Handling. In: Proceedings of the Congress on Evolutionary Computation 2002 (CEC’2002). Honolulu, Hawaii. 12-17 May. IEEE Service Center, 884–889.
12. Parsopoulos, K. and Vrahatis, M., 2005. Unified Particle Swarm Optimization for solving constrained engineering optimization problems. Advances in Natural Computation, Pt. 3. Lecture Notes in Computer Science Vol. 3612, 582–591.
Copyright (c) 2018 IJRDO - Journal of Mathematics (ISSN: 2455-9210)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the IJRDO Journal will have the full right to remove the published article on any misconduct found in the published article.
