Buckling Optimization of Curved Grid Stiffeners through the Level Set Based Density Method

Stiffened structures have great potential for improvingmechanical performance,and the study of their stability is of great interest.In this paper,the optimization of the critical buckling load factor for curved grid stiffeners is solved by using the level set based density method,where the shape and cross section(including thickness and width)of the stiffeners can be optimized simultaneously.The grid stiffeners are a combination ofmany single stiffenerswhich are projected by the corresponding level set functions.The thickness and width of each stiffener are designed to be independent variables in the projection applied to each level set function.Besides,the path of each single stiffener is described by the zero iso-contour of the level set function.All the single stiffeners are combined together by using the p-norm method to obtain the stiffener grid.The proposed method is validated by several numerical examples to optimize the critical buckling load factor.

Effective Hybrid Teaching-learning-based Optimization Algorithm for Balancing Two-sided Assembly Lines with Multiple Constraints

Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints （TALB-MC）. Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization （TLBO） algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost fimction. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search （VNS） is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm （LAHC） for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.

Phase-Based Optical Flow Method with Optimized Parameter Settings for Enhancing Displacement Measurement Adaptability

To enhance the applicability and measurement accuracy of phase-based optical flow method using complex steerable pyramids in structural displacement measurement engineering applications, an improved method of optimizing parameter settings is proposed. The optimized parameters include the best measurement points of the Region of Interest (ROI) and the levels of pyramid filters. Additionally, to address the issue of updating reference frames in practical applications due to the difficulty in estimating the maximum effective measurement value, a mechanism for dynamically updating reference frames is introduced. Experimental results demonstrate that compared to representative image gradient-based displacement measurement methods, the proposed method exhibits higher measurement accuracy in engineering applications. This provides reliable data support for structural damage identification research based on vibration signals and is expected to broaden the engineering application prospects for structural health monitoring.

Hyperparameter Tuning for Deep Neural Networks Based Optimization Algorithm

For training the present Neural Network(NN)models,the standard technique is to utilize decaying Learning Rates(LR).While the majority of these techniques commence with a large LR,they will decay multiple times over time.Decaying has been proved to enhance generalization as well as optimization.Other parameters,such as the network’s size,the number of hidden layers,drop-outs to avoid overfitting,batch size,and so on,are solely based on heuristics.This work has proposed Adaptive Teaching Learning Based(ATLB)Heuristic to identify the optimal hyperparameters for diverse networks.Here we consider three architec-tures Recurrent Neural Networks(RNN),Long Short Term Memory(LSTM),Bidirectional Long Short Term Memory(BiLSTM)of Deep Neural Networks for classification.The evaluation of the proposed ATLB is done through the various learning rate schedulers Cyclical Learning Rate(CLR),Hyperbolic Tangent Decay(HTD),and Toggle between Hyperbolic Tangent Decay and Triangular mode with Restarts(T-HTR)techniques.Experimental results have shown the performance improvement on the 20Newsgroup,Reuters Newswire and IMDB dataset.

Recognizing Ancient South Indian Language Using Opposition Based Grey Wolf Optimization

Recognizing signs and fonts of prehistoric language is a fairly difficult job that requires special tools.This stipulation make the dispensation period over-riding,difficult and tiresome to calculate.This paper present a technique for recognizing ancient south Indian languages by applying Artificial Neural Network(ANN)associated with Opposition based Grey Wolf Optimization Algorithm(OGWA).It identifies the prehistoric language,signs and fonts.It is an apparent from the ANN system that arbitrarily produced weights or neurons linking various layers play a significant role in its performance.For adaptively determining these weights,this paper applies various optimization algorithms such as Opposition based Grey Wolf Optimization,Particle Swarm Optimization and Grey Wolf Opti-mization to the ANN system.Performance results are illustrated that the proposed ANN-OGWO technique achieves superior accuracy over the other techniques.In test case 1,the accuracy value of OGWO is 94.89%and in test case 2,the accu-racy value of OGWO is 92.34%,on average,the accuracy of OGWO achieves 5.8%greater accuracy than ANN-GWO,10.1%greater accuracy than ANN-PSO and 22.1%greater accuracy over conventional ANN technique.

Geographic Drone-based Route Optimization Approach for Emergency Area Ad-Hoc Network

Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks.

Reliability Based Optimization of Composite Laminates for Frequency Constraint

