Topology Optimization of Metamaterial Microstructures for Negative Poisson’s Ratio under Large Deformation Using a Gradient-Free Method

Negative Poisson’s ratio(NPR)metamaterials are attractive for their unique mechanical behaviors and potential applications in deformation control and energy absorption.However,when subjected to significant stretching,NPR metamaterials designed under small strain assumption may experience a rapid degradation in NPR performance.To address this issue,this study aims to design metamaterials maintaining a targeted NPR under large deformation by taking advantage of the geometry nonlinearity mechanism.A representative periodic unit cell is modeled considering geometry nonlinearity,and its topology is designed using a gradient-free method.The unit cell microstructural topologies are described with the material-field series-expansion(MFSE)method.The MFSE method assumes spatial correlation of the material distribution,which greatly reduces the number of required design variables.To conveniently design metamaterials with desired NPR under large deformation,we propose a two-stage gradient-free metamaterial topology optimization method,which fully takes advantage of the dimension reduction benefits of the MFSE method and the Kriging surrogate model technique.Initially,we use homogenization to find a preliminary NPR design under a small deformation assumption.In the second stage,we begin with this preliminary design and minimize deviations in NPR from a targeted value under large deformation.Using this strategy and solution technique,we successfully obtain a group of NPR metamaterials that can sustain different desired NPRs in the range of[−0.8,−0.1]under uniaxial stretching up to 20% strain.Furthermore,typical microstructure designs are fabricated and tested through experiments.The experimental results show good consistency with our numerical results,demonstrating the effectiveness of the present gradientfree NPR metamaterial design strategy.

Adaptive Maxwell’s Equations Derived Optimization and Its Application in Antenna Array Synthesis

In this paper,a self-adaptive method for the Maxwell’s Equations Derived Optimization(MEDO)is proposed.It is implemented by applying the Sequential Model-Based Optimization(SMBO)algorithm to the iterations of the MEDO,and achieves the automatic adjustment of the parameters.The proposed method is named as adaptive Maxwell’s equations derived optimization(AMEDO).In order to evaluate the performance of AMEDO,eight benchmarks are used and the results are compared with the original MEDO method.The results show that AMEDO can greatly reduce the workload of manual adjustment of parameters,and at the same time can keep the accuracy and stability.Moreover,the convergence of the optimization can be accelerated due to the dynamical adjustment of the parameters.In the end,the proposed AMEDO is applied to the side lobe level suppression and array failure correction of a linear antenna array,and shows great potential in antenna array synthesis.

Optimizing Connections:Applied Shortest Path Algorithms for MANETs

This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.

Multidisciplinary Design Optimization of Crash Box with Negative Poisson’s Ratio Structure

To improve the crashworthiness and energy absorption performance,a novel crash box negative Poisson’s ratio(NPR)structure is proposed according to the characteristics of low speed collision of bumper system.Taking the peak collision force and the average collision force as two subsystems,a multidisciplinary collaborative optimization design is carried out,and its optimization results are compared with the ones optimized by NSGA-II algorithm.Simulation results show that the crashworthiness and energy absorption performance of the novel crash box is improved effectively based on the multidisciplinary optimization method.

Topology and Shape Optimization of 2-D and 3-D Micro-ArchitecturedThermoelastic Metamaterials Using a Parametric Level Set Method

2-D and 3-D micro-architectured multiphase thermoelastic metamaterials are designed and analyzed using a parametric level set method for topology optimization and the finite element method.An asymptotic homogenization approach is employed to obtain the effective thermoelastic properties of the multiphase metamaterials.Theε-constraint multi-objective optimization method is adopted in the formulation.The coefficient of thermal expansion(CTE)and Poisson’s ratio(PR)are chosen as two objective functions,with the CTE optimized and the PR treated as a constraint.The optimization problems are solved by using the method of moving asymptotes.Effective isotropic and anisotropic CTEs and stiffness constants are obtained for the topologically optimized metamaterials with prescribed values of PR under the constraints of specified effective bulk modulus,volume fractions and material symmetry.Two solid materials along with one additional void phase are involved in each of the 2-D and 3-D optimal design examples.The numerical results reveal that the newly proposed approach can integrate shape and topology optimizations and lead to optimal microstructures with distinct topological boundaries.The current method can topologically optimize metamaterials with a positive,negative or zero CTE and a positive,negative or zero Poisson’s ratio.

