scholarly journals SRIFA: Stochastic Ranking with Improved-Firefly-Algorithm for Constrained Optimization Engineering Design Problems

Mathematics ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 250 ◽  
Author(s):  
Umesh Balande ◽  
Deepti Shrimankar
Keyword(s):  
Constrained Optimization ◽  
Engineering Design ◽  
Real World ◽  
Optimization Design ◽  
Firefly Algorithm ◽  
Optimization Problems ◽  
Design Problems ◽  
Improved Firefly Algorithm ◽  
Engineering Design Problems ◽  
And Performance

Firefly-Algorithm (FA) is an eminent nature-inspired swarm-based technique for solving numerous real world global optimization problems. This paper presents an overview of the constraint handling techniques. It also includes a hybrid algorithm, namely the Stochastic Ranking with Improved Firefly Algorithm (SRIFA) for solving constrained real-world engineering optimization problems. The stochastic ranking approach is broadly used to maintain balance between penalty and fitness functions. FA is extensively used due to its faster convergence than other metaheuristic algorithms. The basic FA is modified by incorporating opposite-based learning and random-scale factor to improve the diversity and performance. Furthermore, SRIFA uses feasibility based rules to maintain balance between penalty and objective functions. SRIFA is experimented to optimize 24 CEC 2006 standard functions and five well-known engineering constrained-optimization design problems from the literature to evaluate and analyze the effectiveness of SRIFA. It can be seen that the overall computational results of SRIFA are better than those of the basic FA. Statistical outcomes of the SRIFA are significantly superior compared to the other evolutionary algorithms and engineering design problems in its performance, quality and efficiency.

Fast topological-shape optimization with boundary elements in two dimensions

2017 ◽  
Vol 32 (2) ◽  
Author(s):  
Igor A. Ostanin ◽  
Denis N. Zorin ◽  
Ivan V. Oseledets
Keyword(s):  
Optimal Design ◽  
Shape Optimization ◽  
Constrained Optimization ◽  
Engineering Design ◽  
Optimization Problems ◽  
Two Dimensions ◽  
Constrained Optimization Problems ◽  
Design Problems ◽  
And Topology ◽  
Engineering Design Problems

AbstractWide variety of engineering design problems can be formulated as constrained optimization problems where the shape and topology of the domain are optimized to reduce costs while satisfying certain constraints. Several mathematical approaches were developed to address the problem of finding optimal design of an engineered structure. Recent works [

Standards, Codes of Practice and Expert Systems

1988 ◽  
Vol 21 (1) ◽  
pp. 5-9 ◽  
Author(s):  
E G McCluskey ◽  
S Thompson ◽  
D M G McSherry
Keyword(s):  
Expert System ◽  
Expert Systems ◽  
Engineering Design ◽  
Performance Criteria ◽  
Design Problems ◽  
Codes Of Practice ◽  
Engineering Design Problems ◽  
And Performance

Many engineering design problems require reference to standards or codes of practice to ensure that acceptable safety and performance criteria are met. Extracting relevant data from such documents can, however, be a problem for the unfamiliar user. The use of expert systems to guide the retrieval of information from standards and codes of practice is proposed as a means of alleviating this problem. Following a brief introduction to expert system techniques, a tool developed by the authors for building expert system guides to standards and codes of practice is described. The steps involved in encoding the knowledge contained in an arbitrarily chosen standard are illustrated. Finally, a typical consultation illustrates the use of the expert system guide to the standard.

scholarly journals Multipopulation Ensemble Particle Swarm Optimizer for Engineering Design Problems

2020 ◽  
Vol 2020 ◽  
pp. 1-30
Author(s):  
Ziang Liu ◽  
Tatsushi Nishi
Keyword(s):  
Engineering Design ◽  
Real World ◽  
Particle Swarm ◽  
Engineering Problem ◽  
Particle Swarm Optimizer ◽  
Design Problems ◽  
Source Codes ◽  
Searching Strategy ◽  
Engineering Design Problems ◽  
Improved Function

Particle swarm optimization (PSO) is an efficient optimization algorithm and has been applied to solve various real-world problems. However, the performance of PSO on a specific problem highly depends on the velocity updating strategy. For a real-world engineering problem, the function landscapes are usually very complex and problem-specific knowledge is sometimes unavailable. To respond to this challenge, we propose a multipopulation ensemble particle swarm optimizer (MPEPSO). The proposed algorithm consists of three existing efficient and simple PSO searching strategies. The particles are divided into four subpopulations including three indicator subpopulations and one reward subpopulation. Particles in the three indicator subpopulations update their velocities by different strategies. During every learning period, the improved function values of the three strategies are recorded. At the end of a learning period, the reward subpopulation is allocated to the best-performed strategy. Therefore, the appropriate PSO searching strategy can have more computational expense. The performance of MPEPSO is evaluated by the CEC 2014 test suite and compared with six other efficient PSO variants. These results suggest that MPEPSO ranks the first among these algorithms. Moreover, MPEPSO is applied to solve four engineering design problems. The results show the advantages of MPEPSO. The MATLAB source codes of MPEPSO are available at https://github.com/zi-ang-liu/MPEPSO.

On combinatorial design spaces for the configuration design of product families

2001 ◽  
Vol 15 (2) ◽  
pp. 91-108 ◽  
Author(s):  
ZAHED SIDDIQUE ◽  
DAVID W. ROSEN
Keyword(s):  
Engineering Design ◽  
Design Space ◽  
Optimization Problems ◽  
Product Family ◽  
Product Variety ◽  
Combinatorial Design ◽  
Configuration Design ◽  
Design Problems ◽  
Engineering Design Problems ◽  
Space Modeling

For typical optimization problems, the design space of interest is well defined: It is a subset of Rn, where n is the number of (continuous) variables. Constraints are often introduced to eliminate infeasible regions of this space from consideration. Many engineering design problems can be formulated as search in such a design space. For configuration design problems, however, the design space is much more difficult to define precisely, particularly when constraints are present. Configuration design spaces are discrete and combinatorial in nature, but not necessarily purely combinatorial, as certain combinations represent infeasible designs. One of our primary design objectives is to drastically reduce the effort to explore large combinatorial design spaces. We believe it is imperative to develop methods for mathematically defining design spaces for configuration design. The purpose of this paper is to outline our approach to defining configuration design spaces for engineering design, with an emphasis on the mathematics of the spaces and their combinations into larger spaces that more completely capture design requirements. Specifically, we introduce design spaces that model physical connectivity, functionality, and assemblability considerations for a representative product family, a class of coffeemakers. Then, we show how these spaces can be combined into a “common” product variety design space. We demonstrate how constraints can be defined and applied to these spaces so that feasible design regions can be directly modeled. Additionally, we explore the topological and combinatorial properties of these spaces. The application of this design space modeling methodology is illustrated using the coffeemaker product family.

An Effective Chaotic Cultural-Based Particle Swarm Optimization for Constrained Engineering Design Problems

2010 ◽  
Vol 20-23 ◽  
pp. 64-69 ◽  
Author(s):  
Yong Quan Zhou ◽  
Lingzi Liu
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Engineering Design ◽  
Search Strategy ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Design Problems ◽  
Swarm Optimization ◽  
Engineering Design Problems ◽  
Local Search Strategy

In this paper, a novel chaotic cultural-based particle swarm optimization algorithm (CCPSO) is proposed for constrained optimization problems by employing cultural-based particle swarm optimization (CPSO) algorithm and the notion of chaotic local search strategy. In the CCPSO, the shortcoming of cultural-based particle swarm optimization (CPSO) that it is easy to trap into local minimum be overcome, the chaotic local search strategy is introduced in the influence functions of cultural algorithm. Simulation results based on well-known constrained engineering design problems demonstrate the effectiveness, efficiency and robustness on initial populations of the proposed method.

Quantified Relations: A Class of Predicate Logic Design Constraints Among Sets of Manufacturing, Operating, and Other Variations

1996 ◽  
Author(s):  
William W. Finch ◽  
Allen C. Ward
Keyword(s):  
Engineering Design ◽  
Predicate Logic ◽  
Operating Conditions ◽  
Causal Relationships ◽  
Engineering Systems ◽  
Multiple Sources ◽  
Design Problems ◽  
Engineering Design Problems ◽  
Computing Effort ◽  
And Performance

Abstract This paper addresses a class of engineering design problems in which multiple sources of variations affect a product’s design, manufacture, and performance. Examples of these sources include uncertainty in nominal dimensions, variations in manufacture, changing environmental or operating conditions, and operator adjustments. Quantified relations (QR’s) are defined as a class of predicate logic expressions representing constraints between sets of design variations. Within QR’s, each variable’s quantifier and the order of quantification express a physical system’s causal relationships. This paper also presents an algorithm which propagates intervals through QR’s involving continuous, monotonic equations. Causal relationships between variables in engineering systems are discussed, and a tabular representation for them is presented. This work aims to broaden the application of automated constraint satisfaction algorithms, shortening design cycles for this class of problem by reducing modeling, and possibly computing effort. It seems to subsume Ward’s prior work on the Label Interval Calculus, extending the approach to a wider range of engineering design problems.

scholarly journals A Hybrid Pathfinder Optimizer for Unconstrained and Constrained Optimization Problems

2020 ◽  
Vol 2020 ◽  
pp. 1-25
Author(s):  
Xiangbo Qi ◽  
Zhonghu Yuan ◽  
Yan Song
Keyword(s):  
Engineering Design ◽  
Optimization Problems ◽  
Continuous Functions ◽  
The Other ◽  
Constrained Optimization Problems ◽  
Design Problems ◽  
Constrained Problems ◽  
Engineering Design Problems ◽  
Comparison Algorithms ◽  
Searching Ability

Hybridization of metaheuristic algorithms with local search has been investigated in many studies. This paper proposes a hybrid pathfinder algorithm (HPFA), which incorporates the mutation operator in differential evolution (DE) into the pathfinder algorithm (PFA). The proposed algorithm combines the searching ability of both PFA and DE. With a test on a set of twenty-four unconstrained benchmark functions including both unimodal continuous functions, multimodal continuous functions, and composition functions, HPFA is proved to have significant improvement over the pathfinder algorithm and the other comparison algorithms. Then HPFA is used for data clustering, constrained problems, and engineering design problems. The experimental results show that the proposed HPFA got better results than the other comparison algorithms and is a competitive approach for solving partitioning clustering, constrained problems, and engineering design problems.

Sign in / Sign up

Export Citation Format

Share Document