Optimal Design of Vibrating Systems Through Partial Eigenstructure Assignment

2016 ◽  
Vol 138 (7) ◽  
Author(s):  
Roberto Belotti ◽  
Dario Richiedei ◽  
Alberto Trevisani
Keyword(s):  
Optimal Solution ◽  
Mode Shapes ◽  
Eigenstructure Assignment ◽  
Optimization Strategy ◽  
Modification Method ◽  
Global Optimal ◽  
The Cost ◽  
Bilinear Terms ◽  
Vibrating Systems ◽  
Homotopy Optimization

This paper proposes an inverse structural modification method for eigenstructure assignment (EA), which allows to assign the desired mode shapes only at the parts of interest of the system. The presence of unimposed eigenvector entries leads to a nonconvex problem. Therefore, to boost the convergence to a global optimal solution, a homotopy optimization strategy is implemented based on the convex approximation of the cost function. Such a relaxation is performed through some auxiliary variables and through the McCormick's relaxation of the occurring bilinear terms. The approach handles general assignment tasks, with an arbitrary number of modification parameters and prescribed eigenpairs.

Antiresonance Assignment in Point and Cross Receptances for Undamped Vibrating Systems

2020 ◽  
Vol 142 (2) ◽  
Author(s):  
Roberto Belotti ◽  
Dario Richiedei ◽  
Iacopo Tamellin
Keyword(s):  
Degrees Of Freedom ◽  
Structural Modification ◽  
Original System ◽  
Test Cases ◽  
Optimization Approach ◽  
Modification Method ◽  
Solving Strategy ◽  
Assignment Approach ◽  
Vibrating Systems ◽  
Homotopy Optimization

Abstract This paper proposes an inverse structural modification method for the assignment of antiresonances in undamped vibrating systems by modifying the inertial and elastic properties of the existing degrees of freedom of the original system. Hence, no additional degrees of freedom are added to the system. The problem is formulated as an eigenstructure assignment approach since such a novel formulation is suitable for complex systems, such as those modeled through finite elements. Indeed, these systems are difficult to handle with the methods already proposed in the literature. Additionally, the proposed approach is suitable for both point and cross receptances. Assignment is cast as a constrained non-convex non-linear minimization problem and the proposed solving strategy is based on the homotopy optimization approach. The method effectiveness is shown through three meaningful test cases.

OPTIMAL FEASIBLE SOLUTIONS TO A ROAD FREIGHT TRANSPORTATION PROBLEM

2020 ◽  
Vol 5 (1) ◽  
pp. 456
Author(s):  
Tolulope Latunde ◽  
Joseph Oluwaseun Richard ◽  
Opeyemi Odunayo Esan ◽  
Damilola Deborah Dare
Keyword(s):  
Transportation Problem ◽  
Optimal Solution ◽  
Transportation Cost ◽  
North West ◽  
Life Problems ◽  
Basic Feasible Solutions ◽  
Feasible Solutions ◽  
Road Freight Transportation ◽  
The Cost ◽  
Cost Of Transportation

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.

AO-BBO: A Novel Optimization Algorithm and Its Application in Plant Drug Extraction

2019 ◽  
Vol 19 (2) ◽  
pp. 139-145 ◽  
Author(s):  
Bote Lv ◽  
Juan Chen ◽  
Boyan Liu ◽  
Cuiying Dong
Keyword(s):  
Optimization Algorithm ◽  
Learning Strategy ◽  
Optimal Solution ◽  
Population Diversity ◽  
Global Optimal Solution ◽  
Plant Medicine ◽  
Suitability Index ◽  
Sensing Model ◽  
Local Optimal Solution ◽  
Global Optimal

<P>Introduction: It is well-known that the biogeography-based optimization (BBO) algorithm lacks searching power in some circumstances. </P><P> Material & Methods: In order to address this issue, an adaptive opposition-based biogeography-based optimization algorithm (AO-BBO) is proposed. Based on the BBO algorithm and opposite learning strategy, this algorithm chooses different opposite learning probabilities for each individual according to the habitat suitability index (HSI), so as to avoid elite individuals from returning to local optimal solution. Meanwhile, the proposed method is tested in 9 benchmark functions respectively. </P><P> Result: The results show that the improved AO-BBO algorithm can improve the population diversity better and enhance the search ability of the global optimal solution. The global exploration capability, convergence rate and convergence accuracy have been significantly improved. Eventually, the algorithm is applied to the parameter optimization of soft-sensing model in plant medicine extraction rate. Conclusion: The simulation results show that the model obtained by this method has higher prediction accuracy and generalization ability.</P>