Parkinson’s Disease Detection Using Biogeography-Based Optimization

In recent years,Parkinson’s Disease(PD)as a progressive syndrome of the nervous system has become highly prevalent worldwide.In this study,a novel hybrid technique established by integrating a Multi-layer Perceptron Neural Network(MLP)with the Biogeography-based Optimization(BBO)to classify PD based on a series of biomedical voice measurements.BBO is employed to determine the optimal MLP parameters and boost prediction accuracy.The inputs comprised of 22 biomedical voice measurements.The proposed approach detects two PD statuses:0-disease status and 1-good control status.The performance of proposed methods compared with PSO,GA,ACO and ES method.The outcomes affirm that the MLP-BBO model exhibits higher precision and suitability for PD detection.The proposed diagnosis system as a type of speech algorithm detects early Parkinson’s symptoms,and consequently,it served as a promising new robust tool with excellent PD diagnosis performance.

Solid Waste Management:A MADM Approach Using Fuzzy Parameterized Possibility Single-Valued Neutrosophic Hypersoft Expert Settings

The dramatic rise in the number of people living in cities has made many environmental and social problems worse.The search for a productive method for disposing of solid waste is the most notable of these problems.Many scholars have referred to it as a fuzzy multi-attribute or multi-criteria decision-making problem using various fuzzy set-like approaches because of the inclusion of criteria and anticipated ambiguity.The goal of the current study is to use an innovative methodology to address the expected uncertainties in the problem of solid waste site selection.The characteristics(or sub-attributes)that decision-makers select and the degree of approximation they accept for various options can both be indicators of these uncertainties.To tackle these problems,a novel mathematical structure known as the fuzzy parameterized possibility single valued neutrosophic hypersoft expert set(ρˆ-set),which is initially described,is integrated with a modified version of Sanchez’s method.Following this,an intelligent algorithm is suggested.The steps of the suggested algorithm are explained with an example that explains itself.The compatibility of solid waste management sites and systems is discussed,and rankings are established along with detailed justifications for their viability.This study’s strengths lie in its application of fuzzy parameterization and possibility grading to effectively handle the uncertainties embodied in the parameters’nature and alternative approximations,respectively.It uses specific mathematical formulations to compute the fuzzy parameterized degrees and possibility grades that are missing from the prior literature.It is simpler for the decisionmakers to look at each option separately because the decision is uncertain.Comparing the computed results,it is discovered that they are consistent and dependable because of their preferred properties.

Optimization of Carburized UNS G10170 Steel Process Parameters Using Taguchi Approach and Response Surface Model (RSM)

The utilization of carburizing materials in surface engineering has undergone many tremendous changes. Effective quality control is possible through carburizing the steel components under op-timal conditions. In this research work, process parameters like furnace temperature, soaking time and particle size of energizer were taken for optimization of carburized UNS-G10170 steel to yield maximum hardness using Taguchi’s design of experiment concepts and Response Surface Model. Nine experimental runs based on Taguchi’s L9 orthogonal array were performed;signal to noise (S/N) ratios, analysis of variance (ANOVA) and regression analysis were used with hardness as response variable. From the optimization and experimental analyses conducted, it was observed that furnace temperature, soaking time and particle size had significant influence in obtaining a better surface integrity. The optimal values obtained during the study optimization by Taguchi approach and Response Surface Model (RSM) were validated by confirmation experiments.

Economic Design of & S Control Charts Based on Taguchi's Loss Function and Its Optimization

