Thermal morphing anisogrid smart space structures part 2: Ranking of geometric parameter importance, trust region optimization, and performance evaluation

2017 ◽  
Vol 24 (13) ◽  
pp. 2873-2893 ◽  
Author(s):  
Austin A Phoenix ◽  
Jeff Borggaard ◽  
Pablo A Tarazaga

As future space mission structures are required to achieve more with scarcer resources, new structural configurations and modeling capabilities will be needed to meet the next generation space structural challenges. A paradigm shift is required away from the current structures that are static, heavy, and stiff, to innovative lightweight structures that meet requirements by intelligently adapting to the environment. As the complexity of these intelligent structures increases, the computational cost of the modeling and optimization efforts become increasingly demanding. Novel methods that identify and reduce the number of parameters to only those most critical considerably reduce these complex problems, allowing highly iterative evaluations and in-depth optimization efforts to be computationally feasible. This parameter ranking methodology will be demonstrated on the optimization of the thermal morphing anisogrid boom. The proposed novel morphing structure provides high precision morphing through the use of thermal strain as the sole actuation mechanism. The morphing concept uses the helical members in the anisogrid structure to provide complex constrained actuations that can achieve the six degree of freedom morphing capability. This structure provides a unique potential to develop an integrated structural morphing system, where the adaptive morphing capability is integrated directly into the primary structure. To identify parameters of interest, the Q-DEIM model reduction algorithm is implemented to rank the model parameters based on their impact on the morphing performance. This parameter ranking method provides insight into the system and enables the optimal allocation of computational and engineering resources to the most critical areas of the system for optimization. The methodology, in conjunction with a singular value decomposition (SVD), provides a ranking and identifies parameters of relative importance. The SVD is used to truncate the nine parameters problem at two locations, generating a five parameter optimization problem and a three parameter optimization problem. To evaluate the ranking, a parameter sweep in conjunction with a simple minimum cost function search algorithm will compare all 120 five parameter ranking orders to the Q-DEIM ranking. This reduced parameter set significantly reduces the parameter complexity and the computational cost of the model optimization. This paper will present the methodology to define the resulting performance of the optimal thermal morphing anisogrid structure, minimum morphing control, and the systems frequency response capability as a function of available power.

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Danni Chen ◽  
JianDong Zhao ◽  
Peng Huang ◽  
Xiongna Deng ◽  
Tingting Lu

Purpose Sparrow search algorithm (SSA) is a novel global optimization method, but it is easy to fall into local optimization, which leads to its poor search accuracy and stability. The purpose of this study is to propose an improved SSA algorithm, called levy flight and opposition-based learning (LOSSA), based on LOSSA strategy. The LOSSA shows better search accuracy, faster convergence speed and stronger stability. Design/methodology/approach To further enhance the optimization performance of the algorithm, The Levy flight operation is introduced into the producers search process of the original SSA to enhance the ability of the algorithm to jump out of the local optimum. The opposition-based learning strategy generates better solutions for SSA, which is beneficial to accelerate the convergence speed of the algorithm. On the one hand, the performance of the LOSSA is evaluated by a set of numerical experiments based on classical benchmark functions. On the other hand, the hyper-parameter optimization problem of the Support Vector Machine (SVM) is also used to test the ability of LOSSA to solve practical problems. Findings First of all, the effectiveness of the two improved methods is verified by Wilcoxon signed rank test. Second, the statistical results of the numerical experiment show the significant improvement of the LOSSA compared with the original algorithm and other natural heuristic algorithms. Finally, the feasibility and effectiveness of the LOSSA in solving the hyper-parameter optimization problem of machine learning algorithms are demonstrated. Originality/value An improved SSA based on LOSSA is proposed in this paper. The experimental results show that the overall performance of the LOSSA is satisfactory. Compared with the SSA and other natural heuristic algorithms, the LOSSA shows better search accuracy, faster convergence speed and stronger stability. Moreover, the LOSSA also showed great optimization performance in the hyper-parameter optimization of the SVM model.


2021 ◽  
Vol 7 ◽  
pp. e708
Author(s):  
Essam H. Houssein ◽  
Gamela Nageh ◽  
Mohamed Abd Elaziz ◽  
Eman Younis

