Welcome to the InfoSci Platform
Reference Hub5
A Culture-Based Particle Swarm Optimization Framework for Dynamic, Constrained Multi-Objective Optimization

A Culture-Based Particle Swarm Optimization Framework for Dynamic, Constrained Multi-Objective Optimization

Ashwin A. Kadkol, Gary G. Yen
Copyright: © 2012 |Volume: 3 |Issue: 1 |Pages: 29
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781466614338|DOI: 10.4018/jsir.2012010101
Cite Article Cite Article

MLA

Kadkol, Ashwin A., and Gary G. Yen. "A Culture-Based Particle Swarm Optimization Framework for Dynamic, Constrained Multi-Objective Optimization." IJSIR vol.3, no.1 2012: pp.1-29. http://doi.org/10.4018/jsir.2012010101

APA

Kadkol, A. A. & Yen, G. G. (2012). A Culture-Based Particle Swarm Optimization Framework for Dynamic, Constrained Multi-Objective Optimization. International Journal of Swarm Intelligence Research (IJSIR), 3(1), 1-29. http://doi.org/10.4018/jsir.2012010101

Chicago

Kadkol, Ashwin A., and Gary G. Yen. "A Culture-Based Particle Swarm Optimization Framework for Dynamic, Constrained Multi-Objective Optimization," International Journal of Swarm Intelligence Research (IJSIR) 3, no.1: 1-29. http://doi.org/10.4018/jsir.2012010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Real-world optimization problems are often dynamic, multiple objective in nature with various constraints and uncertainties. This work proposes solving such problems by systematic segmentation via heuristic information accumulated through Cultural Algorithms. The problem is tackled by maintaining 1) feasible and infeasible best solutions and their fitness and constraint violations in the Situational Space, 2) objective space bounds for the search in the Normative Space, 3) objective space crowding information in the Topographic Space, and 4) function sensitivity and relocation offsets (to reuse available information on optima upon change of environments) in the Historical Space of a cultural framework. The information is used to vary the flight parameters of the Particle Swarm Optimization, to generate newer individuals and to better track dynamic and multiple optima with constraints. The proposed algorithm is validated on three numerical optimization problems. As a practical application case study that is computationally intensive and complex, parameter tuning of a PID (Proportional–Integral–Derivative) controller for plants with transfer functions that vary with time and imposed with robust optimization criteria has been used to demonstrate the effectiveness and efficiency of the proposed design.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.