Much research effort has been devoted to economic design of X ＆ S control charts,however,there are some problems in usual methods.On the one hand,it is difficult to estimate the relationship between costs and other model parameters,so the economic design method is often not effective in producing charts that can quickly detect small shifts before substantial losses occur;on the other hand,in many cases,only one type of process shift or only one pair of process shifts are taken into consideration,which may not correctly reflect the actual process conditions.To improve the behavior of economic design of control chart,a cost ＆ loss model with Taguchi＇s loss function for the economic design of X ＆ S control charts is embellished,which is regarded as an optimization problem with multiple statistical constraints.The optimization design is also carried out based on a number of combinations of process shifts collected from the field operation of the conventional control charts,thus more hidden information about the shift combinations is mined and employed to the optimization design of control charts.At the same time,an improved particle swarm optimization（IPSO） is developed to solve such an optimization problem in design of X ＆ S control charts,IPSO is first tested for several benchmark problems from the literature and evaluated with standard performance metrics.Experimental results show that the proposed algorithm has significant advantages on obtaining the optimal design parameters of the charts.The proposed method can substantially reduce the total cost（or loss） of the control charts,and it will be a promising tool for economic design of control charts.

Automated Pipe Routing Optimization for Ship Machinery

In the shipbuilding industry,market competition is currently operating in an intense state.To be able to strive in the global market,the shipbuilders must able to produce ships that are more efficient and can be constructed in a relatively short amount of time.The piping layouts in the engine room requires a lot of time for the designer to design the best possible route and in a way are not the most efficient route.This paper presents an automatic piping support system in the ship’s engine room based on the Dijkstra’s algorithm of pathfinding method.The proposed method is focused on finding the shortest possible route with a consideration of the following things:cost of the bend pipe,cost of the crossing pipe,cost reduction by pipe support,restriction on piping,reduction of calculation time,and design procedure of piping route.Dijkstra’s shortest path algorithm is adopted to find the shortest path route between the start and goal point that is determined based on the layout of the ship’s engine room.Genetic algorithm is adopted to decide the sequence of the pipe execution.The details of the proposed method are explained in this paper.This paper also discusses the application of the proposed method on an actual ship and evaluates its effectiveness.

Improved data analysis method of single-molecule experiments based on probability optimization

To extract the dynamic parameters from single molecule manipulation experiments, usually lots of data at different forces need to be recorded. But the measuring time of a single molecule is limited due to breakage of the tether or degradation of the molecule. Here we propose a data analysis method based on probability maximizalion of the recorded time trace to extract the dynamic parameters from a single measurement. The feasibility of this method was verified by dealing with the simulation data of a two-state system. We also applied this method to estimate the parameters of DNA hairpin folding and unfolding dynamics measured by a magnetic tweezers experiment.

Modified Piyavskii’s Global One-Dimensional Optimization of a Differentiable Function

Piyavskii’s algorithm maximizes a univariate function satisfying a Lipschitz condition. We propose a modified Piyavskii’s sequential algorithm which maximizes a univariate differentiable function f by iteratively constructing an upper bounding piece-wise concave function Φ of f and evaluating f at a point where Φ reaches its maximum. We compare the numbers of iterations needed by the modified Piyavskii’s algorithm (nC) to obtain a bounding piece-wise concave function Φ whose maximum is within ε of the globally optimal value foptwith that required by the reference sequential algorithm (nref). The main result is that nC≤ 2nref + 1 and this bound is sharp. We also show that the number of iterations needed by modified Piyavskii’s algorithm to obtain a globally ε-optimal value together with a corresponding point (nB) satisfies nBnref + 1 Lower and upper bounds for nref are obtained as functions of f(x) , ε, M1 and M0 where M0 is a constant defined by M0 = supx∈[a,b] - f’’(x) and M1 ≥ M0 is an evaluation of M0.

Energy-Efficient Routing Using Novel Optimization with Tabu Techniques for Wireless Sensor Network

