Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 391765, 8 pages
Research Article

Chaotic Charged System Search with a Feasible-Based Method for Constraint Optimization Problems

1Department of Mathematical Sciences, University of Tabriz, Tabriz, Iran
2Marand Faculty of Engineering, University of Tabriz, Tabriz, Iran
3Department of Mathematics, University of Salerno, Via Ponte Don Melillo, 84084 Fisciano, Italy

Received 15 December 2012; Accepted 23 January 2013

Academic Editor: Shengyong Chen

Copyright © 2013 B. Nouhi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Recently developed chaotic charged system search was combined to feasible-based method to solve constraint engineering optimization problems. Using chaotic maps into the CSS increases the global search mobility for a better global optimization. In the present method, an improved feasible-based method is utilized to handle the constraints. Some constraint design examples are tested using the new chaotic-based methods, and the results are compared to recognize the most efficient and powerful algorithm.