CAD-CAE software companies have introduced numerous tools aimed at facilitating topology optimization through Finite Element Simulation, thereby enhancing accessibility for designers via user-friendly interfaces. However, the imposition of intricate constraint conditions or additional restrictions during calculations may introduce instability into the resultant outcomes. In this paper, an algorithm for updating the design variables called Adaptive Variable Design is proposed to keep the final design space volume of the optimized part always under the target value while giving the main algorithm multiple chances to update the optimization parameters and search for a valid design. This algorithm aims to producing results that are more conducive to manufacturability and potentially more straightforward in interpretation. A comparison between several commercial software and the proposed algorithm, implemented in MATLAB, is carried out to prove the robustness of the latter. By simulating identical parts under similar conditions, we seek to generate comparable results and underscore the advantages stemming from the adoption and comprehension of the proposed topology optimization methodology. Our findings reveal that the integrated enhancements within MATLAB pertaining to the topology optimization process yield favourable outcomes with respect to discretization, and the manufacturability of resultant geometries. Furthermore, we assert that the methodology evaluated within MATLAB holds promise for potential integration into commercial packages, thereby enhancing the efficiency of topology optimization processes.

Advancements in Parametric Design, Generative Design, and automation in Building Information Modelling (BIM) have opened new opportunities for architects and engineers working on complex buildings, such as offices. These developments allow designers to enhance their designs, increase project efficiency, improve performance, and reduce project time and costs. To address conflicting objectives that arise during the design process, genetic algorithms with multi-objective optimization (MOO) have been employed in architectural design. The GENIUS project aims to optimize building shape, apertures, and shading systems in the concept and design stages, with a focus on energy and daylight performance. The project integrates BIM and visual programming tools with Artificial Intelligence techniques like Genetic Algorithms and RBFOpt model-based optimization. Optimization algorithms are used to identify the best solutions that meet all design objectives, helping architects optimize their designs and achieve desired outcomes. The workflow was tested on a case study of a large office building, with MOO focused on maximizing daylight performance using Spatial Daylight Autonomy metric and minimizing energy consumption using Energy Use Intensity metric. The project provides architects with a method to improve their designs using Algorithm Aided Design tools, which help identify the best solutions for complex design problems.

The pursuit of more efficient transport has led engineers to develop a wide variety of 1 aircraft configurations with the aim of reducing fuel consumption and emissions. However, these 2 innovative designs introduce significant aeroelastic couplings that can potentially lead to structural 3 failure. Consequently, aeroelastic analysis and optimization has become an integral part of modern 4 aircraft design. In addition, aeroelastic testing of scale models is a critical phase in aircraft devel- 5 opment, requiring accurate prediction of aeroelastic behaviour during scale model construction to 6 reduce costs and mitigate risks associated with full-scale flight testing. Achieving a high degree of 7 similarity between the stiffness, mass distribution and flow field characteristics of scaled models 8 and their full-scale counterparts is of paramount importance. However, achieving similarity is 9 not always straightforward due to the variety of configurations of modern lightweight aircraft, as 10 identical geometry cannot always be directly scaled down. This configuration diversity has a direct 11 impact on the aeroelastic response, necessitating the use of computational aeroelasticity tools and 12 optimization algorithms. This paper presents the development of an aeroelastic scaling framework 13 using multidisciplinary optimization. Specifically, a parametric Finite Element Model (FEM) of the 14 wing is created, incorporating parameterisation of both thickness and geometry, primarily using 15 shell elements. Aerodynamic loads are calculated using the Doublet Lattice Method (DLM) em- 16 ploying twist and camber correction factors, and aeroelastic coupling is established using infinite 17 plate splines. The aeroelastic model is then integrated within an Ant Colony optimization (ACO) 18 algorithm to achieve static and dynamic similarity between the scaled model and the reference wing. 19 A notable contribution of this work is the incorporation of internal geometry parameterisation into 20 the framework, increasing its versatility and effectiveness.

As the COVID-19 pandemic has caused enormous damage to society, economy and public health security, it is crucial to combat the epidemic and allocate social and health resources effectively. Global optimization algorithms are extensively used in many domains to find optimal solutions to complex problems. Thus, a survey of three typical global optimizations applied on the COVID-19 pandemic is timely. This article is structured into three typical global optimization algorithms - Genetic Algorithm, Particle Swarm Optimization, and Cat Swarm Optimization - and summarizes the framework models and practical applications, as well as other optimization methods that may be applied to COVID-19. Finally, current unresolved challenges and future research opportunities to be explored are summarized.

Calculating a minimum-time trajectory requires the solving of a boundary value problem resulting from invocation of necessary conditions of optimality to set up a set of ordinary differential equations to solve the trajectory between the initial position and desired ending position with set constraints on the path between the two. This manuscript expresses the minimum time optimum trajectory between a satellite in a geosynchronous orbit and a target set on earth’s surface utilizing a non-rotating earth centric coordinate system. Expressing motion in coordinates of rotating reference frames necessitates transformation between reference frames, and one such transformation is embodied in the Direction Cosine Matrices (DCM) formed by a sequence of three successive frame rotations. Rotation about the local wing of an aerospace vehicle is almost never the pitch angle, yet modern application of kinematics often assumes such (with accompanying angular error). The same assertion is usually true about the nature of roll and yaw angles. This manuscript evaluates which sequence is the most advantageous for an object starting in space and then travels through the atmosphere to a target on the Earth’s surface. Simulation precision (validated by the quaternion normalization condition) reveals the so-called 132 rotation is the most accurate with an average error of 0.14° and a computational time of 0.013 seconds: resulting in a 97.95% increase in accuracy over the ubiquitous 321 “aerospace” rotation sequence and a 99.84% increase over the so-called 313 “orbital” rotation sequence. Utilizing the proposed optimal trajectory candidate yields a total flight time of 2 hours, 34 minutes and 46 seconds, or an average velocity of 3.85 kilometers per second, while impacting the target with a velocity of 11.54 kilometers per second.

Multi-objective optimization (MOO) is an optimization involving minimization or maximization of several objective functions more than the conventional one objective optimization, which is useful in many fields. Many of the current methodologies addresses challenges and solutions that attempt to solve simultaneously several Objectives with multiple constraints subjoined to each. Often MOO are generally subjected to linear inequality, equality and or bounded constraint that prevent all objectives from being optimized at once. This paper reviews some recent articles in area of MOO and presents deep analysis of Random and Uniform Entry-Exit time of objectives. It further break down process into sub-process and then provide some new concepts for solving problems in MOO, which comes due to periodical objectives that do not stay for the entire duration of process lifetime, unlike permanent objectives which are optimized once for the entire process duration. A methodology based on partial optimization that optimizes each objective iteratively and weight convergence method that optimizes sub-group of objectives are given. Furthermore, another method is introduced which involve objective classification, ranking, estimation and prediction where objectives are classified based on their properties, and ranked using a given criteria and in addition estimated for an optimal weight point (pareto optimal point) if it certifies a coveted optimal weight point. Then finally predicted to find how far it deviates from the estimated optimal weight point. A Sample Mathematical Tri-Objectives and Real world Optimization was analyzed using partial method, ranking and classification method, the result showed that an objective can be added or removed without affecting previous or existing optimal solutions. Therefore suitable for handling time governed MOO. Although this paper presents concepts work only, it’s practical application are beyond the scope of this paper, however base on analysis and examples presented, the concept is worthy of igniting further research and application.

A Robust Optimization framework with original concepts and fundamentals also admitting a fusion of ideals from relative regret models and static robust optimization, containing conservatism concepts is disclosed. The algorithm uses a fine-tune strategy to tune the model so the robustness and a target ideality can be mutually achieved with a specified risk. The framework comprises original concepts, a mathematical approach and an algorithm. The statistical treatment of the data with the original concepts from the framework make it able to make short, middle or long-term decision-making setting. The framework has high tractability since the algorithm forces the creation of a setting that makes a robust optimization with the specified risk. The framework can be applied in linear and nonlinear mathematical models since that the objective function is monotonic in the domain of the active convex region. Several examples are solved to best understand the framework and all results demonstrated high tractability and performance. There is a wide range of applications. Along all the text, there is a profound discussion about its philosophy, objective, original concepts, fields of application, statistical and probabilistic fundamentals.

In this work, we propose a variation of the cellular particle swarm optimization algorithm with differential evolution hybridization (CPSO-DE), to include constrained optimization in it, named Ts-CPD. It is implemented as a kernel of electronic design automation (EDA) tool capable of sizing circuit components considering a single-objective design with restrictions and constraints. The aim is to improve the optimization solutions in the sizing of analog circuits. To evaluate our proposal’s performance, we present the design of three analog circuits: a deferential amplifier, a two-stage operational amplifier, and a folded cascode operational transconductance amplifier. Numerical simulation results indicate that Ts-CPD can find better solutions, in terms of the design objective and the accomplishment of constraints, than those reported in previous works.

When using meta-heuristic optimization approaches for optimization, a large number of samples are required. In particular, when generating subgeneration, the utilization of existing samples is low and the number of individuals is high. Therefore, surrogate-based optimization has been developed, which greatly reduces the number of individuals in the subgeneration and the cost of optimization. In complex air supply scenarios, single-objective optimization results may not be comprehensive; therefore, this paper developed a double-objective air supply optimization method based on the Kriging surrogate model and Non-dominated Sorting Genetic Algorithms-II. And proposed the infill criteria based on clustering to advance the Pareto Frontier. The method was validated by an inverse prediction case, and in particular, the problems when based on 3D steady-state simulations were analyzed. The results showed that the method can quickly achieve an approximate prediction of the boundary conditions (when prediction were made based on experimental data, the number of simulations was 82 and the average error was 6.8%). Finally, the method was used to optimize the air supply parameters of a dual-aisle, single-row cabin. The Pareto set suggested that an airflow organization with dual circulation may be optimal.

Camera malfunctions or loss of storage elements in imaging devices may lead to loss of important image information or random impulse noise interference. Low rank is one of the important prior information in image optimization processing. This paper uses different low-rank constraint models of the image matrices to recover the impulse interference satellite images. Firstly, an overview of image inpainting models based on nuclear norm, truncated nuclear norm, weighted nuclear norm, and matrix-factorization-based F-norm is presented, and corresponding optimiza-tion iterative algorithms are provided. Then, we conducted experiments under three types of pulse interference and provided visual and numerical results. Finally, it is concluded that the WSVT_ADMM method based on the weighted nuclear norm can obtain the best image inpainting results; The UV_ADMM method based on F norm of matrix factorization has the least computa-tion time and can be used for large-scale low-rank matrix computation; The WSVT_ADMM method based on weighted nuclear norm and the TSVT_ ADMM method based on truncated nuclear norms can significantly improve the repair effect compared to the nuclear norm-based methods such as SVT, SVP, and n_ADMM.

Portfolio optimization is a mathematical formulation whose objective is to maximize returns while minimizing risks. A lot of improvement in the model has been made, including adding practical constraints. With the growing of shares trading, the problem becomes dimensionally very large. In this paper, we propose the usage of modified Biogeography-Based Optimization to solve the large scale constrained portfolio optimization. Results indicate the effectiveness of the method used.

Global optimization is an imperative development of local optimization because there are many problems in artificial intelligence and machine learning requires highly acute solutions over entire domain. There are many methods to resolve the global optimization, which can be classified into three groups such as analytic methods (purely mathematical methods), probabilistic methods, and heuristic methods. Especially, heuristic methods like particle swarm optimization and ant bee colony attract researchers because their effective and practical techniques which are easy to be implemented by computer programming languages. However, these heuristic methods are lacking in theoretical mathematical fundamental. Fortunately, minima distribution establishes a strict mathematical relationship between optimized target function and its global minima. In this research, I try to study minima distribution and apply it into explaining convergence and convergence speed of optimization algorithms. Especially, weak conditions of convergence and monotonicity within minima distribution are drawn so as to be appropriate to practical optimization methods.

Particle swarm optimization (PSO) is an effective algorithm to solve the optimization problem in case that derivative of target function is inexistent or difficult to be determined. Because PSO has many parameters and variants, I propose a general framework of PSO called GPSO which aggregates important parameters and generalizes important variants so that researchers can customize PSO easily. Moreover, two main properties of PSO are exploration and exploitation. The exploration property aims to avoid premature converging so as to reach global optimal solution whereas the exploitation property aims to motivate PSO to converge as fast as possible. These two aspects are equally important. Therefore, GPSO also aims to balance the exploration and the exploitation. It is expected that GPSO supports users to tune parameters for not only solving premature problem but also fast convergence.

