The Parameter Estimation and Statistical Analysis of Constraint Optimization Penalty Function that Solved by Particle Swarm Optimization

Article Preview

Abstract:

Particle swarm optimization has been successfully applied to optimization, however it was not effective on all of the constraint functions. This paper has validated it through five measures and analyzed the result of test function. From the result we could find out which was the best one or which was the worst one, then we use four methods of Punishment strategy function and each of them was tested by four particle swarm optimization so that we could know which one is the best to be combined with particle swarm optimization, and it will be explained theoretically.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 791-793)

Pages:

1273-1277

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Coello,C., Theoreticaland Numerical Constraint-Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art, Computer Methods in Applied Mechanics and Engineering, 2001 (to be published).

DOI: 10.1016/s0045-7825(01)00323-1

Google Scholar

[2] Homaiffar A., Qi C. & Lai S., Constrained Optimization Via Genetic Algorithms,. Simulation, 62: 4, pp.242-254, (1994).

Google Scholar

[3] Joines, J and Houck,C., On the Use of Non-Stationary Penalty Functions to Solve Nonlinear Constrained Optimization Problems with GA's,. Proceedings of first IEEE Conference on Evolutionary Computation, pp.579-584, (1994).

DOI: 10.1109/icec.1994.349995

Google Scholar

[4] Powell,D. and Skolnick,M., Using Genetic Algorithms in Engineering Design Optimization with Non-linear Constraints,. Proceedings of the Fifth International Conference on Genetic Algorithms. pp.424-430, (1993).

Google Scholar

[5] Kuri, A., A universal Eclectic Genetic Algorithm for Constrained Optimization". Proceedings 6th European Congress on Intelligent Techniques & Soft Computing, EUFIT, 98, pp.518-522, 1998. 5.

Google Scholar

[6] Shoenauer, M. and Xanthakis, S., Constrained GA Optimization,. Proceedings of the Fifth International Conference on Genetic Algorithms, pp.573-580, (1993).

Google Scholar

[7] Kuri,A., A Comprehensive Approach to Genetic Algorithms in Optimization and Learning. Theory and Applications, Vol. 1. Instituto Politécnico Nacional, p.270, (1999).

Google Scholar

[8] Richardson J., Palmer M., Liepins G. & Hilliard M., Some Guidelines for Genetic Algorithms with Penalty Functions,. Proceedings of the IEEE International Conference on Evolutionary Computation, pp.191-197, (1989).

Google Scholar

[9] Back, T., Evolutionary Algorithms in Theory and Practice, Oxford University Press, New York, (1996).

Google Scholar

[10] Coello,C., Use of a Self-Adaptive Penalty Approach for Engineering Optimization Problems, Computers in Industry, 41(2): 113-127, (2000).

DOI: 10.1016/s0166-3615(99)00046-9

Google Scholar