The use of solar photovoltaic systems (PVs) is increasing as a clean and affordable source of electric energy. The Pv cell is the main component of the PV system. To improve the performance, control, and evaluation of the PV system, it is necessary to provide accurate design and to define the intrinsic parameters of the solar cells. There are many methods for optimizing the parameters of the solar cells. The first class of methods is called the analytical methods that provide the model parameters using datasheet information or I–V curve data. The second class of methods is the optimization-based methods that define the problem as an optimization problem. The optimization problem objective is to minimize the error metrics and it is solved using metaheuristic optimization algorithms. The third class of methods is composed of a hybrid of both the analytical and the metaheuristic approaches, some parameters are computed by the analytical approach and the rest are found using metaheuristic optimization algorithms. Research in this area faces two challenges; (1) finding an optimal model for the parameters of the solar cells and (2) the lack of data about the photovoltaic cells. This paper proposes an optimization-based algorithm for accurately estimating the parameters of solar cells. It is using the Improved Equilibrium Optimizer algorithm (IEO). This algorithm is improved using the Opposition Based Learning (OBL) at the initialization phase of EO to improve its population diversity in the search space. Opposition-based Learning (OBL) is a new concept in machine learning inspired by the opposite relationship among entities. There are two common models for solar cells; the single diode model (SDM) and double diode model (DDM) have been used to demonstrate the capabilities of IEO in estimating the parameters of solar cells. The proposed methodology can find accurate solutions while reducing the computational cost. Compared to other existing techniques, the proposed algorithm yields less mean absolute error. The results were compared with seven optimization algorithms using data of different solar cells and PV panels. The experimental results revealed that IEO is superior to the most competitive algorithms in terms of the accuracy of the final solutions.


2000 ◽  
Author(s):  
Ronald H. Nickel ◽  
Igor Mikolic-Torreira ◽  
Jon W. Tolle

Abstract We present a new methodology called Multi-Indenture, Multi-Echelon Readiness-Based Sparing (MIMERBS) for solving large, non-linear integer optimization problems that arise in determining the retail and wholesale sparing policies that support the aircraft operating from a deployed aircraft carrier. MIMERBS determines the minimum cost mix of spare parts that meets required levels of expected aircraft availability. The size (thousands of variables), the nonlinear relationship between spare parts and aircraft availability, and the requirement that the variables be integers make this problem hard. We provide a concise description of the MIMERBS model and present data to show how it improves on earlier sparing models. This improvement comes at the price of significant computationally complexity, which in turn makes the optimization problem hard to solve. We describe how we integrated an interior point method with a direct search algorithm to solve this optimization problem. This hybrid algorithm is well suited for implementation on a home-made virtual super-computer made up of several dozen Windows NT computers connected by an office LAN. A description of the virtual super-computer is given in a separate paper. We report on three specific cases we solved using the MIMERBS model, having from 1,000 to 8,000 optimization variables.


Author(s):  
Ronan Keane ◽  
H. Oliver Gao

Before a car-following model can be applied in practice, it must first be validated against real data in a process known as calibration. This paper discusses the formulation of calibration as an optimization problem and compares different algorithms for its solution. The optimization consists of an arbitrary car following model, posed as either an ordinary or delay differential equation, being calibrated to an arbitrary source of trajectory data that may include lane changes. Typically, the calibration problem is solved using gradient free optimization. In this work, the gradient of the optimization problem is derived analytically using the adjoint method. The computational cost of the adjoint method does not scale with the number of model parameters, which makes it more efficient than evaluating the gradient numerically using finite differences. Numerical results are presented that show that quasi-Newton algorithms using the adjoint method are significantly faster than a genetic algorithm and also achieve slightly better accuracy of the calibrated model.


Author(s):  
Tung T. Vu ◽  
Ha Hoang Kha

In this research work, we investigate precoder designs to maximize the energy efficiency (EE) of secure multiple-input multiple-output (MIMO) systems in the presence of an eavesdropper. In general, the secure energy efficiency maximization (SEEM) problem is highly nonlinear and nonconvex and hard to be solved directly. To overcome this difficulty, we employ a branch-and-reduce-and-bound (BRB) approach to obtain the globally optimal solution. Since it is observed that the BRB algorithm suffers from highly computational cost, its globally optimal solution is importantly served as a benchmark for the performance evaluation of the suboptimal algorithms. Additionally, we also develop a low-complexity approach using the well-known zero-forcing (ZF) technique to cancel the wiretapped signal, making the design problem more amenable. Using the ZF based method, we transform the SEEM problem to a concave-convex fractional one which can be solved by applying the combination of the Dinkelbach and bisection search algorithm. Simulation results show that the ZF-based method can converge fast and obtain a sub-optimal EE performance which is closed to the optimal EE performance of the BRB method. The ZF based scheme also shows its advantages in terms of the energy efficiency in comparison with the conventional secrecy rate maximization precoder design.