scholarly journals Inclusion of Hydraulic Controls in Rehabilitation Models of Drainage Networks to Control Floods

Water ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 514
Author(s):  
Leonardo Bayas-Jiménez ◽  
F. Javier Martínez-Solano ◽  
Pedro L. Iglesias-Rey ◽  
Daniel Mora-Melia ◽  
Vicente S. Fuertes-Miquel
Keyword(s):  
Genetic Algorithm ◽  
Drainage System ◽  
Optimal Solution ◽  
Hydraulic Control ◽  
Drainage Systems ◽  
Storm Water Management Model ◽  
Drainage Networks ◽  
Extreme Rain ◽  
Rain Events ◽  
The Cost

A problem for drainage systems managers is the increase in extreme rain events that are increasing in various parts of the world. Their occurrence produces hydraulic overload in the drainage system and consequently floods. Adapting the existing infrastructure to be able to receive extreme rains without generating consequences for cities’ inhabitants has become a necessity. This research shows a new way to improve drainage systems with minimal investment costs, using for this purpose a novel methodology that considers the inclusion of hydraulic control elements in the network, the installation of storm tanks and the replacement of pipes. The presented methodology uses the Storm Water Management Model for the hydraulic analysis of the network and a modified Genetic Algorithm to optimize the network. In this algorithm, called the Pseudo-Genetic Algorithm, the coding of the chromosomes is integral and has been used in previous studies of hydraulic optimization. This work evaluates the cost of the required infrastructure and the damage caused by floods to find the optimal solution. The main conclusion of this study is that the inclusion of hydraulic controls can reduce the cost of network rehabilitation and decrease flood levels.

scholarly journals Optimization strategy of wireless charger node deployment based on improved cuckoo search algorithm

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yang Wang ◽  
Feifan Wang ◽  
Yujun Zhu ◽  
Yiyang Liu ◽  
Chuanxin Zhao
Keyword(s):  
Sensor Network ◽  
Sensor Node ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Sensor Nodes ◽  
Optimization Strategy ◽  
Multi Objective ◽  
Received Power

AbstractIn wireless rechargeable sensor network, the deployment of charger node directly affects the overall charging utility of sensor network. Aiming at this problem, this paper abstracts the charger deployment problem as a multi-objective optimization problem that maximizes the received power of sensor nodes and minimizes the number of charger nodes. First, a network model that maximizes the sensor node received power and minimizes the number of charger nodes is constructed. Second, an improved cuckoo search (ICS) algorithm is proposed. This algorithm is based on the traditional cuckoo search algorithm (CS) to redefine its step factor, and then use the mutation factor to change the nesting position of the host bird to update the bird’s nest position, and then use ICS to find the ones that maximize the received power of the sensor node and minimize the number of charger nodes optimal solution. Compared with the traditional cuckoo search algorithm and multi-objective particle swarm optimization algorithm, the simulation results show that the algorithm can effectively increase the receiving power of sensor nodes, reduce the number of charger nodes and find the optimal solution to meet the conditions, so as to maximize the network charging utility.

Application of partial eigenvalue assignment techniques to dampen electromechanical oscillations in multi-machine power systems

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Erick Baleeiro da Silva ◽  
José Mário Araújo
Keyword(s):  
Power Systems ◽  
The Other ◽  
Mode Shapes ◽  
Eigenstructure Assignment ◽  
Power System Stabilizers ◽  
Control Effort ◽  
Electromechanical Oscillations ◽  
Oscillation Modes ◽  
Partial Controllability

AbstractIn this study, a methodology for partial eigenstructure assignment (PEVA) is applied to dampen electromechanical oscillations in electrical multi-machine power systems. The approach is anchored in allocating a small number of undesirable eigenvalues, for example, which are poorly damped, preserving the other eigenvalues in the system - the so-called no-spillover spectrum. The new position of the selected eigenvalues is carried out based on the partial controllability analysis of the system, in order to minimize the control effort. Simulation examples using a system with 68 buses, 16 generators and five areas showed that the presented methodology is efficient in dampening the local and inter-area oscillation modes when compared to the classic power system stabilizers (PSS). The quality of the solution is illustrated through computer simulations, eigenvalues tables and mode-shapes.

scholarly journals Carbon Emission Reduction of Apparel Material Distribution Based on Multi-Objective Genetic Algorithm (NSGA-II)

2019 ◽  
Vol 11 (9) ◽  
pp. 2571
Author(s):  
Xujing Zhang ◽  
Lichuan Wang ◽  
Yan Chen
Keyword(s):  
Genetic Algorithm ◽  
Carbon Emissions ◽  
Optimal Solution ◽  
Material Distribution ◽  
Low Carbon ◽  
Nsga Ii ◽  
Management Objectives ◽  
Multi Objective Genetic Algorithm ◽  
Distribution Process ◽  
The Cost

Low-carbon production has become one of the top management objectives for every industry. In garment manufacturing, the material distribution process always generates high carbon emissions. In order to reduce carbon emissions and the number of operators to meet enterprises’ requirements to control the cost of production and protect the environment, the paths of material distribution were analyzed to find the optimal solution. In this paper, the model of material distribution to obtain minimum carbon emissions and vehicles (operators) was established to optimize the multi-target management in three different production lines (multi-line, U-shape two-line, and U-shape three-line), while the workstations were organized in three ways: in the order of processes, in the type of machines, and in the components of garment. The NSGA-II algorithm (non-dominated sorting genetic algorithm-II) was applied to obtain the results of this model. The feasibility of the model and algorithm was verified by the practice of men’s shirts manufacture. It could be found that material distribution of multi-line layout produced the least carbon emissions when the machines were arranged in the group of type.

scholarly journals An MEA-Tuning Method for Design of the PID Controller

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Yongli Zhang ◽  
Lijun Zhang ◽  
Zhiliang Dong
Keyword(s):  
Pid Controller ◽  
Industrial Process ◽  
Optimal Solution ◽  
Design Feature ◽  
Parameter Tuning ◽  
Parallel Structure ◽  
Evolutionary Information ◽  
Tuning Method ◽  
Efficiency And Effectiveness ◽  
Global Optimal

The optimization and tuning of parameters is very important for the performance of the PID controller. In this paper, a novel parameter tuning method based on the mind evolutionary algorithm (MEA) was presented. The MEA firstly transformed the problem solutions into the population individuals embodied by code and then divided the population into superior subpopulations and temporary subpopulations and used the similar taxis and dissimilation operations for searching the global optimal solution. In order to verify the control performance of the MEA, three classical functions and five typical industrial process control models were adopted for testing experiments. Experimental results indicated that the proposed approach was feasible and valid: the MEA with the superior design feature and parallel structure could memorize more evolutionary information, generate superior genes, and enhance the efficiency and effectiveness for searching global optimal parameters. In addition, the MEA-tuning method can be easily applied to real industrial practices and provides a novel and convenient solution for the optimization and tuning of the PID controller.

scholarly journals Best Proximity Point Results in Complex Valued Metric Spaces

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Binayak S. Choudhury ◽  
Nikhilesh Metiya ◽  
Pranati Maity
Keyword(s):  
Minimum Distance ◽  
Metric Spaces ◽  
Optimal Solution ◽  
Global Optimal Solution ◽  
Complex Valued Metric Space ◽  
Fixed Point Equation ◽  
Point Equation ◽  
Global Optimal ◽  
Metric Function ◽  
Complex Valued

We introduce the concept of proximity points for nonself-mappings between two subsets of a complex valued metric space which is a recently introduced extension of metric spaces obtained by allowing the metric function to assume values from the field of complex numbers. We apply this concept to obtain the minimum distance between two subsets of the complex valued metric spaces. We treat the problem as that of finding the global optimal solution of a fixed point equation although the exact solution does not in general exist. We also define and use the concept of P-property in such spaces. Our results are illustrated with examples.

Sign in / Sign up

Export Citation Format

Share Document