The reliability based optimization （RBO） issue of composite laminates trader fundamental frequency constraint is studied. Considering the tmcertainties of material properties, the frequency constraint reliability of the structure is evaluated by the combination of response surface method （RSM） and finite element method. An optimization algorithm is developed based on the mechanism of laminate frequency characteristics, to optimize the laminate in terms of the ply amount and orientation angles. Numerical examples of composite laminates and cylindrical shell illustrate the advantages of the present optimization algorithm on the efficiency and applicability respects. The optimal solutions of RBO are obviously different from the deterministic optimization results, and the necessity of considering material property uncertainties in the composite structural frequency constraint optimization is revealed.

Optimization of RDF link traversal based query execution

Aiming at the problem that only some types of SPARQL （ simple protocal and resource description framework query language） queries can be answered by using the current resource description framework link traversal based query execution （RDF-LTE） approach, this paper discusses how the execution order of the triple pattern affects the query results and cost based on concrete SPARQL queries, and analyzes two properties of the web of linked data, missing backward links and missing contingency solution. Then three heuristic principles for logic query plan optimization, namely, the filtered basic graph pattern （FBGP） principle, the triple pattern chain principle and the seed URIs principle, are proposed. The three principles contribute to decrease the intermediate solutions and increase the types of queries that can be answered. The effectiveness and feasibility of the proposed approach is evaluated. The experimental results show that more query results can be returned with less cost, thus enabling users to develop the full potential of the web of linked data.

Bio-Inspired Intelligent Routing in WSN: Integrating Mayfly Optimization and Enhanced Ant Colony Optimization for Energy-Efficient Cluster Formation and Maintenance

Wireless Sensor Networks(WSNs)are a collection of sensor nodes distributed in space and connected through wireless communication.The sensor nodes gather and store data about the real world around them.However,the nodes that are dependent on batteries will ultimately suffer an energy loss with time,which affects the lifetime of the network.This research proposes to achieve its primary goal by reducing energy consumption and increasing the network’s lifetime and stability.The present technique employs the hybrid Mayfly Optimization Algorithm-Enhanced Ant Colony Optimization(MFOA-EACO),where the Mayfly Optimization Algorithm(MFOA)is used to select the best cluster head(CH)from a set of nodes,and the Enhanced Ant Colony Optimization(EACO)technique is used to determine an optimal route between the cluster head and base station.The performance evaluation of our suggested hybrid approach is based on many parameters,including the number of active and dead nodes,node degree,distance,and energy usage.Our objective is to integrate MFOA-EACO to enhance energy efficiency and extend the network life of the WSN in the future.The proposed method outcomes proved to be better than traditional approaches such as Hybrid Squirrel-Flying Fox Optimization Algorithm(HSFLBOA),Hybrid Social Reindeer Optimization and Differential Evolution-Firefly Algorithm(HSRODE-FFA),Social Spider Distance Sensitive-Iterative Antlion Butterfly Cockroach Algorithm(SADSS-IABCA),and Energy Efficient Clustering Hierarchy Strategy-Improved Social Spider Algorithm Differential Evolution(EECHS-ISSADE).

Muti-Fusion Swarm Intelligence Optimization Algorithm in Base Station Coverage Optimization Problems

As millimeter waves will be widely used in the Internet of Things(IoT)and Telematics to provide high bandwidth communication and mass connectivity,the coverage optimization of base stations can effectively improve the quality of communication services.How to optimize the convergence speed of the base station coverage solution is crucial for IoT service providers.This paper proposes the Muti-Fusion Sparrow Search Algorithm(MFSSA)optimize the situation to address the problem of discrete coverage maximization and rapid convergence.Firstly,the initial swarm diversity is enriched using a sine chaotic map,and dynamic adaptive weighting is added to the discoverer location update strategy to improve the global search capability.Diverse swarms have a more remarkable ability to forage for food and avoid predation and are less likely to fall into a“precocious”state.Such a swarm is very suitable for solving NP-hard problems.Secondly,an elite opposition-based learning strategy is added to expand the search range of the algorithm,and a t-distribution-based one-fifth rule is introduced to reduce the probability of falling into a local optimum.This fusion mutation strategy can significantly optimize the adaptability and searchability of the algorithm.Finally,the experimental results show that the MFSSA algorithm can effectively improve the coverage of the deployment scheme in the base station coverage optimization problem,and the convergence speed is better than other algorithms.MFSSA is improved by more than 10%compared to the original algorithm.

A Cautionary Note on the Application of GIS in Spatial Optimization Modeling