2019 ◽  
Vol 147 (5) ◽  
pp. 1429-1445 ◽  
Author(s):  
Yuchu Zhao ◽  
Zhengyu Liu ◽  
Fei Zheng ◽  
Yishuai Jin

Abstract We performed parameter estimation in the Zebiak–Cane model for the real-world scenario using the approach of ensemble Kalman filter (EnKF) data assimilation and the observational data of sea surface temperature and wind stress analyses. With real-world data assimilation in the coupled model, our study shows that model parameters converge toward stable values. Furthermore, the new parameters improve the real-world ENSO prediction skill, with the skill improved most by the parameter of the highest climate sensitivity (gam2), which controls the strength of anomalous upwelling advection term in the SST equation. The improved prediction skill is found to be contributed mainly by the improvement in the model dynamics, and second by the improvement in the initial field. Finally, geographic-dependent parameter optimization further improves the prediction skill across all the regions. Our study suggests that parameter optimization using ensemble data assimilation may provide an effective strategy to improve climate models and their real-world climate predictions in the future.


Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 857
Author(s):  
Jahedul Islam ◽  
Md Shokor A. Rahaman ◽  
Pandian M. Vasant ◽  
Berihun Mamo Negash ◽  
Ahshanul Hoqe ◽  
...  

Well placement optimization is considered a non-convex and highly multimodal optimization problem. In this article, a modified crow search algorithm is proposed to tackle the well placement optimization problem. This article proposes modifications based on local search and niching techniques in the crow search algorithm (CSA). At first, the suggested approach is verified by experimenting with the benchmark functions. For test functions, the results of the proposed approach demonstrated a higher convergence rate and a better solution. Again, the performance of the proposed technique is evaluated with well placement optimization problem and compared with particle swarm optimization (PSO), the Gravitational Search Algorithm (GSA), and the Crow search algorithm (CSA). The outcomes of the study revealed that the niching crow search algorithm is the most efficient and effective compared to the other techniques.


2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Jing Tian ◽  
Jianping Zhao ◽  
Chunhou Zheng

Abstract Background In recent years, various sequencing techniques have been used to collect biomedical omics datasets. It is usually possible to obtain multiple types of omics data from a single patient sample. Clustering of omics data plays an indispensable role in biological and medical research, and it is helpful to reveal data structures from multiple collections. Nevertheless, clustering of omics data consists of many challenges. The primary challenges in omics data analysis come from high dimension of data and small size of sample. Therefore, it is difficult to find a suitable integration method for structural analysis of multiple datasets. Results In this paper, a multi-view clustering based on Stiefel manifold method (MCSM) is proposed. The MCSM method comprises three core steps. Firstly, we established a binary optimization model for the simultaneous clustering problem. Secondly, we solved the optimization problem by linear search algorithm based on Stiefel manifold. Finally, we integrated the clustering results obtained from three omics by using k-nearest neighbor method. We applied this approach to four cancer datasets on TCGA. The result shows that our method is superior to several state-of-art methods, which depends on the hypothesis that the underlying omics cluster class is the same. Conclusion Particularly, our approach has better performance than compared approaches when the underlying clusters are inconsistent. For patients with different subtypes, both consistent and differential clusters can be identified at the same time.


Electronics ◽  
2021 ◽  
Vol 10 (14) ◽  
pp. 1648
Author(s):  
Marinko Barukčić ◽  
Toni Varga ◽  
Vedrana Jerković Jerković Štil ◽  
Tin Benšić

The paper researches the impact of the input data resolution on the solution of optimal allocation and power management of controllable and non-controllable renewable energy sources distributed generation in the distribution power system. Computational intelligence techniques and co-simulation approach are used, aiming at more realistic system modeling and solving the complex optimization problem. The optimization problem considers the optimal allocation of all distributed generations and the optimal power control of controllable distributed generations. The co-simulation setup employs a tool for power system analysis and a metaheuristic optimizer to solve the optimization problem. Three different resolutions of input data (generation and load profiles) are used: hourly, daily, and monthly averages over one year. An artificial neural network is used to estimate the optimal output of controllable distributed generations and thus significantly decrease the dimensionality of the optimization problem. The proposed procedure is applied on a 13 node test feeder proposed by the Institute of Electrical and Electronics Engineers. The obtained results show a huge impact of the input data resolution on the optimal allocation of distributed generations. Applying the proposed approach, the energy losses are decreased by over 50–70% by the optimal allocation and control of distributed generations depending on the tested network.


Sign in / Sign up

Export Citation Format

Share Document