Improving the reliability of implicit averaging methods using new conditional operators for robust optimization

No Thumbnail Available
File version
Author(s)
Mirjalili, Seyedeh Zahra
Mirjalili, Seyedali
Zhang, Hongyu
Chalup, Stephan
Noman, Nasimul
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2019
Size
File type(s)
Location
License
Abstract

In the field of robust optimization, the robustness of a solution is confirmed using a robustness indicator. In the literature, such an indicator uses explicit or implicit averaging techniques. One of the main drawbacks of the implicit averaging techniques is unreliability since they only use the sampled points generated by an optimization algorithm. In this paper, we propose a set of conditional operators for comparing solutions based on the number of sampled solutions in their neighbourhoods, thereby making reliable decisions during the process of robust optimization. This technique is integrated into the Particle Swarm Optimization (PSO) to update GBEST and PBESTs reliably, and the designed robust PSO algorithm is applied to a number of case studies. A set of extensive experiments shows that the proposed technique prevents an algorithm that relies on implicit averaging technique from making risky decisions and thus proven beneficial in finding robust solutions.

Journal Title

Swarm and Evolutionary Computation

Conference Title
Book Title
Edition
Volume

51

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence

Science & Technology

Technology

Computer Science, Artificial Intelligence

Computer Science, Theory & Methods

Computer Science

Persistent link to this record
Citation

Mirjalili, SZ; Mirjalili, S; Zhang, H; Chalup, S; Noman, N, Improving the reliability of implicit averaging methods using new conditional operators for robust optimization, Swarm and Evolutionary Computation, 2019, 51

Collections