Wireless Sensor Network(WSN)consists of a group of limited energy source sensors that are installed in a particular region to collect data from the environment.Designing the energy-efficient data collection methods in largescale wireless sensor networks is considered to be a difficult area in the research.Sensor node clustering is a popular approach for WSN.Moreover,the sensor nodes are grouped to form clusters in a cluster-based WSN environment.The battery performance of the sensor nodes is likewise constrained.As a result,the energy efficiency of WSNs is critical.In specific,the energy usage is influenced by the loads on the sensor node as well as it ranges from the Base Station(BS).Therefore,energy efficiency and load balancing are very essential in WSN.In the proposed method,a novel Grey Wolf Improved Particle Swarm Optimization with Tabu Search Techniques(GW-IPSO-TS)was used.The selection of Cluster Heads(CHs)and routing path of every CH from the base station is enhanced by the proposed method.It provides the best routing path and increases the lifetime and energy efficiency of the network.End-to-end delay and packet loss rate have also been improved.The proposed GW-IPSO-TS method enhances the evaluation of alive nodes,dead nodes,network survival index,convergence rate,and standard deviation of sensor nodes.Compared to the existing algorithms,the proposed method outperforms better and improves the lifetime of the network.

Colliding Bodies Optimization with Machine Learning Based Parkinson’s Disease Diagnosis

Parkinson’s disease(PD)is one of the primary vital degenerative diseases that affect the Central Nervous System among elderly patients.It affect their quality of life drastically and millions of seniors are diagnosed with PD every year worldwide.Several models have been presented earlier to detect the PD using various types of measurement data like speech,gait patterns,etc.Early identification of PD is important owing to the fact that the patient can offer important details which helps in slowing down the progress of PD.The recently-emerging Deep Learning(DL)models can leverage the past data to detect and classify PD.With this motivation,the current study develops a novel Colliding Bodies Optimization Algorithm with Optimal Kernel Extreme Learning Machine(CBO-OKELM)for diagnosis and classification of PD.The goal of the proposed CBO-OKELM technique is to identify whether PD exists or not.CBO-OKELM technique involves the design of Colliding Bodies Optimization-based Feature Selection(CBO-FS)technique for optimal subset of features.In addition,Water Strider Algorithm(WSA)with Kernel Extreme Learning Machine(KELM)model is also developed for the classification of PD.CBO algorithm is used to elect the optimal set of fea-tures whereas WSA is utilized for parameter tuning of KELM model which alto-gether helps in accomplishing the maximum PD diagnostic performance.The experimental analysis was conducted for CBO-OKELM technique against four benchmark datasets and the model portrayed better performance such as 95.68%,96.34%,92.49%,and 92.36%on Speech PD,Voice PD,Hand PD Mean-der,and Hand PD Spiral datasets respectively.

Stochastic Programming for Hub Energy Management Considering Uncertainty Using Two-Point Estimate Method and Optimization Algorithm

To maximize energy profit with the participation of electricity,natural gas,and district heating networks in the day-ahead market,stochastic scheduling of energy hubs taking into account the uncertainty of photovoltaic and wind resources,has been carried out.This has been done using a new meta-heuristic algorithm,improved artificial rabbits optimization(IARO).In this study,the uncertainty of solar and wind energy sources is modeled using Hang’s two-point estimating method(TPEM).The IARO algorithm is applied to calculate the best capacity of hub energy equipment,such as solar and wind renewable energy sources,combined heat and power(CHP)systems,steamboilers,energy storage,and electric cars in the day-aheadmarket.The standard ARO algorithmis developed to mimic the foraging behavior of rabbits,and in this work,the algorithm’s effectiveness in avoiding premature convergence is improved by using the dystudynamic inertia weight technique.The proposed IARO-based scheduling framework’s performance is evaluated against that of traditional ARO,particle swarm optimization(PSO),and salp swarm algorithm(SSA).The findings show that,in comparison to previous approaches,the suggested meta-heuristic scheduling framework based on the IARO has increased energy profit in day-ahead electricity,gas,and heating markets by satisfying the operational and energy hub limitations.Additionally,the results show that TPEM approach dependability consideration decreased hub energy’s profit by 8.995%as compared to deterministic planning.

A Hybrid Particle Swarm Optimization to Forecast Implied Volatility Risk

