Application of Particle Swarm Optimization to the mixed discrete non-linear problems

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Particle Swarm Optimization is applied to the mixed discrete non-linear problems (MDNLP). PSO is mainly a method to find a global or quasiminimum for a non-convex optimization problem of continuous design variables. To handle the discrete design variables, penalty function is introduced. By using penalty function, it is possible to treat all design variables as the continuous design variables. Through typical structural optimization problem, the validity of proposed approach for MDNLP is examined. © 2005 by International Federation for Information Processing.

Cite

CITATION STYLE

APA

KitaYama, S., Yamazaki, K., & Arakawa, M. (2005). Application of Particle Swarm Optimization to the mixed discrete non-linear problems. In IFIP Advances in Information and Communication Technology (Vol. 187, pp. 315–324). Springer New York LLC. https://doi.org/10.1007/0-387-29295-0_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free