Spatial optimization as part of spatial modeling has been facilitated significantly by integration with GIS techniques. However, for certain research topics, applying standard GIS techniques may create problems which require attention. This paper serves as a cautionary note to demonstrate two problems associated with applying GIS in spatial optimization, using a capacitated p-median facility location optimization problem as an example. The first problem involves errors in interpolating spatial variations of travel costs from using kriging, a common set of techniques for raster files. The second problem is inaccuracy in routing performed on a graph directly created from polyline shapefiles, a common vector file type. While revealing these problems, the paper also suggests remedies. Specifically, interpolation errors can be eliminated by using agent-based spatial modeling while the inaccuracy in routing can be improved through altering the graph topology by splitting the long edges of the shapefile. These issues suggest the need for caution in applying GIS in spatial optimization study.

A New Multiobjective Particle Swarm Optimization Using Local Displacement and Local Guides

This paper introduces a novel variant of particle swarm optimization that leverages local displacements through attractors for addressing multiobjective optimization problems. The method incorporates a square root distance mechanism into the external archives to enhance the diversity. We evaluate the performance of the proposed approach on a set of constrained and unconstrained multiobjective test functions, establishing a benchmark for comparison. In order to gauge its effectiveness relative to established techniques, we conduct a comprehensive comparison with well-known approaches such as SMPSO, NSGA2 and SPEA2. The numerical results demonstrate that our method not only achieves efficiency but also exhibits competitiveness when compared to evolutionary algorithms. Particularly noteworthy is its superior performance in terms of convergence and diversification, surpassing the capabilities of its predecessors.

Optimization of the Dressing Parameters in Cylindrical Grinding Based on a Generalized Utility Function

The existing studies, concerning the dressing process, focus on the major influence of the dressing conditions on the grinding response variables. However, the choice of the dressing conditions is often made, based on the experience of the qualified staff or using data from reference books. The optimal dressing parameters, which are only valid for the particular methods and dressing and grinding conditions, are also used. The paper presents a methodology for optimization of the dressing parameters in cylindrical grinding. The generalized utility function has been chosen as an optimization parameter. It is a complex indicator determining the economic, dynamic and manufacturing characteristics of the grinding process. The developed methodology is implemented for the dressing of aluminium oxide grinding wheels by using experimental diamond roller dressers with different grit sizes made of medium- and high-strength synthetic diamonds type AC32 and AC80. To solve the optimization problem, a model of the generalized utility function is created which reflects the complex impact of dressing parameters. The model is built based on the results from the conducted complex study and modeling of the grinding wheel lifetime, cutting ability, production rate and cutting forces during grinding. They are closely related to the dressing conditions （dressing speed ratio, radial in-feed of the diamond roller dresser and dress-out time）, the diamond roller dresser grit size/grinding wheel grit size ratio, the type of synthetic diamonds and the direction of dressing. Some dressing parameters are determined for which the generalized utility fimction has a maximum and which guarantee an optimum combination of the following： the lifetime and cutting ability of the abrasive wheels, the tangential cutting force magnitude and the production rate of the grinding process. The results obtained prove the possibility of control and optimization of grinding by selecting particular dressing parameters.

Reliable Space Pursuing for Reliability-based Design Optimization with Black-box Performance Functions

Reliability-based design optimization （RBDO） is intrinsically a double-loop procedure since it involves an overall optimization and an iterative reliability assessment at each search point. Due to the double-loop procedure, the computational expense of RBDO is normally very high. Current RBDO research focuses on problems with explicitly expressed performance functions and readily available gradients. This paper addresses a more challenging type of RBDO problem in which the performance functions are computation intensive. These computation intensive functions are often considered as a ＂black-box＂ and their gradients are not available or not reliable. On the basis of the reliable design space （RDS） concept proposed earlier by the authors, this paper proposes a Reliable Space Pursuing （RSP） approach, in which RDS is first identified and then gradually refined while optimization is performed. It fundamentally avoids the nested optimization and probabilistic assessment loop. Three well known RBDO problems from the literature are used for testing and demonstrating the effectiveness of the proposed RSP method.

Reliability Based Design Optimization of Aero-Engine Spindle Ball Bearings

Aero-engine spindle ball bearings work in harsh conditions which are affected by relatively complex stresses. One of the key factors which affects bearing performance is its structure. In this paper,we used reliability based design optimization method to solve the structure design problem of aero-engine spindle ball bearings.Compared with the optimization design method, the value of equivalent dynamic load using reliability optimization design method was the least by MATLAB simulation. Also the design solutions show that the optimized structure possesses higher reliability than the original solution.

Optimizing Feedforward Neural Networks Using Biogeography Based Optimization for E-Mail Spam Identification

Spam e-mail has a significant negative impact on individuals and organizations, and is considered as a serious waste of resources, time and efforts. Spam detection is a complex and challenging task to solve. In literature, researchers and practitioners proposed numerous approaches for automatic e-mail spam detection. Learning-based filtering is one of the important approaches used for spam detection where a filter needs to be trained to extract the knowledge that can be used to detect the spam. In this context, Artificial Neural Networks is a widely used machine learning based filter. In this paper, we propose the use of a common type of Feedforward Neural Network called Multi-Layer Perceptron (MLP) for the purpose of e-mail spam identification, where the weights of this network model are found using a new nature-inspired metaheuristic algorithm called Biogeography Based Optimization (BBO). Experiments and results based on two different spam datasets show that the developed MLP model trained by BBO gets high generalization performance compared to other optimization methods used in the literature for e-mail spam detection.

Metamodel-based Global Optimization Using Fuzzy Clustering for Design Space Reduction

High fidelity analysis are utilized in modern engineering design optimization problems which involve expensive black-box models.For computation-intensive engineering design problems,efficient global optimization methods must be developed to relieve the computational burden.A new metamodel-based global optimization method using fuzzy clustering for design space reduction(MGO-FCR) is presented.The uniformly distributed initial sample points are generated by Latin hypercube design to construct the radial basis function metamodel,whose accuracy is improved with increasing number of sample points gradually.Fuzzy c-mean method and Gath-Geva clustering method are applied to divide the design space into several small interesting cluster spaces for low and high dimensional problems respectively.Modeling efficiency and accuracy are directly related to the design space,so unconcerned spaces are eliminated by the proposed reduction principle and two pseudo reduction algorithms.The reduction principle is developed to determine whether the current design space should be reduced and which space is eliminated.The first pseudo reduction algorithm improves the speed of clustering,while the second pseudo reduction algorithm ensures the design space to be reduced.Through several numerical benchmark functions,comparative studies with adaptive response surface method,approximated unimodal region elimination method and mode-pursuing sampling are carried out.The optimization results reveal that this method captures the real global optimum for all the numerical benchmark functions.And the number of function evaluations show that the efficiency of this method is favorable especially for high dimensional problems.Based on this global design optimization method,a design optimization of a lifting surface in high speed flow is carried out and this method saves about 10 h compared with genetic algorithms.This method possesses favorable performance on efficiency,robustness and capability of global convergence and gives a new optimization strategy for engineering design optimization problems involving expensive black box models.

Finding Symbolic and All Numerical Solutions for Design Optimization Based on Monotonicity Analysis and Solving Polynomial Systems

A method for determining symbolic and all numerical solutions in design optimization based on monotonicity analysis and solving polynomial systems is presented in this paper. Groebner Bases of the algebraic system equivalent to the subproblem of the design optimization is taken as the symbolic (analytical) expression of the optimum solution for the symbolic optimization, i.e. the problem with symbolic coefficients. A method based on substituting and eliminating for determining Groebner Bases is also proposed, and method for finding all numerical optimum solutions is discussed. Finally an example is given, demonstrating the strategy and efficiency of the method.

Sequential RBF Surrogate-based Efficient Optimization Method for Engineering Design Problems with Expensive Black-Box Functions

As a promising technique, surrogate-based design and optimization（SBDO） has been widely used in modern engineering design optimizations. Currently, static surrogate-based optimization methods have been successfully applied to expensive optimization problems. However, due to the low efficiency and poor flexibility, static surrogate-based optimization methods are difficult to efficiently solve practical engineering cases. At the aim of enhancing efficiency, a novel surrogate-based efficient optimization method is developed by using sequential radial basis function（SEO-SRBF）. Moreover, augmented Lagrangian multiplier method is adopted to solve the problems involving expensive constraints. In order to study the performance of SEO-SRBF, several numerical benchmark functions and engineering problems are solved by SEO-SRBF and other well-known surrogate-based optimization methods including EGO, MPS, and IARSM. The optimal solutions, number of function evaluations, and algorithm execution time are recorded for comparison. The comparison results demonstrate that SEO-SRBF shows satisfactory performance in both optimization efficiency and global convergence capability. The CPU time required for running SEO-SRBF is dramatically less than that of other algorithms. In the torque arm optimization case using FEA simulation, SEO-SRBF further reduces 21% of thematerial volume compared with the solution from static-RBF subject to the stress constraint. This study provides the efficient strategy to solve expensive constrained optimization problems.