The application of optimization methods to prediction issues is a continually exploring field.In line with this,this paper investigates the connectedness between the infected cases of COVID-19 and US fear index from a forecasting perspective.The complex characteristics of implied volatility risk index such as non-linearity structure,time-varying and nonstationarity motivate us to apply a nonlinear polynomial Hammerstein model with known structure and unknown parameters.We use the Hybrid Particle Swarm Optimization(HPSO)tool to identify the model parameters of nonlinear polynomial Hammerstein model.Findings indicate that,following a nonlinear polynomial behaviour cascaded to an autoregressive with exogenous input(ARX)behaviour,the fear index in US financial market is significantly affected by COVID-19-infected cases in the US,COVID-19-infected cases in the world and COVID-19-infected cases in China,respectively.Statistical performance indicators provided by the developed models show that COVID-19-infected cases in the US are particularly powerful in predicting the Cboe volatility index compared to COVID-19-infected cases in the world and China(MAPE(2.1013%);R2(91.78%)and RMSE(0.6363 percentage points)).The proposed approaches have also shown good convergence characteristics and accurate fits of the data.

New Variants of Newton’s Method for Nonlinear Unconstrained Optimization Problems

In this paper, we propose new variants of Newton’s method based on quadrature formula and power mean for solving nonlinear unconstrained optimization problems. It is proved that the order of convergence of the proposed family is three. Numerical comparisons are made to show the performance of the presented methods. Furthermore, numerical experiments demonstrate that the logarithmic mean Newton’s method outperform the classical Newton’s and other variants of Newton’s method. MSC: 65H05.

Numerical Optimization of Sand Casting Parameters Using the Dantzig’s Simplex Method

This study adopts the Dantzig’s Simplex method to investigate optimization of sand casting parameters for optimum service performance. Some process variables and mechanical properties were adapted into the Simplex method. Aluminium alloy samples were cast, machined and subjected to a series of mechanical tests. From the body of data collected, linear functions and constraint equations were formulated and employed in the Dantzig’s Simplex method for optimization of process parameters. The results showed that the Simplex method can be adapted for studying performance opti- mization of castings.

SAGD Optimization for Heterogeneous Reservoir

This paper demonstrates the use of a commercial simulator as a tool with which to optimize the SAGD （steam-assisted gravity drainage） start-up phase process. The factors affecting the start-up phase are the prime targets. Among the key investigated factors are wellbore geometry effects, reservoir heterogeneity and circulation phase length. Each of the parameters was investigated via steam chamber development observation along the well pair length and the cross sections in the mid, toe and heel areas. In addition, the cumulative recovery in given time, steam-to-oil ratio and CDOR （calendar day oil rate） production data are used to backup the observations produced in the simulated model. Furthermore, an additional component developed during the research is a statistical modification of a layer cake model with which to create a heterogeneous reservoir to represent real reservoir conditions, based on Monte Carlo＇s simulation.

Energy-Efficient Clustering Using Optimization with Locust Game Theory

Wireless sensor networks(WSNs)are made up of several sensors located in a specific area and powered by a finite amount of energy to gather environmental data.WSNs use sensor nodes(SNs)to collect and transmit data.However,the power supplied by the sensor network is restricted.Thus,SNs must store energy as often as to extend the lifespan of the network.In the proposed study,effective clustering and longer network lifetimes are achieved using mul-ti-swarm optimization(MSO)and game theory based on locust search(LS-II).In this research,MSO is used to improve the optimum routing,while the LS-II approach is employed to specify the number of cluster heads(CHs)and select the best ones.After the CHs are identified,the other sensor components are allo-cated to the closest CHs to them.A game theory-based energy-efficient clustering approach is applied to WSNs.Here each SN is considered a player in the game.The SN can implement beneficial methods for itself depending on the length of the idle listening time in the active phase and then determine to choose whether or not to rest.The proposed multi-swarm with energy-efficient game theory on locust search(MSGE-LS)efficiently selects CHs,minimizes energy consumption,and improves the lifetime of networks.The findings of this study indicate that the proposed MSGE-LS is an effective method because its result proves that it increases the number of clusters,average energy consumption,lifespan extension,reduction in average packet loss,and end-to-end delay.