Increasing demand for food production with limited available water resources pose the threat to agricultural activities. The conjunctive allocation of water resources maximizes the net benefit of farmers efficiently. In this study, a novel hybrid optimization model was developed based on a genetic algorithm (GA), bacterial foraging optimization (BFO) and ant colony optimization (ACO) to maximize the net benefit of water deficit Sathanur reservoir command. The GA-based opti-mization model considered crop-related physical and economical parameters to derive optimal cropping patterns for three different conjunctive use policies and further allocation of surface and groundwater for different crops are enhanced with the BFO. The allocation of surface and groundwater for the head, middle and tail reach obtained from BFO is considered as input to ACO as a guiding mechanism to attain an optimal cropping pattern. Comparing the average produc-tivity values Policy 3 (3.665 Rs/m3) has better values relating to Policy 1 (3.662 Rs/m3) and Policy 2 (3.440 Rs/m3). Thus, the developed novel hybrid optimization model (GA-BFO-ACO) is very promising to enhance the farmer's net income as well as for the command area water conservation and can be replicated in other irrigated regions of the globe to overcome chronic land and water problems.

Within the phenomenology of particle physics, the theoretical model of 4-zero textures is validated using a chi-square criterion that compares experimental data with the computational results of the model. Traditionally, analytical methods that often imply simplifications, combined with computational analysis, have been used to validate texture models. In this paper, we propose a new meta-heuristic variant of the differential evolution algorithm that incorporates aspects of the particle swarm optimization algorithm called "HE-DEPSO" to obtain chi-squared values are less than a bound value, which exhaustive and traditional algorithms cannot obtain. The results show that the proposed algorithm can optimize the chi-square function according to the required criteria. We compare simulated data with experimental data in the allowed search region, thereby validating the 4-zero texture model.

This article introduces a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization (FLO), which emulates the hunting behavior of frilled lizards in their natural habitat. FLO draws in-spiration from the sit-and-wait strategy observed in frilled lizards during hunting. The underlying theory of FLO is presented and mathematically formulated in two phases: (i) an exploration phase, simulating the frilled lizard's attack towards prey, and (ii) an exploitation phase, simulating the lizard's retreat to the top of the tree after feeding. To assess FLO's efficacy in solving optimization problems, the algorithm's performance is evaluated across fifty-two standard benchmark functions, encompassing unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. Comparative analyses with twelve existing metaheuristic algorithms are conducted. The simulation results reveal that FLO, distinguished by its adeptness in exploration, exploitation, and balancing them during search process, outperforms competing algorithms. Additionally, FLO is implemented on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems, demonstrating its effectiveness in addressing real-world optimization applications.

Wind energy is becoming increasingly important as a renewable energy source due to its environmental and economic benefits. Wind turbines are key components in wind energy systems, and their performance is critical for efficient power generation. Wind turbine blades are the most critical components as they interact with the wind, and their design has a significant impact on the overall system performance. Therefore, it is essential to optimize the design of wind turbine blades to enhance their efficiency and reduce their costs. This paper presents an aero-structural optimization approach for wind turbine blade design. The optimization aims to maximize the torque generated by the blade while minimizing its mass. The optimization is implemented using DAFoam software for CFD simulation, TACS for FEM simulation, and Mphys under the OpenMDAO framework for fluid-structure interaction between the CFD and FEM. The optimization results show a 6.78% increase in torque and a 4.22% decrease in mass, which demonstrates the effectiveness of the proposed approach. Aerodynamic optimization focuses on maximizing the blade's torque by modifying the blade's shape. The optimization results show that the optimized blade generates more torque than the original blade design. Additionally, structural optimization aims to minimize the blade's mass while maintaining its structural integrity. This is achieved by adjusting the thickness of the blade's cross-section. The proposed aero-structural optimization approach presents an effective solution for the design optimization of wind turbine blades. The approach considers the interaction between the aerodynamic and structural aspects of the blade and optimizes them simultaneously. This leads to an optimized design that is efficient and cost-effective, which is crucial for the widespread adoption of wind energy systems. The results of this study highlight the importance of considering the interaction between the aerodynamic and structural aspects of wind turbine blades and the effectiveness of the proposed optimization approach in enhancing their performance.

Recent research has enabled the integration of traditional Volt-VAr Control (VVC) resources, such as capacitors banks and transformer tap changers, with Distributed Energy Resources (DERs), such as photo-voltaic sources and energy storage, in order to achieve various Volt-VAr Optimization (VVO) targets, such as Conservation Voltage Reduction (CVR), minimizing VAr flow at the transformer, minimizing grid losses, minimizing asset operations and more. When more than one target function can be optimized, the question of multi-objective optimization is raised. In this work, we propose a general formulation of the multi-objective Volt-VAr optimization problem. We consider the applicability of various multi-optimization techniques and discuss the operational interpretation of these solutions. We demonstrate the methods using simulation on a test feeder.

This study provides a methodology for optimizing oil production and CO2 sequestration using an integrated asset model of the Farnsworth Unit field, incorporating extensive geological, geophysical, and engineering data. Sensitivity analysis identified critical parameters impacting oil recovery and CO2 storage, leading to the construction of a proxy model using polynomial regression and radial basis function neural networks, with the latter proving more effective for "What-if" analysis. The sensitivity analysis indicated that the Corey parameters impact cumulative oil produced the most. Comprehensive history matching validated the model against historical production data, ensuring reliability for forecasting and optimization. Two scenarios, "Do-Nothing" and development strategy, were forecasted over 15 years (2020-2035). The "Do-Nothing" scenario resulted in 9.57 MMSTB of oil recovery and 2,822.70 MMlbs of CO2 storage. The development strategy case improved outcomes with 13.95 MMSTB of oil recovery and 5,061.68 MMlbs of CO2 stored, and was selected for optimization using particle swarm optimization. The optimized strategy achieved 14,043,372 STB of cumulative oil and 4,832.18 MMlbs of CO2 stored, and increased the field NPV by 25.84% to $114,871,730. This study underscores the significance of integrated asset modeling in enhancing oil recovery and optimizing CO2-EOR processes, providing valuable insights into operational conditions and constraints.

This article investigates robust optimality and duality for a class of nonsmooth multiobjective programming problems with vanishing constraints under data uncertainty (in short, UNMPVC) via convexificators. Using the properties of convexificators, we introduce generalized standard Abadie constraint qualification (in short, GS-ACQ) for the considered problem UNMPVC. Moreover, we introduce generalized robust version of nonsmooth stationary conditions, namely, weakly stationary point (in short, RW-Stationary), T-stationary point (in short, RT-Stationary), M-stationary point (in short, RM-Stationary) and S-stationary point (in short, RS-Stationary) for UNMPVC. By employing GS-ACQ, we establish that the RS-Stationary is the necessary first-order optimality condition for a local Pareto solution of UNMPVC. Moreover, under generalized convexity assumptions, we establish sufficient optimality criteria for UNMPVC. Furthermore, we formulate the Wolfe-type (in short, WRD) and Mond-Weir-type (in short, MWRD) robust dual models corresponding to the primal problem UNMPVC.

Modern power system integrates more and more new energy and use a large number of power electronic equipment. This makes it face more challenges in online optimization and real-time control. Deep reinforcement learning(DRL) has the ability of processing big data and high-dimensional features, as well as the ability of independently learning and optimizing decision-making in complex environments. In this paper, we explore DRL based online combination optimization method of grid section for large complex power system. In our method, to improve the convergence speed of the model, we propose to discretize the output action of the unit and simplify the action space. We also design a reinforcement learning loss function with strong constraints to further improve the convergence speed of the model and facilitate the algorithm to obtain the stable solution. Moreover, to avoid the local optimal solution problem caused by the discretization of the output action, we propose to use the annealing optimization algorithm to make the granularity of the unit output finer. We verify our method on IEEE 118-bus system. The experimental results show that our model has fast convergence speed and better performance, and can obtain stable solutions.

We consider the problem of scheduling tasks on a single machine subject to an uncertain breakdown to minimize the flowtime. Assume the machine is unavailable during the breakdown; the starting time of the breakdown is a random variable s with distribution function D(s) and the terminating time of the breakdown has no any other information; jobs are non-resumable. Under the assumptions, starting from the perspective of statistical optimization, we first define the expected competitive ratio of an algorithm to find the optimized solution with the considered problem. Further, we propose and prove a certain result on the expected competitive ratio of the SPT rule. In particular, we show that under a quite loose condition the expected competitive ratio of the SPT rule is no more than 5/4. Meanwhile, we also make some discussions about our studies. What we have done will rich and improve the studying results on the area of scheduling to minimize flowtime and advance the development of online optimization and statistical optimization.

In-situ production of PC components is the same process as in a factory, with the order of installing processed rebar, pouring concrete, curing, and storage. In-situ production not only reduces environmental impact by more than 14.58% compared to factory production, but also reduces costs by up to 39.4% compared to factory production when increasing the number of in-situ produced PC components. The stock yard area is more than 5 times larger than the production area, which accounts for a significantly higher proportion. Research on in-situ production of PC components is mainly focused on the production area. PC component yard layout planning for in-situ production can effectively reduce carbon dioxide emissions and improve construction efficiency. Therefore, the purpose of this study is to develop an environmental impact minimization model for in-situ production of PC components. As a result of applying the developed model, the improved dung beetle optimization algorithm optimization improved the adjacent correlation by 22.79% and reduced carbon dioxide emissions by 18.33% compared to the dung beetle optimization algorithm, which verifies its efficiency. The proposed environmental impact minimization model can support the construction, reconstruction, and functional upgrade of logistics centers, contributing to low carbon dioxide in the logistics industry.

Malicious apps specifically aimed at the Android platform have increased in tandem with the proliferation of mobile devices. Malware is now so carefully written that it is difficult to detect. Due to the exponential growth in malware, manual methods of malware are increasingly ineffec-tive. Although prior writers have proposed numerous high-quality approaches, static and dy-namic assessments inherently necessitate intricate procedures. The obfuscation methods used by modern malware are incredibly complex and clever. As a result, it cannot be detected using only static malware analysis. As a result, this work presents a hybrid analysis approach, partially tai-lored for multiple-feature data, for identifying Android malware and classifying malware families to improve Android malware detection and classification. This paper offers a hybrid method that combines static and dynamic malware analysis to give a full view of the threat. Three distinct phases make up the framework proposed in this research. Normalization and feature extraction procedures are used in the first phase of pre-processing. Both static and dynamic features undergo feature selection in the second phase. Two feature selection strategies are proposed to choose the best subset of features to use for both static and dynamic features. The third phase involves ap-plying a newly proposed detection model to classify android apps; this model uses a neural net-work optimized with an improved version of HHO. Application of binary and multi-class classi-fication is used, with binary classification for benign and malware apps and multi-class classifica-tion for detecting malware categories and families. By utilizing the features gleaned from static and dynamic malware analysis, several machine-learning methods are used for malware classifi-cation. According to the results of the experiments, the hybrid approach improves the accuracy of detection and classification of Android malware compared to the scenario when considering static and dynamic information separately.

Photovoltaic systems and wind energy systems are generally used in distributed system. However, zero-sequence and harmonic currents occur due to photovoltaic systems, and positive-sequence harmonic currents occur due to wind turbines. Thus, the sheath current in high voltage cables increases due to these currents and poor power quality in distributed generation plants. Metal parts of the cable are grounded to prevent the negative effects of sheath currents. When long high voltage cable lines are grounded with the method in the literature, high sheath current and voltage occur on the cable sheath. Therefore, the SSBLR method is designed as a new method for the distributed generation system. The SSBLR method has been optimized with prediction methods and multi-objective optimization methods to prevent negative effects of the sheath current. Pareto optimal method is used as multi-objective optimization method, and artificial neural network, hybrid artificial neural network and regression methods are used as prediction method. The most dominant result is searched using different estimation and optimization methods in pareto optimal method. When the artificial neural network-genetic algorithm hybrid method is used as a prediction method, and genetic algorithm used as optimization method, significant decreases are observed in sheath current and voltage.

The current study aims to develop a methodology for obtaining topology-optimal structures made of short fiber-reinforced polymers, which include the fluid-structure interaction. Accounting for the molding process during the internal iterations of topology optimization makes it possible to enhance the weight efficiency of structures—a crucial aspect, especially in aerospace. Anisotropy is considered through the fiber orientation tensor, which is modeled by solving the plastic molding equations for non-Newtonian fluids, and then introduced as a variable of the stiffness matrix during the structural analysis. The materials used were non-linearly modeled using an exponential-and-linear hardening law. The evaluation of weight efficiency in structures composed of short-reinforced composite materials using a dimensionless criterion is addressed. Experimental verification was performed to confirm the validity of the developed methodology. The evidence illustrates that considering anisotropy leads to stiffer structures and structural elements should be oriented in the direction of maximal stiffness. The load-carrying factor can be expressed in terms of failure criteria. The presented multidisciplinary methodology can be used to improve the quality of the design of structures made of short fiber-reinforced composites (SFRC) where high stiffness, high strength, and minimum mass are the primary required structural characteristics.

The main goal of this paper is to show that Bayesian optimization could be regarded as a general framework for the data driven modelling and solution of problems arising in water distribution systems. Hydraulic simulation, both scenario based, and Monte Carlo is a key tool in modelling in water distribution systems. The related optimization problems fall in a simulation/optimization framework in which objectives and constraints are often black-box. Bayesian Optimization (BO) is characterized by a surrogate model, usually a Gaussian process, but also a random forest and increasingly neural networks and an acquisition function which drives the search for new evaluation points. These modelling options make BO nonparametric, robust, flexible and sample efficient particularly suitable for simulation/optimization problems. A defining characteristic of BO is its versatility and flexibility, given for instance by different probabilistic models, in particular different kernels, different acquisition functions. These characteristics of the Bayesian optimization approach are exemplified by the two problems: cost/energy optimization in pump scheduling and optimal sensor placement for early detection on contaminant intrusion. Different surrogate models have been used both in explicit and implicit control schemes. Showing that BO can drive the process of learning control rules directly from operational data. BO can also be extended to multi-objective optimization. Two algorithms have been proposed for multi-objective detection problem using two different acquisition functions.

Many combinatorial optimization problems are hard to solve within the polynomial computational time or NP-hard problems. Therefore, developing new optimization techniques or improving existing ones still grab attention. This paper presents an improved variant of the Ant Colony Optimization meta-heuristic called Enhanced Hyper Cube Framework ACO (EHCFACO). This variant has an enhanced exploitation feature that works through two added local search movements of insertion and bit flip. In order to examine the performance of the improved meta-heuristic, a well-known structural optimization problem of laminate Stacking Sequence Design (SSD) for maximizing critical buckling load has been used. Furthermore, five different ACO variants were concisely presented and implemented to solve the same optimization problem. The performance assessment results reveal that EHCFACO outperforms the other ACO variants and produces a cost-effective solution with considerable quality.

The research paper presents a new approach towards constructing motion equations for structures with attached MTMDs (multiple tuned mass dampers). A primary system, with MDOF (multiple dynamic degrees of freedom) was reduced to an equivalent system with a SDOF (single degree of freedom) through the modal approach, and equations from additional MTMDs were added to a thus-created system. Optimization based on H2 and H∞ for the transfer function associated with the generalized displacement of an SDOF system. The research work utilized GA (genetic algorithms) and SA (simulated annealing method) optimization algorithms to determine the stiffness and damping parameters for individual TMDs. The effect of damping and stiffness (MTMD tuning) distribution depending on the number of TMDs was also analyzed. The paper also reviews the impact of primary system mass change on the efficiency of optimized MTMDs, as well as confirms the results of other authors involving greater MTMD effectiveness relative to a single TMD.

We developed a novel hybrid approach for solving global optimization, computer science, bio-medical and engineering real life applications that is based on the coupling of the Whale Optimizer and Sine Cosine Algorithms via a surrogate model. We relate the whale optimizer algorithm to balance between the exploitation and the exploration process in the proposed method. There exist confirmed techniques for searching approximate best optimal solutions, but our algorithm will further guarantee that such numerical and statistical solutions satisfy physical bounds of the standard and real life functions. Our experiments with the benchmark, bio-medical, computer science and engineering real life problems have illustrated the advantages of using a newly hybrid approach based on mixing Whale Optimizer and Sine Cosine algorithms. It holds considerable potential for reducing execution time for solving standard and real life problems and at the same time improving the quality of the solution.

With the every passing day, the demand for data traffic is increasing and this demand forces the research community not only to look for alternating spectrum for communication but also urges the radio frequency planners to use the existing spectrum smartly. Cell size is shrinking with the every upcoming communication generation which makes the base station placement planning complex and cumbersome. In order to make the next-generation cost-effective, it is important to design the network in such a way which utilizes minimum number of base stations while ensure coverage and quality of service. This paper aims at develop a new approach using hybrid metaheuristic and metamodel applied in multi-transmitter placement planning (MTPP) problem. We apply radial basis function (RBF) metamodel to assist particle swarm optimizer (PSO) in a constrained simulation-optimization (SO) of MTPP to mitigate the associated computational burden of optimization procedure. We evaluate the effectiveness and applicability of proposed algorithm in a case study by simulating MTPP model with two, three, four and five transmitters.

Baggage overweight is a significant phenomenon in the air travel in- dustry which is both regulated by the governments and highly profitable for the airlines. The recent years increase in airlines' profits is attributed to so-called ancillary payments – all consumer costs excluding the actual transportation fare. Baggage overweight fees, being a part of such pay- ments, have high profit-generation potential. Is the pricing for baggage overweight positioned correctly? The rationality of policies currently used by airlines is questionable, as they lack a customer-oriented marketing ap- proach. The general purpose of this research is to explore the possibilities of rational baggage overweight pricing for airlines by developing a multi- level price optimization model aimed to maximize company revenue. The modeling is based on determining consumer Willingness-To- Pay values for baggage overweight, and providing an optimal ticket price for them to maximize company expected revenue. The total profit value is forecasted too, based on the company market share and revenue level.

One control challenge in prosthetic legs is seamless transition from one gait mode to another. User intent recognition (UIR) is a high-level controller that tells a low-level controller to switch to the identified activity mode, depending on the user’s intent and environment. We propose a new framework to design an optimal UIR system with simultaneous maximum performance and parsimony for gait mode recognition. We use multi-objective optimization (MOO) to find an optimal feature subset that creates a trade-off between these two conflicting objectives. The main contribution of this paper is two-fold: (1) a new gradient-based multi-objective feature selection (GMOFS) method for optimal UIR design; and (2) the application of advanced evolutionary MOO methods for UIR. GMOFS is an embedded method that simultaneously performs feature selection and classification by incorporating an elastic net in multilayer perceptron neural network training. Experimental data are collected from six subjects, including three able-bodied subjects and three transfemoral amputees. We implement GMOFS and four variants of multi-objective biogeography-based optimization (MOBBO) for optimal feature subset selection, and we compare their performances using normalized hypervolume and relative coverage. GMOFS demonstrates competitive performance compared to the four MOBBO methods. We achieve a mean classification accuracy of 97.14% ± 1.51% and 98.45% ± 1.22% with the optimal selected subset for able-bodied and amputee subjects, respectively, while using only 23% of the available features. Results thus indicate the potential of advanced optimization methods to simultaneously achieve accurate, reliable, and compact UIR for locomotion mode detection of lower-limb amputees with prostheses.

Mathematical optimization offers a valuable approach to tackle Industry scheduling problems. By formulating the scheduling challenge as a mathematical problem, mathematical optimization enables efficient and effective decision-making processes. Mathematical optimization is particularly beneficial in complex scheduling scenarios, such as in networked manufacturing environments, where multiple jobs and resources need to be coordinated. By leveraging optimization models and algorithms, it becomes possible to generate optimal process plans, considering factors like job dependencies, resource availability, and timing constraints. Through mathematical optimization, organizations can achieve improved efficiency, reduced lead times, and enhanced utilization of resources. Rigorous mathematical formulations and optimization techniques enables to surpass traditional manual planning methods and brings forth powerful computational capabilities. By optimizing various scheduling objectives, from minimizing makespan to maximizing resource utilization, mathematical optimization provides organizations with valuable insights and actionable plans. The purpose of this study is to discuss scheduling solutions for multiple jobs in a networked manufacturing setting based on mathematical optimization process. The study analyses a solver-based approach to generate the optimal process plans for multiple jobs and compare it with a more traditional game-theoretic approach. The objectives aim to develop two solver-based model using Z3 and Gurobi to generate optimal process plans; implement a game-theoretic model to solve for the same set of scheduling problems, and compare the computational time, solution quality, and efficiency of both approaches. To achieve this, the methodology will start with the problem definition. Multiple jobs are to be scheduled on a set of parallel machines. Each job has predefined processing times, deadlines, and priorities. The objective is to minimize the total completion time and maximize machine utilization while meeting all deadlines.

Temperature Cycle Induced Deracemization (TCID) offers a promising approach to obtain enantiopure solids from racemic mixtures. By combining rapid racemization in solution and temperature swings, homochirality is theoretically achieved. Despite theoretical expectations of doubled yields compared to traditional chiral separation methods, such as in Preferential Crystallization, experimental validation remains lacking. We applied TCID to (1-(4-chlorophenyl)-4,4-dimethyl-2-(1H-1,2,4-triazol-1-yl) pentan-3-one) (Cl-TAK), introducing a post-TCID cooling step to enhance yield and a washing step to augment enantiopurity. This refinement yielded an 89.8% mass yield with 99.1% enantiomeric excess in the crystal phase (c.e.e.) within 24 hours on an 8.75g scale, showcasing improved performance with insignificant process duration extension. Additionally, we explored the stochasticity of deracemization, observing the development from low initial crystal enantiomeric excesses(1-6% c.e.e0) at a 2.5 g scale. Kinetic analysis revealed that a 2% c.e.e0 effectively mitigates chiral flipping risks and induction time in our system. Our study underscores the potential for reduced initial c.e.e. to expedite deracemization and presents a straightforward method to optimize yield and purity, facilitating industrial application.

In this paper, the entire downhole fluid sucker rod pump system is replaced with a viscoelastic vibration model, namely a third-order differential equation with an inhomogeneous forcing term. Both Kelvin and Maxwell viscoelastic models can be implemented along with the dynamic behaviors of a mass point attached to the viscoelastic model. By employing the time-dependent polished rod force measured with a dynamometer as the input to the viscoelastic dynamic model, we have obtained the displacement responses, which match closely with the experimental measurements in actual operations, through an iterative process. The key discovery of this work is the feasibility of the so-called inverse optimization procedure which can be utilized to identify the equivalent scaling factor and viscoelastic system parameters. The proposed Newton-Raphson iterative method with some terms in the Jacobian matrix expressed with averaged rates of changes based on perturbations of up to two independent parameters provides a feasible tool for optimization issues related to complex engineering problems with mere information of input and output data from either experiments or comprehensive simulations. The same inverse optimization procedure is also implemented to model the entire fluid delivery system of a very viscous non-Newtonian polymer modeled as a first-order ordinary differential system similar to the transient entrance developing flow. The convergent parameter reproduces transient solutions which match very well with those from full-fledged computational fluid dynamics models with the required inlet volume flow rate and the outlet pressure conditions.

We present an integrated omnichannel framework designed for coordinating and improving shopping experience in the Health and Pharma (H&P) sector. The architecture of this unified purchasing system is composed by macros and subsystems designed for the scalability and flexibility of the framework in the specific context of H&P. In addition, we introduce an optimization algorithm specifically designed for the storage operations in a dark-store, with the aim of optimizing operational efficiency and reducing related costs. In the present study we propose two product allocation strategies in a vertical carousel warehouse, based on correlations between products. We show that the proposed optimized allocation strategy significantly reduces picking times compared to the random allocation strategy. Moreover, these results indicate that taking into account the correlation between products in past orders and the optimization of product arrangements within the warehouse can significantly improve the efficiency of the picking process.

In this paper the attention is focused on the analysis and the optimization of energy flows in networked systems via a fluid-dynamic model. In particular, a cost functional that represents a term proportional to the kinetic energy of an energy system is studied. First, the functional is optimized for a simple network having a unique node, with an incoming arc and two outgoing ones. The optimization deals with distribution coefficients and explicit solutions are found. Then, the global optimization is obtained using the local optimal parameters at the various nodes of the system. Considering the case study of an energy hub, interesting results are obtained for the whole network, proving the correctness of the proposed approach.

In recent years, new metaheuristic algorithms have been developed taking as reference the inspiration on biological and natural phenomena. This nature-inspired approach for algorithm development has been widely used by many researchers in solving optimization problem. These algorithms have been compared with the traditional ones algorithms and have demonstrated to be superior in complex problems. This paper attempts to describe the algorithms based on nature, that are used in fuzzy clustering. We briefly describe the optimization methods, the most cited nature-inspired algorithms published in recent years, authors, networks and relationship of the works, etc. We believe the paper can serve as a basis for analysis of the new are of nature and bio-inspired optimization of fuzzy clustering.

The growing interest in the use of energy storage systems to improve the performance of tramways has prompted the development of control techniques and optimal storage devices, displacement, and sizing to obtain the maximum profit and reduce the total installation cost. Recently, the rapid diffusion of renewable energy generation from photovoltaic panels has also created a large interest in coupling renewable energy and storage units. This study analyzed the integration of a photovoltaic power plant, supercapacitor energy storage system, and railway power system. Random optimization was used to verify the feasibility of this integration in a real tramway electric system operating in the city of Naples, and the benefits and total cost of this integration were evaluated.

The quadratic unconstrained binary optimization (QUBO) is a classic NP-hard problem with an enormous number of applications. Local search strategy (LSS) is one of the most fundamental algorithmic concepts that has been successfully applied to a wide range of hard combinatorial optimization problems. One LSS that has gained the attention of researchers is the r-flip (also known as r-Opt) strategy. Given a binary solution with n variables, the r-flip strategy ‘flips’ r binary variables to get a new solution if the changes improve the objective function. The main purpose of this paper is to develop several results for implementation of r-flip moves in QUBO, including a necessary and sufficient condition that when a 1-flip search reaches local optimality, the number of candidates for implementation of the r-flip moves can be reduced significantly. The results of the substantial computational experiments are reported to compare an r-flip strategy embedded algorithm and a multiple start tabu search algorithm on a set of benchmark instances and three very-large-scale QUBO instances. The r-flip strategy implemented within the algorithm makes the algorithm very efficient, very high-quality solutions within a short CPU time.

Due to the high computational burden and the high nonlinearity of the responses, crashworthiness optimizations are notoriously hard-to-solve challenges. Among various approaches, methods like the Successive Response Surface Method (SRSM) have stood out for their efficiency in enhancing baseline designs within a few iterations. However, these methods have limitations that restrict their application. Their minimum iterative resampling required is often computationally prohibitive. Furthermore, surrogate models are conventionally constructed using Polynomial Response Surface (PRS), a method that is poorly versatile, prone to overfitting, and incapable of quantifying uncertainty. Furthermore, the lack of continuity between successive response surfaces results in suboptimal predictions. This paper introduces the Multi-Fidelity Successive Response Surface (MF-SRS), a Gaussian process-based method, which leverages a nonlinear multi-fidelity approach for more accurate and efficient predictions compared to SRSM. After initial testing on synthetic problems, this method is applied to a real-world crashworthiness task: optimizing a bumper crossmember and crash box system. Results, benchmarked against SRSM and the Gaussian Process Successive Response Surface (GP-SRS) – a single-fidelity Gaussian process-driven extension of SRSM, show that MF-SRS offers distinct advantages. Specifically, it improves upon the specific energy absorbed optimum value achieved by SRSM by 14.1 %, revealing its potential for future applications.

Algorithms for machine learning have found extensive use in numerous fields and applications. One important aspect of effectively utilizing these algorithms is tuning the hyperparameters to match the specific task at hand. The selection and configuration of hyperparameters directly impact the performance of machine learning models. Achieving optimal hyperparameter settings often requires a deep understanding of the underlying models and the appropriate optimization techniques. While there are many automatic optimization techniques available, each with its own advantages and disadvantages, this article focuses on hyperparameter optimization for well-known machine learning models. It explores cutting-edge optimization methods and provides guidance on applying them to different machine learning algorithms. The article also presents real-world applications of hyperparameter optimization by conducting tests on spatial data collections for landslide susceptibility mapping. Based on the experiment's results, both Bayesian optimization and metaheuristic algorithms showed promising performance compared to baseline algorithms. For example, the metaheuristic algorithm improved the overall accuracy of the random forest model. Additionally, Bayesian algorithms, such as Gaussian processes, performed well for models like KNN and SVM. The paper thoroughly discusses the reasons behind the efficiency of these algorithms. By successfully identifying appropriate hyperparameter configurations, this research paper aims to assist researchers, spatial data analysts, and industrial users in developing machine learning models more effectively. The findings and insights provided in this paper can contribute to enhancing the performance and applicability of machine learning algorithms in various domains.

Optimization using Genetic Algorithms (GA) is a well-known strategy in several scientific disciplines. The crossover is an essential operator of the Genetic Algorithm. It has been an active area of research to develop sustainable forms for this operand. In this work, a new crossover operand is proposed. This operand depends on giving an elicited description for the chromosome with a new structure for alleles of the parents. It is suggested that each allele has two attitudes, one attitude differs contrastingly with the other, and both of them complement the allele. Thus, in case of one attitude is good, the other should be bad. This is suitable for many systems which contain admired parameters and unadmired parameters. The proposed crossover would improve the desired attitudes and damp the undesired attitudes. The proposed crossover can be achieved in two stages: the first stage is a mating method for both attitudes in one parent to improving one attitude at the expense of the other. The second stage comes after the first improvement stage for mating between different parents. Hence, two concurrent steps for improvement would be applied. Simulation experiments for the system shows improvement in the fitness function. The proposed crossover could be helpful in different fields, especially to optimize routing algorithms and network protocols, an application that has been tested as a case study in this work.

Classical and optimal control architectures for motion mechanics with fusion of noisy sensors use different algorithms and calculations to perform and control any number of physical demands, to varying degrees of accuracy, precision, and cost. Their performances are tested for the purpose of comparison through the means of a Monte Carlo simulation that simulates how different parameters might vary under noise, representing real-world imperfect sensors. We find that improvements in one figure of merit often come at a cost in the performance in the others, especially depending on the presence of noise in the system sensors. If sensor noise is negligible, open-loop optimal control performs the best. However, in the overpowering presence of sensor noise, using a control law inversion patching filter performs as the best replacement, but has significant computational strain.

Structural system design is the process of giving form to a set of interconnected components subjected to loads and design constraints while navigating a complex design space. While safe designs are relatively easy to develop, optimal designs are not. Modern computational optimization approaches employ population based metaheuristic algorithms to overcome challenges with the system design optimization landscape. However, the choice of the initial population, or ground structure, can have an outsized impact on the resulting optimization. This paper presents a new method of generating such ground structures, using a combination of topology optimization (TO) and a novel system extraction algorithm. Since TO generates monolithic structures, rather than systems, its use for structural system design and optimization has been limited. In this paper, truss systems are extracted from topologies through morphological analysis and artificial intelligence techniques. This algorithm, and its assessment, constitutes the key contributions of this paper. The structural systems obtained are compared with ground truth solutions to evaluate the performance of the algorithms. The generated structures are also compared against benchmark designs from the literature. The results indicate that the presented truss generation algorithm produces structures comparable to those generated through metaheuristic optimization, while mitigating the need for assumptions about initial ground structures.

This paper presents a multi-swarm PSO algorithm for the Quadratic Assignment Problem (QAP) implemented on the OpenCL platform. Our work was motivated by results of time efficiency tests performed for single-swarm algorithm implementation that showed clearly that the benefits of a parallel execution platform can be fully exploited provided the processed population is large. The described algorithm can be executed in two modes: with independent swarms or with migration. We discuss the algorithm construction as well as we report results of tests performed on several problem instances from the QAPLIB library. During the experiments the algorithm was configured to process large populations. This allowed us to collect statistical data related to values of goal function reached by individual particles. We use them to demonstrate on two test cases that although single particles seem to behave chaotically during the optimization process, when the whole population is analyzed, the probability that a particle will select a near-optimal solution grows.

Powder bed fusion (PBF) process is a metal additive manufacturing process which can build parts with any complexity from a wide range of metallic materials. PBF process research has predominantly focused on the impact of only a few parameters on product properties due to the lack of a systematic approach for optimizing a large set of process parameters simultaneously. The pivotal challenges regarding this process require a quantitative approach for mapping the material properties and process parameters onto the ultimate quality; this will then enable the optimization of those parameters. In this study, we propose a two-phase framework for optimizing the process parameters and developing a predictive model for 316L stainless steel material. We also discuss the correlation between process parameters -- i.e., laser specifications -- and mechanical properties and how to achieve parts with high density (> 98%) as well as better ultimate mechanical properties. In this paper, we introduce and test an innovative approach for developing AM predictive models, with a relatively low error percentage of 10.236% that are used to optimize process parameters in accordance with user or manufacturer requirements. These models use support vector regression, random forest regression, and neural network techniques. It is shown that the intelligent selection of process parameters using these models can achieve an optimized density of up to 99.31% with uniform microstructure, which improves hardness, impact strength, and other mechanical properties.

Quantum optimization is a significant area of quantum computing with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational Hamiltonian-based algorithms, struggle on present quantum devices due to noise and decoherence. Existing techniques attempt to mitigate these issues through employing different Hamiltonian encodings or Hamiltonian clause pruning but often rely on optimistic assumptions rather than a deep analysis of the problem structure. We demonstrate how to formulate the problem Hamiltonian for the Quantum Approximate Optimization Algorithm to satisfy all the requirements that correctly describe the considered tactical aircraft deconfliction problem, achieving higher probabilities of measuring solutions compared to previous works. Our results indicate that constructing Hamiltonians from an unconventional, quantum-specific perspective with a high degree of entanglement results in linear number of entangleming gates instead of exponential and superior performance compared to standard formulations. Specifically, we achieve higher probabilities of measuring feasible solutions in 9 out of 9 instances compared to standard Hamiltonian formulations and surpass quadratic programming formulations known from quantum annealers in 7 out of 9 instances. These findings suggest that there is substantial potential for further research in quantum Hamiltonian design and that gate-based approaches may offer superior optimization performance over quantum annealers in the future.

With the digital transformation of the logistics industry, smart logistics algorithms have become a core technology to improve efficiency and reduce costs. This paper reviews the development history of traditional logistics technology and discusses the key role of technologies such as the Internet of Things, big data analysis, artificial intelligence, and automation in logistics technology innovation. It focuses on the application of intelligent logistics algorithms in path optimization, intelligent scheduling, data mining and prediction, and intelligent warehousing. To solve the problem of inconsistency between training and testing objectives, this paper proposes DRL4Route, a deep reinforcement learning-based path optimization framework, and designs the DRL4Route-GAE model. Validated through extensive offline experiments and online deployments, the model significantly outperforms existing optimal benchmark methods on real datasets, improving the location deviation squared metrics and the top-three location prediction accuracy metrics. These research results provide important support to further promote the intelligent development of the logistics industry.

Modern fighter aircraft increasingly need to conjugate aerodynamic performance and low observability. In this paper we showcase a methodology for a gradient-based bidisciplinary aero-stealth optimization. The shape of the aircraft is parametrized with the help of a CAD modeler, and we optimize with the SLSQP algorithm. The drag, computed with the help of a RANS method, is used as the aerodynamic criterion. The stealth criterion, a function is derived from the radar cross section in a given cone of directions, weighed with a function whose goal is to cancel the electromagnetic intensity in a given direction. Stealth is achieved passively by scattering back the electromagnetic energy away from the radar antenna and no energy is absorbed by the aircraft, which is considered as a perfect conductor. A Pareto front is identified by varying the weights of the aerodynamic and stealth criteria. The Pareto front allows for an easy identification of the CAD model corresponding to a chosen aero-stealth trade-off.

The requirement for integration of power plants due to the cyclical rise in electrical energy consumption is due to fluctuating load demand with the current grid systems. This integration necessitates effective allocating loads to the power plants for a minimum grid-tied transmission line cost while meeting network constraints. In this paper, we formulate an optimisation problem of minimising the total operational cost of all committed plants transmitted to the grid while meeting network constraints and ensuring economic power dispatch (EPD) and energy management system co-optimization. The developed Particle Swarm Optimization (PSO) method resolve the optimisation problem using piecewise quadratic function to describe the operational cost of the generation units, and the B coefficient approach is employed to estimate the transmission losses. Intelligent adjustments are made to the acceleration coefficients, and a brand-new algorithm is suggested for distributing the initial power values to the generation units. The developed economic power dispatch strategy successfully demonstrated an imperative cost reduction with connected load of 850MW, 1263MW and 2630MW power demand are contrasted with previous PSO application cost values, maximum yearly cost savings of (0.55%, 91.87), (46.55%, 3.78), (73.86%, 89.10) respectively, and significant environmental-benefit. The proposed co-optimisation approach can enhance a significant self-consumption ratio compared to the baseline method.

The load of power system changes with the development of economy, short-term load forecasting play a very important role in dispatching and management of power system. In this paper, the Ant Lion Optimizer (ALO) is introduced to improve the input weights and hidden-layer Matrix of extreme learning machine (ELM), after the parameters of ELM are optimized by ALO, then input nodes, hidden layer nodes and output nodes are determined, so a load forecasting model based on ALO-ELM combined algorithm is established. The proposed method is illustrated based on the historical load data of a city in China. The results show that the average absolute error of short-term load demand predicted by ALO-ELM model is 1.41, while that predicted by ELM is 4.34, the proposed ALO-ELM algorithm is superior to the ELM and meet the requirements of engineering accuracy, which proves the effectiveness of proposed method.

This work proposes a systematic topology optimization approach to simultaneously design the morphing functionality and actuation in three-dimensional wing structures. The actuation is assumed to be a linear strain-based expansion in the actuation material and a three-phase material model is employed to represent structural and actuating materials, and void. To ensure both structural stiffness with respect to aerodynamic loading and morphing capabilities, the optimization problem is formulated to minimize structural compliance while morphing functionality is enforced by constraining a morphing error between actual and target wing shape. Moreover, a feature mapping approach is utilized to constrain and simplify actuator geometries. A trailing edge wing section is designed to validate the proposed optimization approach. Numerical results demonstrate that three-dimensional optimized wing sections utilize a more advanced structural layout to enhance structural performance while keeping morphing functionality than two-dimensional wing ribs. The work presents the first step towards systematic design of three-dimensional morphing wing sections.

Wireless Sensor Networks (WSNs) has the characteristics of large-scale deployment, flexible networking, and wide application. It is an important part of the wireless communication networks. However, due to limited energy supply, the development of WSN is greatly restricted. Wireless Rechargeable Sensor Networks (WRSNs) transform the distributed energy around the environment into usable electricity through energy collection technology. In this work, a joint optimization strategy is proposed to improve the energy management efficiency for WRSNs. The joint optimization strategy is divided into two phases. In the first phase, we design an Annulus Virtual Force based Particle Swarm Optimization (AVFPSO) algorithm for area coverage planing. It adopts the multi-parameter joint optimization method to improve the efficiency of the algorithm. In the second phase, a Queuing Game-based Energy Supply (QGES) algorithm is designed for energy scheduling. It converts energy supply and consumption into network service. By solving the game equilibrium of the model, the optimal energy distribution strategy can be obtained. The simulation results show that our scheme improves the efficiency of coverage and energy, and extends the lifetime of WSN.

The continuous development in the field of industrial automation and electric mobility has led to the need for more efficient electrical machines with high power density. The improvement of electrical machines slot filling factors is one of the measures to satisfy these requirements. In recent years, this topic has aroused greater interest in the industrial sector, since the evolution of the winding technological manufacturing processes allows an economically sustainable realization of ordered winding arrangements, rather than random ones. Moreover, the manufacture of electrical machines windings must be preceded by an accurate design phase in which it is possible to evaluate the maximum slot filling factor obtainable for a given wire shape and for its dimensions. For this purpose, this paper presents an algorithmic approach for the evaluation of maximum slot filling factors in electrical machines under ideal geometric premise. In particular, this algorithm has a greater degree of flexibility with respect to the algorithm approaches found in the literature, since the study has been extended to round, rectangular and hexagonal wire sections. Furthermore, the slot filling factor calculation was carried out both for standard and non-standard slots. The algorithmic approach proposed can be considered as an additional useful tool for the fast design of electrical machine windings.

Creating self-learning algorithms, developing deep neural networks and improving other methods that "learn" for various areas of human activity is the main goal of the theory of machine learning. It helps to replace the human with a machine, aiming to increase the quality of production. The theory of artificial neural networks, which already have replaced the humans in problems of detection of moving objects, recognition of images or sounds, time series prediction, big data analysis and numerical methods remains the most dispersed branch of the theory of machine learning. Certainly, for each area of human activity it is necessary to select appropriate neural network architectures, methods of data processing and some novel tools from applied mathematics. But the universal problem for all these neural networks with specific data is the achieving the highest accuracy in short time. Such problem can be resolved by increasing sizes of architectures and improving data preprocessing, where the accuracy rises with the training time. But there is a possibility to increase the accuracy without time growing, applying optimization methods. In this survey we demonstrate existing optimization algorithms of all types, which can be used in neural networks. There are presented modifications of basic optimization algorithms, such as stochastic gradient descent, adaptive moment estimation, Newton and quasi-Newton optimization methods. But the most recent optimization algorithms are related to information geometry, for Fisher-Rao and Bregman metrics. This approach in optimization extended the theory of classic neural networks to quantum and complex-valued neural networks, due to geometric and probabilistic tools. There are provided applications of all introduced optimization algorithms, what delighted many kinds of neural networks, which can be improved by including any advanced approaches in minimization of the loss function. Afterwards, we demonstrated ways of developing optimization algorithms in further researches, engaging neural networks with progressive architectures. Classical gradient based optimizers can be replaced by fractional order, bilevel and, even, gradient free optimization methods. There is a possibility to add such analogues in graph, spiking, complex-valued, quantum and wavelet neural networks. Besides the usual problems of image recognition, time series prediction, object detection, there are many are other tasks for modern theory of machine learning, such as solving problem of quantum computations, partial differential and integro-differential equations, stochastic processes and Brownian motion, making decisions and computer algebra.

Energy harvesting is an emerging topic recently. This harvested energy is used to operate wireless sensors for different industrial monitoring and automation. To maximize the harvested energy in spinning systems, the harvester should vibrate at resonance for different spinning frequencies which can be achieved by active fitting. In this research, a novel methodology was developed by actively customizing the length of vibrating element beam to manipulate its natural frequency according to the spinning frequency. Different models were investigated numerically and experimentally to verify the proposed methodology. COMSOL Multiphysics software V5.1 was used to develop the numerical model, then and tip deformation and voltage difference results were benchmarked. The numerical model was verified experimentally by attaching a piezoelectric MIDE PPA 1021 which its vibrating length was varied by changing the supporting length from 0 mm to 12 mm to a spinning object having variable frequency from 0-200 Hz. It is found that the MIDE PPA 1021 beam vibrated at its resonance throughout the specified spinning frequencies. The proposed harvester can be applied in battery-free sensors being used in automotives, wind-mills blades, and rotating machinery.

Clustering is a crucial at the same time challenging task in several application domains. It is important to incorporate the optimum feature finding into our clustering algorithms for getting better prediction accuracy but this is difficult when there is no or little information about the importance or relevance of features. To tackle this task in an efficient manner we employ the natural evolution process inherent in genetic algorithms (GA) to find the optimum features for clustering for the healthy aging dataset. In order to empirically verify the findings, genetic algorithms were combined with a number of clustering algorithms including parti-tional, density based as well as agglomerative. A variant of the popular KMeans algorithm, named KMeans++ gave the best performance on all performance metrics when combined with GA.

The raw material purchasing (RMP) problem is to determine the purchasing quantities of raw materials in given periods or cycles. Raw material purchasing optimization is crucial for large-scale steel plants because it is closely related to the supply of raw materials and cost savings. The raw material purchasing of large-scale steel enterprises is characterized by many varieties, large quantities, and high costs. The RMP objective is to minimize the total purchasing cost consisting of the price of raw materials, purchasing set-up costs, and inventory costs and meet product demand. We present a mixed integer linear programming (MILP) model and a column generation (CG) solution for the resulting optimization problem. The column generation algorithm is the generalization of the branch & bound algorithm with solving the linear programming (LP) relaxation of MILP using column generation (CG), and its advantage is to handle large-sized MILPs. Experimental results show the effectiveness and efficiency of the solution.

In this study, the separation conditions of UHPLC-QTOF-MS and the extraction conditions of QuEChERS were optimized. The analytical process for determining Broflanilide residues in different soil types was successfully established and applied to its adsorption, desorption and leaching in soil. Broflanilide was extracted from soil with acetonitrile as extraction solvent, and purified with 50 mg PSA + 150 mg MgSO4. The modified UHPLC-QTOF-MS method was used for determination. In different types of soil, the average recovery of Broflanilide was 87.7% -94.38%, and the RSD was lower than 7.6%. In the analysis and determination of the adsorption, desorption and leaching properties in four soils, the RSD was less than 9.2%, showing good stability and can be applied to the analysis and determination of the residue of Broflanilide in different soils.

Although the behavioral mechanism studying is a difficult and complex task, it can produce an important systems optimization impact. In this work, we use, in this paper, inference system approach to represent reasoning mechanism and the operations of dynamic systems to extract mental representations from traveling salesman and convert them into cognitive structures. For this we develop an extraction automatic method to create knowledge bases and, later, data are stocked into structure based on transition maps and the performances of these created maps get improved through combining the reinforcement learning thus augment traveller's deciding capacity from historical data. These transition maps help to find best actions for obtaining useful new policies. Generated intermediate transition maps are gathered to give a global map called main map whose advantage is to improve the learning process. The main idea of this approach is to improve learning capability by using a reinforcement learning technique as exploration and exploitation strategy of the metaheuristique GRASP method and the use of the fuzze logical rules mechanism allowing concepts model to have more variability of states. The results obtained after simulation as presented in this paper are very encouraging.

Effective management of water distribution systems requires an integrated approach, but none of the available frameworks for one are in broad use in the water supply industry. Frameworks developed include a management standard of the American Water Works Association and Distribution System Optimization, a methodology for physical, hydraulic, and water quality performance assessment. The intelligent systems framework also offers a pathway to integration, but it lacks a definite structure. The voluntary aspect of adopting innovations within the fragmented and unregulated nature of the water utility industry poses a barrier to adoption of such innovations. Another barrier is the uncoordinated arrangements of water research stakeholders with different incentive structures. Intelligent water systems offer a way to incentive utilities to encourage implementation. They can provide a bottom-up approach where utilities see advantages, as opposed to a top-down approach where they are expected to adopt a method without seeing clear benefits. Research to develop new and improved tools is needed, but the research roadmap should prioritize implementation.

This study aimed to optimize the bioelectricity production process using a vinasse solution through the application of Plackett-Burman and Box-Behnken designs. An electrochemical cell was constructed using Arduino to measure the potential difference between the anode and cathode immersed in the vinasse solution, a byproduct of wine production containing organic compounds and ions that undergo redox reactions. The Plackett-Burman design identified the most influential variables among eight previously selected, including vinasse concentration, agitation, and yeast, which positively affected millivolt production, while temperature showed a negative correlation. Based on these results, the Box-Behnken design was used for process optimization, varying parameters such as concentration, stirring, and sodium chloride. Response surface graphs demonstrated the relationship between these variables and millivolt production. The findings indicate that higher agitation levels, lower concentrations of vinasse, and the addition of sodium chloride can enhance bioelectricity generation. The study provides insights into the bioelectricity production process from vinasse, contributing to the understanding and potential for sustainable energy generation. The methodology involving Arduino-based measurement and the utilization of experimental designs offers a systematic approach to optimize bioelectricity production from vinasse.

An airfoil is the geometric shape of a cross-section of a wing. When it is exposed to the flow of a fluid over its surface, it generates both lift and drag forces through a pressure distribution. Designing an efficient airfoil for aerodynamic applications is a complex challenge in the field of aerodynamic engineering, with the aim of achieving an optimal lift-to-drag ratio. The success of airfoil design hinges on the effective reduction of drag force under specific conditions, while simultaneously attaining the desired lift without encountering significant flow separation, such as boundary layer shedding. Furthermore, the design must adhere to lifting force limitations and meet structural requirements. In the field of airfoil design and optimization, literature review articles provide a valuable resource by offering an overview of the latest advancements in specific areas. These areas encompass a wide range of topics including the design and testing of adaptive geometry wings, such as morphing wing technology as well as the application of shape optimization techniques to enhance airfoil performance. Our goal is to provide researchers with an in-depth review of relevant articles published to date, examining the applied approaches utilized to tackle the complex problem of airfoil design and explore the methodology employed to address it, from a broad perspective on the topic.

In the fast-paced internet world that we live in today, internet technologies and tools that enable us to connect online are rapidly changing and improving. To adapt to the changing environment, many game developers are changing their business models to adjust to this online environment by developing games that are centred around online gaming. As such, the internet demands of consumers such as gamers are increasing because of the need for quality internet connection for optimal gameplay. There are too many factors that can affect online gameplay. Moreover, not all gamers are equipped with the network knowledge and skills to diagnose and troubleshoot any internet issues that may arise during their gameplay session. The main contribution of this research was to gather insights from Malaysian broadband internet consumers, mainly from gamers and general users regarding their opinions of their ISP service experience in gaming, general use and service quality. A 1-click solution is presented as a smart autonomous network monitoring tool that can autonomously monitor, diagnose, and troubleshoot network problems with minimal input from the user. This research was conducted using a mixed-mode research methodology where the participants were asked to fill up a questionnaire regarding the user experience of their Internet Service Provider (ISP), and their perception of the 1 click-automated networking tool for their personal use. It is shown that there is a market demand for a 1 click-automated networking tool as gamers and general users both agree that such a tool would be beneficial to them by improving the internet quality of a network.

Deep learning, specifically the supervised approach, has proved to be a breakthrough in depth prediction. However, the generalization ability of deep networks is still limited, and they cannot maintain a satisfactory performance on some inputs. Addressing a similar problem in the segmentation field, a scheme (f-BRS) has been proposed to refine predictions in the inference time. f-BRS adapts an intermediate activation function to each input by using user clicks as sparse labels. Given the similarity between user clicks and sparse depth maps, this paper aims at extending the application of f-BRS to depth prediction. Our experiments show that f-BRS, fused with a depth estimation baseline, is trapped in local optima, and fails to improve the network predictions. To resolve that, we propose a double-stage adaptive refinement scheme (DARS). In the first stage, a Delaunay-based correction module significantly improves the depth generated by a baseline network. In the second stage, a particle swarm optimizer (PSO) delineates the estimation through fine-tuning f-BRS parameters—that is, scales and biases. DARS is evaluated on an outdoor benchmark, KITTI, and an indoor benchmark, NYUv2 while for both the network is pre-trained on KITTI. The proposed scheme outperformed rival methods on both datasets.

In the aim of improving the positioning accuracy of monocular visual inertial simultaneous localization and mapping (VI-SLAM) system, an improved initialization method with faster convergence is proposed. This approach is classified as three parts: Firstly, in the initial stage, the pure vision measurement model of ORB-SLAM is employed to make all the variables visible. Secondly, the frequency of IMU camera was aligned by IMU preintegration technology. Thirdly, an improved iterative method is put forward for estimating the initial parameters of IMU faster. The estimation of IMU initial parameters is divided into several simpler sub-problems, containing direction refinement gravity estimation, gyroscope deviation estimation, accelerometer bias and scale estimation. The experimental results on the self-built robot platform show that our method can up-regulate the initialization convergence speed, simultaneously improve the positioning accuracy of the entire VI-SLAM system.

Hydrogen used as an energy carrier can provide an important route to the decarbonization of energy supplies. However, realizing this opportunity requires a significant increase in both production and transportation capacity. Part of the increase in transportation capacity could be provided by the shipping of liquid hydrogen, but this introduces an energy-intensive liquefaction step into the supply-chain. The energy required for liquefaction can be reduced by developing improved process designs, but since all low-temperature processes are affected by the available heat-sink temperature, local ambient conditions will also affect the energy penalty. This work studies how the energy consumption associated with liquefaction varies with heat-sink temperature through the optimization of design parameters for a typical next-generation hydrogen liquefaction process. The results show that energy consumption increases by around 20%, across the cooling temperature range 5 to 50 °C. Considering just the range 20 to 30 °C there is a 5% increase, illustrating the significant impact ambient temperature can have on energy consumption.

This paper describes a new optimization methodology of testing vector sets reduction for testing of soft-processor cores and their individual blocks. The deterministic test vectors both for whole core and its individual blocks are investigated that significantly reduce the testing time and amount of test data that needs to be stored on the tester memory. The processor executes an assembler program which together with determined testing vectors ex-ercise its functionality. The new BIST methodology applicable at industrial testing of processor cores, diagnostics and dynamic reconfiguration of FPGA is proposed. This novel methodology combined with dynamic reconfiguration of FPGAs can be profitable applied for missions-critical i.e. FPGAs operate in space, or other difficult condition where are explore on radiation. Experimental results demonstrate that the proposed approach reduces many times testing time.

The aim of this paper is to examine the beneficial impact of feedback information in the dynamics of production-inventory control systems. Two production-inventory control system models are analyzed: APIOBPCS and 2APIOBPCS models. The simulation-based experiment designs were conducted by using the state-space equations of the two models. The bullwhip effect as measured by the variance ratio between the order rate and the consumption rate, and inventory responsiveness as measured by the Integral of Absolute Error between the actual and the target levels of inventory, are two metrics used to evaluate the performance of the production-inventory control system in response to a random customer demand. To ensure that both models work under optimal performance, multi-objective particle swarm optimization (MOPSO) is employed to address the problem of tuning the controller’s parameters. The simulation results show the 2APIOBPCS model outperforms the APIOBPCS model at achieving the desired bullwhip effect and being able to provide better inventory responsiveness. The improvement in the inventory responsiveness becomes more significant when the system operates under mismatched lead time and/or an initial condition.

Highway alignment is an essential part of the highway planning and design phase. Highways are impacted by existing projects and surrounding context. The isolation of geo-technical analysis from highway planning and design also delays the planning process. This study therefore proposes a model that integrates building information modelling (BIM) and geographic information science (GIS) capabilities to facilitate the planning and design process. Semantic web technologies are used to integrate BIM and GIS data on a semantic level. The proposed model also helps to identify geohazards by providing geological analysis. The visualization of the proposed project can help reduce design errors and miscommunication, which, in turn, reduces project risk. In addition, the model facilitates highway alignment optimization by incorporating visualization, simulation, and analysis into the planning and design phase. The proposed model provides future opportunities for project professionals to have organized, reliable and dynamic ways to manage the project during construction.

This research demonstrates the optimization and production of biochar from barley husk (BH), corn cob (CC), and Agave salmiana leaves (AL) via pyrolysis in a muffle furnace. Taguchi experimental design (L9) was applied to conduct the experiments at different levels by altering four operating parameters. Carbonization temperature (300–500 ºC), carbonization time (30–90 min), precursor mass (2–5 g) and N₂ flow rate (100–200 cc/min) were the variables examined in this study. The effect of the parameters on the biochar yield was investigated, and the important parameters were identified employing analysis of variance (ANOVA). The optimum conditions for maximum biochar yield were: carbonization temperature of 400 ºC, carbonization time of 30 min, precursor mass of 2 g, and N₂ flow rate of 150 cc/min. The biochars produced under optimum conditions was characterized physically and chemically. Biochar yields of 19.75% for corn cob (CCB), 32.88% for barley husk (BHB), and 31.14% for agave leaves (ALB) were obtained.

Due to its flexibility, cloud computing has become essential in modern operational schemes. However, the effective management of cloud resources to ensure cost-effectiveness and maintain high performance presents significant challenges. The pay-as-you-go pricing model, while convenient, can lead to escalated expenses and hinder long-term planning. Consequently, FinOps advocates proactive management strategies, with resource usage prediction emerging as a crucial optimization category. In this research, we introduce the multi-time series forecasting system (MSFS), a novel approach for data-driven resource optimization alongside the hybrid ensemble anomaly detection algorithm (HEADA). Our method prioritizes the concept-centric approach, focusing on factors such as prediction uncertainty, interpretability and domain-specific measures. Furthermore, we introduce the similarity-based time-series grouping (STG) method as a core component of MSFS for optimizing multi-time series forecasting, ensuring its scalability with the rapid growth of the cloud environment. The experiments performed demonstrate that our group-specific forecasting model (GSFM) approach enabled MSFS to achieve a significant cost reduction of up to 44%.

In the Internet of Things (IoT) era, Mobile Edge Computing (MEC) significantly enhances the efficiency of smart devices but is limited by battery life issues. Wireless Power Transfer (WPT) addresses this issue by providing a stable energy supply. However, effectively managing overall energy consumption remains a critical and under-addressed aspect for ensuring the network’s sustainable operation and growth. In this paper, we consider a WPT-MEC network wit user cooperation to migrate the double near-far effect for the mobile node (MD) far from the base station. We formulate the problem of maximizing long-term computation rates under a power consumption constraint as a multi-stage stochastic optimization (MSSO) problem. This approach is tailored for a sustainable WPT-MEC network, considering the dynamic and varying MEC network environment, including randomness in task arrivals and fluctuating channels. We introduce a virtual queue to transform the time-average energy constraint into a queue stability problem. Using the Lyapunov optimization technique, we decouple the stochastic optimization problem into a deterministic problem for each time slot, which can be further transformed into a convex problem and solved efficiently. Our proposed algorithm works efficiently online without requiring further system information. Rigorous mathematical analysis shows that our algorithm achieves O(1/V),O(V) trade-off between computation rate and queues stability. Extensive simulation results demonstrate that our proposed algorithm outperforms baseline schemes, achieving approximately 4% enhancement while maintain the queues stability.

Mobile Edge Computing (MEC) integrated with Wireless Power Transfer (WPT) is emerging as a promising solution to reduce task delays and extend the battery life of Mobile Devices (MDs). Cooperative user communication, or relay technology, enhances communication efficiency for users located far from the base station by mitigating the double near-far effect caused by distance. This is considered a key technology in Beyond 5G (B5G) and future communication systems. In this paper, we focus on maximizing the long-term energy efficiency (EE) of a user-cooperation WPT-MEC system, while taking into account the uncertain load dynamics at the edge MD and the time-varying state of the wireless channel. The joint optimization of wireless charging time fraction, MD offloading duration, helper node processing time, and transfer power decision presents significant challenges due to the coupling of data offloading among cooperative users and a volatile system environment. To address these challenges, we formulate the problem as a stochastic programming problem and propose an online control algorithm, DOUCA, to solve it. Our approach utilizes Dinkelbach’s method and Lyapunov optimization theory to decouple the sequential decision problem into a deterministic sub-problem for each time slot. For the sub-problem, we use variable substitution to convert the non-convex problem into a convex one, containing only a small number of variables, which can be efficiently solved. Furthermore, we provide a mathematical analysis of our algorithm’s performance. Extensive simulation results demonstrate the effectiveness of our proposed algorithm, as evidenced by an impressive energy efficiency improvement of over 20% compared to benchmark methods. Our algorithm also achieves a trade-off between EE and system stability.

This article investigates the effectiveness of feature extraction and selection techniques for enhancing the performance of classifiers accuracy in Type II Diabetes Mellitus (DM) detection using microarray gene data. To address the inherent high dimensionality of the data by employing three Feature Extraction (FE) methods are used namely, Short-Time Fourier Transform (STFT), Ridge Regression (RR), and Pearson Correlation Coefficient (PCC). To further refine the data, meta-heuristic algorithms like Bald Eagle Search Optimization (BESO) and Red Deer Optimization (RDO) are utilized for feature selection. The performance of seven classification techniques such as Non-Linear Regression - NLR, Linear Regression - LR, Gaussian Mixture Model - GMM, Expectation Maximization - EM, Logistic Regression - LoR, Softmax Discriminant Classifier - SDC, and Support Vector Machine with Radial Basis Function kernel - SVM-RBF are evaluated with and without feature selection. The analysis reveals that the combination of PCC with SVM-RBF achieved a promising accuracy of 92.85% even without feature selection. Notably, employing BESO with PCC and SVM-RBF maintained this high accuracy. However, the highest overall accuracy of 97.14% was achieved when RDO was used for feature selection alongside PCC and SVM-RBF. These findings highlight the potential of feature extraction and selection techniques, particularly RDO with PCC, in improving the accuracy of DM detection using microarray gene data.

Background: In today’s competitive market, predicting customer churn with high accuracy is crucial for enterprises to maintain growth and profitability. Traditional predictive models often lack in accuracy due to the complexity of customer behavior.Objective: This research aims to improve the accuracy of predicting customer churn by utilizing the Particle Swarm Optimization (PSO) algorithm for optimizing the hyperparameters of a composite deep learning model. The performance of this enhanced model is evaluated against traditional models such as LSRM_GRU, LSTM, GRU, and CNN_LSTM to demonstrate the effectiveness of PSO in hyperparameter tuning.Methods: A composite deep learning approach was employed, integrating various neural network architectures to leverage their strengths in modeling complex customer interactions. The PSO algorithm was used to optimize the model’s hyperparameters. Customer transaction and interaction data from different business operations served as the dataset for testing and analyzing the model’s performance. Evaluation metrics including accuracy, precision, recall, F1 score, and ROC AUC were utilized for a detailed comparison with established models.Findings: The PSO-enhanced composite deep learning model showed superior performance across all metrics, significantly outperforming the LSRM_GRU, LSTM, GRU, and CNN_LSTM models. Notably, improvements in ROC AUC and F1 score highlight the robustness and balanced precision-recall trade-off of the proposed model, demonstrating its effectiveness in identifying potential churners.Conclusion: The integration of PSO for hyperparameter optimization in composite deep learning models for customer churn prediction has proven to significantly enhance predictive accuracy and performance metrics over conventional models. This underscores the potential of evolutionary algorithms in improving deep learning applications. Future research should explore the scalability of this approach across various sectors and further refine predictive accuracy with evolving customer data.

The literature has well established prestressing in concrete beams and its calculation procedures. However, its use in composite steel-concrete beams has increased despite main normative codes lacking a specific approach for it. Designers must, in most cases, combine the available criteria to calculate the standards of steel and reinforced concrete structures. This study aimed to formulate this optimization problem and analyze CO2 emissions for the optimal design of composite steel-concrete beams with external prestressing. The design variables for the optimization problem include cross-section of laminated or welded profiles, slab height, characteristic strength of concrete to compression, and number of tendons. We obtained a solution for the optimization problem via a genetic algorithm (GA) and a particle swarm optimization one (PSO). Comparative analysis with experimental example and with optimization problem of prestressed steel beam are performed. An parametric analysis to several spams is performed, which enabled to evaluate the factors that most impact CO2 emissions. According to results, the chosen algorithms effectively obtained solutions for the problem, and PSO usually provided better results than GA. Regarding the final solution composition, steel contributes the most to emissions, welded profiles provided better solutions than laminated ones, and laminated spans of up to 17.5m and welded ones up to 27.5m dispensed with tendons.

Adequate knowledge about the development and operation of the components of water systems is of high importance in order to optimize them. For this reason, forecasting of future events becomes greatly significant due to making the appropriate decision. Moreover, operational river management severely depends on accurate and reliable flow forecasts. In this regard, current study inspects the accuracy of support vector regression (SVR), and SVR regulated with fruit fly optimization algorithm (FOASVR) and M5 model tree (M5), in river flow forecasting. Monthly data of river flow in two stations of the Lake Urmia Basin (Vaniar and Babarud stations on the Aji Chay and the Barandouz Rivers) were utilized in the current research. Additionally, the influence of periodicity (π) on the forecasting enactment was examined. To assess the performance of mentioned models, different statistical meters were implemented, including root mean squared error (RMSE), mean absolute error (MAE), correlation coefficient (R), and Bayesian information criterion (BIC). Results showed that the FOASVR with RMSE (4.36 and 6.33 m3/s), MAE (2.40 and 3.71 m3/s) and R (0.82 and 0.81) values had the best performances in forecasting river flows in Babarud and Vaniar stations, respectively. Also, regarding BIC parameters, Q_t-1 and π were selected as parsimonious inputs for predicting river flow one month ahead. Overall findings indicated that, although both FOASVR and M5 predicted the river flows in suitable accordance with observed river flows, the performance of FOASVR was moderately better than the M5 and periodicity noticeably increased the performances of the models; consequently, FOASVR can be suggested as the accurate method for forecasting river flows.

Adequate knowledge about the development and operation of the components of water systems is of high importance in order to optimize them. For this reason, forecasting of future events becomes greatly significant due to making the appropriate decision. Moreover, operational river management severely depends on accurate and reliable flow forecasts. In this regard, current study inspects the accuracy of support vector regression (SVR), and SVR regulated with fruit fly optimization algorithm (FOASVR) and M5 model tree (M5), in river flow forecasting. Monthly data of river flow in two stations of the Lake Urmia Basin (Vaniar and Babarud stations on the Aji Chay and the Barandouz Rivers) were utilized in the current research. Additionally, the influence of periodicity (π) on the forecasting enactment was examined. To assess the performance of mentioned models, different statistical meters were implemented, including root mean squared error (RMSE), mean absolute error (MAE), correlation coefficient (R), and Bayesian information criterion (BIC). Results showed that the FOASVR with RMSE (4.36 and 6.33 m3/s), MAE (2.40 and 3.71 m3/s) and R (0.82 and 0.81) values had the best performances in forecasting river flows in Babarud and Vaniar stations, respectively. Also, regarding BIC parameters, Qt-1 and π were selected as parsimonious inputs for predicting river flow one month ahead. Overall findings indicated that, although both FOASVR and M5 predicted the river flows in suitable accordance with observed river flows, the performance of FOASVR was moderately better than the M5 and periodicity noticeably increased the performances of the models; consequently, FOASVR can be suggested as the accurate method for forecasting river flows.

Currently, maritime traffic is increasing with economic growth in several regions worldwide. However, this growth in maritime traffic has led to increased risk of marine accidents. These accidents have a higher probability of occurring in regions where geographical features, such as islands, are present. Further, the positioning of rescue ships in a particular ocean region with a high level of maritime activity is critical for rescue operations. This paper proposes a method for determining an optimal set of locations for stationing rescue ships in an ocean region with numerous accident sites in the Wando islands of South Korea. The computational challenge in this problem is identified as the positioning of numerous islands of varying sizes located in the region. Thus, the proposed method combines a clustering-based optimization method and an image processing approach that incorporates flood filling to calculate the shortest distance between two points in the ocean that detours around the islands. Experimental results indicate that the proposed method reduces the distance from rescue ships and each accident site by 5.0 km compared to the original rescue ship locations. Thus, rescue time is reduced.

A swarm based nature-inspired optimization algorithm namely fruit fly optimization algorithm (FOA) has simple structure and ease of implementation. However, FOA has a low success rate and a slow convergence because FOA generates new positions around the best location using fixed search radius. Several improved FOAs have been proposed. But their exploration ability is questionable. To make the search process to transit from the exploration phase to the exploitation phase smoothly, this paper proposes a new FOA constructed from a cooperation of the multileader and the probabilistic random walk strategies (CPFOA). It has two population types working together. CPFOA's performance is evaluated by 18 well-known standard benchmark, and 30 CEC’2017 functions. The results showed that CPFOA outperforms both the original FOA and its variants in terms of convergence speed and performance accuracy. The results base on CEC’2017 show that CPFOA can achieve a very promising accuracy when compared with the well-known competitive algorithms. CPFOA is applied to optimize two applications; the MLPs classifying real datasets and extracting parameters of T-S fuzzy system for modelling Box and Jenkins gas furnace data set. CPFOA can find parameters having a very high quality compared with the best known competitive algorithms.

Wind turbines (WTs) are clean a renewable energy source that has been growing in popularity in recent years. Gearboxes are complex, expensive, and critical components of WT, which are subject to high maintenance costs and several stresses including high loads and harsh environments that can lead to failure with significant downtime and financial losses. This paper focuses on the development of a digital twin-based approach for the modelling and simulation of WT gearboxes with the aim to improve their design, diagnosis, operation, and maintenance by providing insights into their behavior under different operating conditions. Pow-erful commercial computer-aided design tools (CAD) and computer-aided engineering (CAE) software are embedded into a computationally efficient multi-objective optimization framework (modeFrontier) with the aim of maximizing the power density, compactness, performance, and reliability of the WT gearbox. This entails minimizing its weight, volume, and maximum stresses and strains achieved without compromising efficiency. The 3D CAD model of the WT gearbox is carried out using SolidWorks, the Finite Element Analysis (FEA) to obtain the stresses and strains fields are modelled using Ansys Workbench, while the multibody kinematic and dynamic system is analyzed using MSC Adams. The method has been successfully applied to different case studies to find the optimal design and analyze the performance of the WT gearboxes. Simulation results can be used to identify potential failure modes and optimize gearbox design to improve performance, extend service life and relia-bility, thereby ensuring proper operation over its lifetime and reducing maintenance costs.

Carbon Capture and Storage (CCS) stands as a pivotal technological stride toward a sustainable future, with the practice of injecting supercritical CO2 into subsurface formations having already been an established practice for enhanced oil recovery operations. The overarching objective of CCS is to protract the operational viability and sustainability of platforms and oilfields, thereby facilitating a seamless transition towards sustainable practices. This study introduces a comprehensive framework for optimizing well placements in CCS operations, employing a derivative-free method known as Bayesian optimization. The development plan is tailored for scenarios featuring aquifers devoid of flow boundaries, incorporating production wells tasked with controlling pressure buildup and injection wells dedicated to CO2 sequestration. Notably, the wells operate under group control, signifying predefined injection and production targets and constraints that must be adhered to throughout the project’s lifespan. As a result, the objective function remains invariant under specific permutations of the well locations. Our investigation delves into the efficacy of Bayesian optimization under the introduced permutation invariance. The results reveal that it demonstrates critical efficiency in handling the optimization task extremely fast. In essence, this study advocates for the efficacy of Bayesian optimization in the context of optimizing well placements for CCS operations, emphasizing its potential as a preferred methodology for enhancing sustainability in the energy sector.

Amid the swift progression of the global automobile industry, the aspiration for lightweight vehicle design has surfaced as a crucial approach to boost fuel efficiency and curtail environmental impact. The objective of this study revolves around achieving holistic optimization of vehicle structure via detailed scrutiny of vehicle process characteristics, amalgamated with a Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) and a topology optimization (TO) method.The process initiates with an examination of the vehicle's technical characteristics, succeeded by an optimization protocol that couples GA with BPNN. This exhaustive optimization procedure derives the best-fit values of design parameters and identifies the globally optimal lightweight design approach. Subsequently, a comprehensive structural optimization is actualized by modifying the topological distribution of the structure.A simulation experiment of the conceptual car body beam skeleton is conducted as a conclusive step, and the anti-collision capacity of the car body beam skeleton is assessed by measuring deformation intrusion. The findings reveal that in the vehicle topology optimization, a comparative analysis of pre and post-optimization results indicates an improved topological density across diverse sections. The topological density of the vehicle's frontal structure escalates from 0.75 to 0.8. Following optimization, the stiffness assessment records a marginal increase (within the range of 0.02–0.05), implying that the lightweight design does not compromise the general rigidity of the structure.The optimized body structure manifests superior crashworthiness in the crash test: the deformation intrusion diminishes by 27% in front-end collisions. In side impacts, the deformation and intrusion at critical points are reduced by 13.15% to 10% respectively. The comprehensive method proposed herein proves to be an efficient strategy to actualize the lightweight design of vehicles.

With the engineering system becoming more and more complex, the uncertainty factors have a more and more profound influence on the reliability and security of the engineering system. In recent years, Reliability-Based Design Optimization (RBDO) has been studied extensively in complex engineering system design. The research on reliability optimization design considering stochastic uncertainty has been comprehensive and widely used. However, the reliability optimization design considering mixed uncertainty has the disadvantages of large computation and imprecise convergence. This study proposes an RBDO method based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to overcome this challenge. In the method, PSO is used to solve the most probable point, while SA has excellent global optimization capability to acquire the global optimal solution. Finally, three examples are given to illustrate the advantages of the proposed method.

