Data-Driven State Transition Algorithm for Fuzzy Chance-Constrained Dynamic Optimization
Abstract:
Many actual industrial production processes are dynamic and uncertain. When uncertain information are described by subjective experience and experts' knowledge based on scanty or vague information, fuzzy uncertainty exists. Fuzzy chance-constrained dynamic programming are applicable to industrial production modeling accompanied by fuzzy uncertainty and dynamics, where constraints need not or cannot be completely satisfied. In this article, a fuzzy chance-constrained dynamic optimization (FCCDO) formulation on the basis of credibility theory is established, in which, the credibility is used to measure the fuzzy uncertainty level of constraints. To solve the FCCDO problem (FCCDOP), an improved fuzzy simulation technique based on Hammersley sequence sampling is raised to transform fuzzy chance constraints to their deterministic equivalents, and then a data-driven state transition algorithm (DDSTA) using deep neural networks (DNNs) is put forward to achieve a stable, global and robust optimization performance. Finally, the successful applications of the FCCDO method to industrial studies demonstrate its advantages.
Related Concept Videos
Constraints and Statical Determinacy
Statically Indeterminate Problem Solving
Decision Making: P-value Method
First, a specific claim about the population parameter is proposed. The claim is based on the research question and is stated in a simple form. Further, an opposing statement to the claim is also stated. These statements can act as null and alternative hypotheses: a null hypothesis would be a neutral statement while the alternative hypothesis can...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
State Space to Transfer Function
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:


