scholarly journals Faired MISO B-Spline Fuzzy Systems and Its Applications

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Tan Yanhua ◽  
Li Hongxing
Keyword(s):  
Fuzzy System ◽  
Fuzzy Systems ◽  
Optimization Problem ◽  
Inverted Pendulum ◽  
Optimal Solution ◽  
Solution Vector ◽  
B Spline ◽  
Variable Universe ◽  
Inexact Data ◽  
Better Than

We construct two classes of faired MISO B-spline fuzzy systems using the fairing method in computer-aided geometric design (CAGD) for reducing adverse effects of the inexact data. Towards this goal, we generalize the faring method to high-dimension cases so that the faring method only for SISO and DISO B-spline fuzzy systems is extended to fair the MISO ones. Then the problem to construct a faired MISO B-spline fuzzy systems is transformed into solving an optimization problem with a strictly convex quadratic objective function and the unique optimal solution vector is taken as linear combination coefficients of the basis functions for a certain B-spline fuzzy system to obtain a faired MISO B-spline fuzzy system. Furthermore, we design variable universe adaptive fuzzy controllers by B-spline fuzzy systems and faired B-spline fuzzy systems to stabilize the double inverted pendulum. The simulation results show that the controllers by faired B-spline fuzzy systems perform better than those by B-spline fuzzy systems, especially when the data for fuzzy systems are inexact.

scholarly journals A Simple Fitness Function for Minimum Attribute Reduction

2015 ◽  
Vol 2015 ◽  
pp. 1-6
Author(s):  
Yuebin Su ◽  
Jin Guo ◽  
Zejun Li
Keyword(s):  
Heuristic Search ◽  
Optimization Problem ◽  
Fitness Function ◽  
Attribute Reduction ◽  
Optimal Solution ◽  
Boolean Space ◽  
Fitness Functions ◽  
Minimal Subset ◽  
Classification Quality ◽  
Better Than

The goal of minimal attribute reduction is to find the minimal subsetRof the condition attribute setCsuch thatRhas the same classification quality asC. This problem is well known to be NP-hard. When only one minimal attribute reduction is required, it was transformed into a nonlinearly constrained combinatorial optimization problem over a Boolean space and some heuristic search approaches were used. In this case, the fitness function is one of the keys of this problem. It required that the fitness function must satisfy the equivalence between the optimal solution and the minimal attribute reduction. Unfortunately, the existing fitness functions either do not meet the equivalence, or are too complicated. In this paper, a simple and better fitness function based on positive domain was given. Theoretical proof shows that the optimal solution is equivalent to minimal attribute reduction. Experimental results show that the proposed fitness function is better than the existing fitness function for each algorithm in test.

A new algorithm for finding CRM-model coefficients

2019 ◽  
Vol 5 (3) ◽  
pp. 164-185 ◽  
Author(s):  
Alexander D. Bekman ◽  
Sergey V. Stepanov ◽  
Alexander A. Ruchkin ◽  
Dmitry V. Zelenin
Keyword(s):  
Approximate Solution ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Complex Form ◽  
Approximate Solutions ◽  
The Other ◽  
Programming Algorithm ◽  
Stochastic Algorithms ◽  
Large Set ◽  
Flow Rates

The quantitative evaluation of producer and injector well interference based on well operation data (profiles of flow rates/injectivities and bottomhole/reservoir pressures) with the help of CRM (Capacitance-Resistive Models) is an optimization problem with large set of variables and constraints. The analytical solution cannot be found because of the complex form of the objective function for this problem. Attempts to find the solution with stochastic algorithms take unacceptable time and the result may be far from the optimal solution. Besides, the use of universal (commercial) optimizers hides the details of step by step solution from the user, for example&nbsp;— the ambiguity of the solution as the result of data inaccuracy.<br> The present article concerns two variants of CRM problem. The authors present a new algorithm of solving the problems with the help of “General Quadratic Programming Algorithm”. The main advantage of the new algorithm is the greater performance in comparison with the other known algorithms. Its other advantage is the possibility of an ambiguity analysis. This article studies the conditions which guarantee that the first variant of problem has a unique solution, which can be found with the presented algorithm. Another algorithm for finding the approximate solution for the second variant of the problem is also considered. The method of visualization of approximate solutions set is presented. The results of experiments comparing the new algorithm with some previously known are given.

scholarly journals Algebraic Solution to Constrained Bi-Criteria Decision Problem of Rating Alternatives through Pairwise Comparisons

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 303
Author(s):  
Nikolai Krivulin
Keyword(s):  
Decision Problem ◽  
Optimization Problem ◽  
Pareto Frontier ◽  
Sufficient Conditions ◽  
Approximation Error ◽  
Optimal Solution ◽  
Algebraic Solution ◽  
Pairwise Comparisons ◽  
Logarithmic Scale ◽  
Idempotent Algebra

We consider a decision-making problem to evaluate absolute ratings of alternatives from the results of their pairwise comparisons according to two criteria, subject to constraints on the ratings. We formulate the problem as a bi-objective optimization problem of constrained matrix approximation in the Chebyshev sense in logarithmic scale. The problem is to approximate the pairwise comparison matrices for each criterion simultaneously by a common consistent matrix of unit rank, which determines the vector of ratings. We represent and solve the optimization problem in the framework of tropical (idempotent) algebra, which deals with the theory and applications of idempotent semirings and semifields. The solution involves the introduction of two parameters that represent the minimum values of approximation error for each matrix and thereby describe the Pareto frontier for the bi-objective problem. The optimization problem then reduces to a parametrized vector inequality. The necessary and sufficient conditions for solutions of the inequality serve to derive the Pareto frontier for the problem. All solutions of the inequality, which correspond to the Pareto frontier, are taken as a complete Pareto-optimal solution to the problem. We apply these results to the decision problem of interest and present illustrative examples.

scholarly journals Quit When You Can: Efficient Evaluation of Ensembles by Optimized Ordering

2021 ◽  
Vol 17 (4) ◽  
pp. 1-20
Author(s):  
Serena Wang ◽  
Maya Gupta ◽  
Seungil You
Keyword(s):  
Optimization Problem ◽  
Optimal Solution ◽  
Combinatorial Optimization Problem ◽  
Joint Optimization ◽  
Early Stopping ◽  
Time Approximation ◽  
Approximation Bound ◽  
Evaluation Time ◽  
Speed Up ◽  
Real World Problems

Given a classifier ensemble and a dataset, many examples may be confidently and accurately classified after only a subset of the base models in the ensemble is evaluated. Dynamically deciding to classify early can reduce both mean latency and CPU without harming the accuracy of the original ensemble. To achieve such gains, we propose jointly optimizing the evaluation order of the base models and early-stopping thresholds. Our proposed objective is a combinatorial optimization problem, but we provide a greedy algorithm that achieves a 4-approximation of the optimal solution under certain assumptions, which is also the best achievable polynomial-time approximation bound. Experiments on benchmark and real-world problems show that the proposed Quit When You Can (QWYC) algorithm can speed up average evaluation time by 1.8–2.7 times on even jointly trained ensembles, which are more difficult to speed up than independently or sequentially trained ensembles. QWYC’s joint optimization of ordering and thresholds also performed better in experiments than previous fixed orderings, including gradient boosted trees’ ordering.

scholarly journals Robust Beamforming Design for Secure V2X Downlink System with Wireless Information and Power Transfer under a Nonlinear Energy Harvesting Model

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3294 ◽  
Author(s):  
Shidang Li ◽  
Chunguo Li ◽  
Weiqiang Tan ◽  
Baofeng Ji ◽  
Luxi Yang
Keyword(s):  
Energy Harvesting ◽  
Traffic Safety ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Base Station ◽  
Power Splitting ◽  
Power Transfer ◽  
Vehicular Communication ◽  
Downlink System ◽  
Nonlinear Energy

Vehicle to everything (V2X) has been deemed a promising technology due to its potential to achieve traffic safety and efficiency. This paper considers a V2X downlink system with a simultaneous wireless information and power transfer (SWIPT) system where the base station not only conveys data and energy to two types of wireless vehicular receivers, such as one hybrid power-splitting vehicular receiver, and multiple energy vehicular receivers, but also prevents information from being intercepted by the potential eavesdroppers (idle energy vehicular receivers). Both the base station and the energy vehicular receivers are equipped with multiple antennas, whereas the information vehicular receiver is equipped with a single antenna. In particular, the imperfect channel state information (CSI) and the practical nonlinear energy harvesting (EH) model are taken into account. The non-convex optimization problem is formulated to maximize the minimum harvested energy power among the energy vehicular receivers satisfying the lowest harvested energy power threshold at the information vehicular receiver and secure vehicular communication requirements. In light of the intractability of the optimization problem, the semidefinite relaxation (SDR) technique and variable substitutions are applied, and the optimal solution is proven to be tight. A number of results demonstrate that the proposed robust secure beamforming scheme has better performance than other schemes.

Design Optimization of a 3D Parameterized Vane Cascade With Non-Axisymmetric Endwall Based on a Modified EGO Algorithm and Data Mining Techniques

2017 ◽  
Author(s):  
Chenxi Li ◽  
Zhendong Guo ◽  
Liming Song ◽  
Jun Li ◽  
Zhenping Feng
Keyword(s):  
Data Mining ◽  
Global Optimization ◽  
Design Space ◽  
Pressure Coefficient ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Efficient Global Optimization ◽  
Data Mining Techniques ◽  
Parallel Axis ◽  
Better Than

The design of turbomachinery cascades is a typical high dimensional and computationally expensive problem, a metamodel-based global optimization and data mining method is proposed to solve it. A modified Efficient Global Optimization (EGO) algorithm named Multi-Point Search based Efficient Global Optimization (MSEGO) is proposed, which is characterized by adding multiple samples at per iteration. By testing on typical mathematical functions, MSEGO outperforms EGO in accuracy and convergence rate. MSEGO is used for the optimization of a turbine vane with non-axisymmetric endwall contouring (NEC), the total pressure coefficient of the optimal vane is increased by 0.499%. Under the same settings, another two optimization processes are conducted by using the EGO and an Adaptive Range Differential Evolution algorithm (ARDE), respectively. The optimal solution of MSEGO is far better than EGO. While achieving similar optimal solutions, the cost of MSEGO is only 3% of ARDE. Further, data mining techniques are used to extract information of design space and analyze the influence of variables on design performance. Through the analysis of variance (ANOVA), the variables of section profile are found to have most significant effects on cascade loss performance. However, the NEC seems not so important through the ANOVA analysis. This is due to the fact the performance difference between different NEC designs is very small in our prescribed space. However, the designs with NEC are always much better than the reference design as shown by parallel axis, i.e., the NEC would significantly influence the cascade performance. Further, it indicates that the ensemble learning by combing results of ANOVA and parallel axis is very useful to gain full knowledge from the design space.

scholarly journals Topology Optimization of Automotive sheet metal part using Altair Inspire

2020 ◽  
Vol 5 (3) ◽  
pp. 143-150
Author(s):  
Netsanet Ferede
Keyword(s):  
Topology Optimization ◽  
Sheet Metal ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Sheet Metal Part ◽  
Metal Part ◽  
Solution Quality ◽  
Design Engineers ◽  
Automotive Sheet ◽  
Reduced Costs

In an optimization problem, different candidate solutions are compared with each other, and then the best or optimal solution is obtained which means that solution quality is fundamental. Topology optimization is used at the concept stage of design. It deals with the optimal distribution of material within the structure. Altair Inspire software is the industry's most powerful and easy-to-use Generative Design/Topology Optimization and rapid simulation solution for design engineers. In this paper Topology optimization is applied using Altair inspire to optimize the Sheet metal Angle bracket. Different results are conducted the better and final results are fulfilling the goal of the paper which is minimizing the mass of the sheet metal part by 65.9%  part and Maximizing the stiffness with Better Results of Von- Miss Stress Analysis,  Displacement, and comparison with different load cases.  This can lead to reduced costs, development time, material consumption, and product less weight.

scholarly journals Nonpreemptive Goal Programing Method in Optimization Nurse Scheduling by Considering Education Level

2021 ◽  
Vol 22 (2) ◽  
pp. 85
Author(s):  
Fitriani Utina ◽  
Lailany Yahya ◽  
Nurwan Nurwan
Keyword(s):  
Goal Programming ◽  
Undergraduate Education ◽  
Optimal Solution ◽  
Education Level ◽  
Programming Method ◽  
Nurse Scheduling ◽  
Optimal Service ◽  
Schedule Design ◽  
Good Nurse ◽  
Better Than

Nurse scheduling is one of the problems that often arise in hospital management systems. Head of ICU room and nurse to cooperate in making good nurse scheduling for the creation of optimal service. In this paper, we study a hospital nurse schedule design by considering the level of nurse education and the provision of holidays. Nurses with undergraduate education (S1) Nurses become leaders on every shift and are accompanied by nurses with diploma education (D3). The scheduling model in this study using the nonpreemptive goal programming method and LINGO 11.0 software. The preparation of the schedule of nurses assigned to this method can optimize the need for efficient nurses per shift based on education level. The data in the research was obtained by collecting administrative data at Aloei Saboe Gorontalo hospital. The data used are the published schedule by the head of the ICU room. In making a nurse schedule, there are limitations to consider such ashospital regulation. The results of the study obtained an optimal solution in the form of meeting all the desired obstacles. Computational results shows that nurse scheduling using the nonpreemptive goal programming method and LINGO 11.0 software better than the schedule created manually. Every shift is a maximum of one leader with an undergraduate education (S1) background and accompanied by a nurse with a diploma education (D3) background. Keywords: scheduling, goal programming, nonpreemptive goal programming.

scholarly journals Design of SkSP-R Variables Sampling Plans

2015 ◽  
Vol 38 (2) ◽  
pp. 413-429 ◽  
Author(s):  
Muhammad Aslam ◽  
Saminathan Balamurali ◽  
Chi-Hyuck Jun ◽  
Batool Hussain
Keyword(s):  
Nonlinear Optimization ◽  
Optimization Problem ◽  
Sampling Plan ◽  
Producer’S Risk ◽  
Sample Number ◽  
Sampling Plans ◽  
Average Sample Number ◽  
Nonlinear Optimization Problem ◽  
Better Than ◽  
Average Sample

In this paper, we present the designing of the skip-lot sampling plan including the re-inspection  called SkSP-R. The plan parameters of the proposed plan are determined through a  nonlinear optimization problem by minimizing the average sample number satisfying both the producer's risk and the consumer's risks. The proposed plan is shown to perform better than the existing sampling plans in terms of the average sample number. The application of the proposed plan is explained with the help of illustrative examples.

Sign in / Sign up

Export Citation Format

Share Document