This article presents the development of an innovative Maximum Power Point Tracking (MPPT) strategy, utilizing a Particle Swarm Optimization (PSO) algorithm to improve the effectiveness of PV systems and expedite convergence. The new MPPT method incorporated a unique Swarm Self-Reinforcement Mechanism (SSRM) within the PSO algorithm, targeting quick convergence and excellent tracking accuracy. This approach enables the PSO to eliminate the fitness function that has the lowest value and subsequently reinforce it in the next iteration, revolving around the global maximum power point (GMPP). By applying this novel PSO-based method, the MPPT performance of PV systems was significantly improved, facilitating the algorithm to proficiently navigate through the solution space and quickly locate the GMPP, even in rapidly changing environmental conditions. The outcomes derived from this novel approach were contrasted with other algorithmic optimization methods, validating its superior convergence speed and tracking accuracy. Different swarm sizes were examined using SSRM, and the optimal swarm size for the system employing MPPT was identified to achieve the lowest convergence time (CT). The results showcased the impressive performance capabilities of this novel strategy, resulting in a time con-traction of up to 28% compared to the conventional PSO technique, where the optimal swarm size was found to be 5. This achievement marks a significant milestone in the evolution of PSO-based MPPT techniques, and paves the way for future advancements in this exciting field.

Concern about the planet's future has motivated governments around the world to adopt policies that promote more responsible energy consumption. Reducing emissions of the principal cause of climate change man-made greenhouse gases requires greater system efficiency and the utilization of renewable energy sources. The generation of electricity is the single largest source of hazardous pollutants, followed by the transportation sector. This is true due to the extreme reliance on petroleum and its derivatives that these industries have. Electric mobility is receiving more attention from businesses, governments, and academic institutions as a means to reduce the negative impacts of current energy consumption. Without measures to address common technical issues, electric vehicles would strain electrical infrastructure. In order to determine the best strategy for switching operations and feeder reconfiguration, this research presents a helpful hybrid genetic algorithm particle swarm optimization (HGAPSO) method. Meet transmission limits while decreasing real power losses and enhancing the system's bus voltage profile. The effects of HGAPSO on power losses and voltage distributions in the network are analyzed. Then, a report is produced contrasting GA and PSO. This cross-breeding of GA and PSO led to HGAPSO. This important problem can be solved more effectively with the use of new or improved algorithms. To find the optimal reconfiguration and properly rearrange transmission network interconnection, it employs a plethora of heuristic optimization algorithms. The objective is to limit bus voltage variations while maintaining the system's radial topology and minimizing power usage. The reliability and performance of the procedure were evaluated using MATLAB's IEEE 33-bus communication network. The outcomes demonstrate the effectiveness of the proposed technique, which cuts down on power waste during standalone runs and speeds up the processing time.

The Vehicle Routing Problem (VRP) and its variants are found in many fields, especially logistics. In this study, we introduced an adaptive method to a complex VRP. It combines multi-objective optimization and several forms of VRPs with practical requirements for an urban shipment system. The optimizer needs to consider terrain and traffic conditions. The proposed model also considers customers' expectations, shipper considerations as goals, and the common goal like transportation cost. We offered compromise programming to approach the multi-objective problem by decomposing the original multi-objective problem into a minimized distance-based problem. We designed a hybrid version of the Genetic algorithm with the Local Search algorithm to solve the proposed problem. We evaluate the effectiveness of the proposed algorithm with the Tabu Search algorithm, the original Genetic algorithm on the tested dataset. The results show that our method is an effective decision-making tool for the multi-objective VRP and an effective solver for the new variation of VRP.

Mixing is considered as a critical process parameter (CPP) during process development due to its significant influence on reaction selectivity and process safety. Nevertheless, mixing issues are difficult to identify and solve owing to their complexity and dependence on knowledge of kinetics and hydrodynamics. In this paper, we proposed an optimization methodology using Computational Fluid Dynamics (CFD) based compartmental modelling to improve mixing and reaction selectivity. More importantly, we have demonstrated that through the implementation of surrogate-based optimization, the proposed methodology can be used as a computationally non-intensive way for rapid process development of reaction unit operations. For illustration purpose, reaction selectivity of a process with Bourne competitive reaction network is discussed. Results demonstrate that we can improve reaction selectivity by dynamically controlling rates and locations of feeding in the reactor. The proposed methodology incorporates mechanistic understanding of the reaction kinetics together with an efficient optimization algorithm to determine the optimal process operation and thus can serve as a tool for quality-by-design (QbD) during product development stage.

Surface defect detection based on machine vision and convolutional neural networks (CNNs) is an important and necessary process that enables rubber ring manufacturers to improve production quality and efficiency. However, such automatic detection always consumes substantial computer resources to guarantee detection accuracy. To solve this problem, in this paper, we present a CNNs optimization algorithm based on the Ghost module. First, we replace the convolutional layer with the Ghost module in CNNs so that feature maps can be generated using cheaper linear operations. Second, we use an optimization method to obtain the best replacement of the Ghost module to achieve a balance between computer resource consumption and detection accuracy. Finally, we use an image preprocessing method that includes inverting colors. We integrated this algorithm into YOLOv5, which we trained on a dataset with 122 images of rubber ring surface defects. Compared with the original network, the network size decreased by 30.5% and the computational cost decreased by 23.1% whereas average precision only decreased by 1.8%. Additionally, the network's training time decreased by 16.1% as a result of preprocessing. These results show that the proposed approach greatly helped practical rubber ring surface defect detection.

Magnetic resonance imaging (MRI) is crucial for its superior soft tissue contrast and high spatial resolution. Integrating deep learning algorithms into MRI reconstruction enhances image quality and efficiency, but a comprehensive review of optimization-based deep learning models for MRI reconstruction has been missing. This study fills that gap by examining the latest optimization-based algorithms in deep learning for MRI reconstruction, including gradient descent algorithms, proximal gradient descent algorithms, ADMM, PDHG, and diffusion models combined with gradient descent. Learnable optimization algorithms (LOA) are highlighted for their ability to map optimization processes to structured neural networks, improving model interpretability and performance. The study demonstrates significant advancements in MRI reconstruction through deep learning, with successful clinical applications. These findings provide valuable insights and resources for researchers aiming to advance medical imaging using innovative deep learning techniques.

This study presents the Distilled MixUp Squeeze ResNet (DMSResNet), an optimized variant of the Residual Network architecture designed for high accuracy and computational efficiency. By integrating Squeeze-and-Excitation blocks, MixUp data augmentation, and knowledge distillation, it achieves competitive performance within strict parameter constraints and limited training resources. Evaluated on the CIFAR-10 dataset, the model attains a 96.56% accuracy with only 4.3 million total parameters. The results demonstrate that optimization of established architectures can yield performance comparable to newer models, especially in resource-limited scenarios. This work contributes to the development of efficient deep learning models for applications in constrained computational environments.

The healthcare system is crucial to the development, standard of living, and sustainability of any country. Amid the pandemic, most developed countries are experiencing varying levels of difficulty managing their healthcare systems. Overloading of healthcare services is common, leading to prolonged waiting times for medical services; thus, the wastage of hospital resources must be addressed seriously. In this paper, we examine the problem of no-shows in outpatient clinics. Through a review of the literature and practical industrial experience, we identify the processes of these clinics. We then propose a robust optimisation approach for overbooking using a traditional overbooking model and a robust system. This model aims to mitigate the significant parameter uncertainties encountered during the pandemic. Considering risk aversion, the optimal policy for overbooking can be established while accounting for the costs associated with overbooking. The main contribution of this paper is the introduction of an alternative method to address the uncertainty of no-shows using an overbooking technique.

Solar energy is one of the most important renewable energy sources for many settings, such as households, solar-powered vehicles, power grid support, etc. However, the amount of solar energy produced is directly proportional to the surface area of the solar panel exposed to the sun rays, and so the challenges arise for the space required to install solar panels in order to get maximum area coverage of sun radiation energy absorption in constricted spaces such as vehicles powered by solar, small residential apartments, etc. The challenge with solar energy is that once a plate is installed, the space under it or above it cannot be used for another solar panel installation. This is due to the fact that the shadow cast by the above solar panel or structure prevents sun rays from reaching the below solar panel. The introduction of flexible solar panels that can take on any shape has given us the opportunity to explore the possibility of maximising solar plate surface area using surface manifold techniques. In this optimisation study, the constraint is that we have a space with fixed dimensions of length, width, and height, and the objective is to maximise the surface area of the panel within the given space dimensions to maximise solar energy absorption. Thus, this paper then proposes curving the panel surface and/or protruding the surfaces of the panel using the concept of a topology surface manifold to maximise the surface area: Protruding panel surface with shapes such as pyramidal, cone, hemisphere, sinusoidal wavy curve, etc. are analysed to check if the panel surface increases at all. The geometrical design result shows that the panel surface can increase by more than 20%. Although this paper only presents concept work and details of experimental design are yet to be performed, it should also be noted that curving surfaces have drawbacks, such as some protruding parts of solar panels when the plate is tilted, not facing the sun directly, which may cast shadows on parts of the solar panel, causing hindrance.

Global optimization is widely adopted nowadays in a variety of practical and scientific problems. In this context, a group of techniques that is widely used is that of evolutionary techniques. A relatively new evolutionary technique in this direction is that of Giant Armadillo Optimization, which is based on the hunting strategy of giant armadillos. In this paper, a number of modifications to this technique are proposed, such as the periodic application of a local minimization method as well as the use of modern termination techniques based on statistical observations. The proposed modifications have been tested on a wide - series test functions, available from the relevant literature and it was compared against other evolutionary methods.

For marine vessels, a propeller shaft system, also known as a propulsion shaft system, is an essential changer in engine torque and propeller thrust. The propeller shaft system is subjected to transverse, longitudinal, and torsional excitations during operation. These sources of excitations originate from alternating thrust generated by the propeller, operation of a propeller in a stern flow field which is non-uniform in time and space, misalignment of components such as shafts, bearings, and keyholes in the assembly, excitations in the form of rotational motion, and the whirling motion of the shafts. These dynamic excitations posed a challenging issue for the integrity and reliability of a marine vehicle. Thus, it is crucial to analyze the dynamic response of the propulsion shaft system. The dynamic analysis of the propulsion shaft system is typically conducted using numerical /analytical models. At present, Finite Element Model (FEM) as a numerical model plays a vital role in analyzing the dynamic response of the structure. The computed response and the modal parameters from the FE model are reliable only if accurate boundary conditions, such as stiffness, can be imposed on the model. However, the numerical FE model deviates from the experimental results because of uncertainties in the stiffness values of the bearings and other connectors. This paper uses the Response Surface Optimization (RSO) technique to estimate the unknown stiffness of the bearings used in the propulsion shaft system. The experimental model of the propeller shaft system is constructed from the steady-state response of the system using the step sine excitation. The natural frequencies and the amplitude of vibrations in the FE model are updated using the parametric RSO technique. The updated model shows that the difference in natural frequencies and vibration amplitude is less than 10% between the optimized and experimental models. Propeller Shaft, Vibrations, Optimization, Response Surface

In recent years, large language models have demonstrated remarkable performance across various natural language processing (NLP) tasks. However, deploying these models for real-world applications often requires efficient inference solutions to handle the computational demands. In this paper, we explore the utilization of CPUs for accelerating the inference of large language models. Specifically, we introduce a parallelized approach to enhance throughput by 1) Exploiting the parallel processing capabilities of modern CPU architectures, 2) Batching the inference request. Our evaluation shows the accelerated inference engine gives an 18-22x improvement in the generated token per sec. The improvement is more with longer sequence and larger models. In addition to this, we can also run multiple workers in the same machine with NUMA node isolation to further improvement in tokens/s. Table 2, we have received 4x additional improvement with 4 workers. This would also make Gen-AI based products and companies’ environment friendly, our estimates shows that CPU usage for Inference could reduce the power consumption of LLMs by 48.9% (1252 W for A100 with AMD EPYC 7V13 vs 613 W for Intel® Xeon® Gold 6538N) while providing production ready throughput & latency.

The hybrid in-band on-channel (IBOC) transmission system as a digital audio radio scheme could transmit analog FM and digital audio simultaneously. In IBOC systems, broadcasters transmit signals within the allocated channel bands, so the bandwidth allocated for digital audio transmission is a big challenge. In view of the above, the use of cooperative game theory, supported by the use of the bankruptcy game and Shapley's value, is proposed as a strategy to optimize the bandwidth allocation at each node or station, according to the demand in the service, the number of stations and the radio channel conditions in the FM band. The paper proposes a scenario under saturated traffic conditions, in order to evaluate the degree of optimization that the Shapley value can perform under clearly established traffic and channel conditions. The evaluation process yielded a quite favorable result, where it is observed that the use of cooperative game theory supported by the Shapley value can be considered as an excellent alternative when performing bandwidth optimization processes for digital broadcasting over IBOC in FM and with the possibility of being implemented in other digital radio broadcasting systems.