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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

The global agricultural sector is increasingly pressured to adopt sustainable practices and reduce its environmental impact. In this context, greenhouses play a crucial role in enabling year-round crop production, ensuring food security, and minimizing reliance on traditional open-field farming. However, the energy consumption associated with greenhouse operations poses a significant challenge to achieving sustainability goals. As a result, there is a growing emphasis on transitioning greenhouses towards near-zero energy consumption. Near-zero energy consumption in greenhouses refers to the ambitious objective of minimizing energy usage to the greatest extent possible while maintaining optimal growing conditions for crops. This goal encompasses reducing energy consumption for heating, cooling, lighting, and other operational needs, as well as exploring renewable energy sources to power greenhouse operations. This review article offers a comprehensive overview of greenhouse energy consumption, with the main goal of analyzing the present situation, identifying key challenges, exploring potential opportunities, and proposing future perspectives for decreasing energy usage in greenhouse environments. As the focus on sustainable agricultural practices grows, the need to reduce energy consumption in greenhouses becomes increasingly important. The review critically examines current technological models and strategies applied in smart greenhouse applications, as well as the monitoring of microclimatic conditions inside the greenhouse, encompassing factors such as temperature, humidity, CO2 levels, soil quality, and crop cultivation. Moreover, it aims to present existing literature that investigates the advancement of greenhouses toward achieving significant reductions in energy consumption.

Root crops grow in the soil deeply and bond with soil closely, which results in that the process of the separation between soil and root becomes the most difficult during the harvesting processes. In order to harvest root crops efficiently, the mechanical harvesting has become the main developing trend. However, high power and high damage rate are still occurred when mechanical harvester gets in touch with the roots. In this paper, we review the research of the development and evaluation of the mechanical harvesting of root crops and its performance optimization on the past years. The process of soil separation mainly consists in the initial separation between root and the ground and further separation between root and adhered soil. In general, the soil-cutting operation in the initial separation and the sieving mechanism in the further separation require high draught and power. And the dramatic friction, impact, pressure and so on, which happen in the components and soil-roots, are the key reasons to lead to root damage. The optimization of harvesting methods and parameters, including the digging shovel shape, working conditions, vibration, and screening way, is more significant in improving the harvesting performance. But there are still some limitations in the research and application of the mechanical harvester for root crops. Future research is suggested to focus on the development of the soil break-up when the digging shovel cutting soil, the insight into the interaction between soil and roots by different external compression loads, and the long-term studies to verify the high-efficiency and low-damage performances of mechanical harvester in practical application.

Hand gesture recognition has many valuable applications in engineering and health care. This study proposes a novel model which can accurately distinguish hand gestures using forearm muscles' surface electromyogram (sEMG) signals. A deep learning algorithm with hyper parameters impacting the final model’s accuracy and a convolutional neural network (CNN) were employed in the recognition stage. The number of convolutional layers, kernels per layer, and neurons in the dense layer were selected for optimization, while the remaining parameters, such as the learning rate, batch size, and number of epochs, were chosen based on trial and error and prior knowledge. The optimal values for the selected hyperparameters were obtained using a genetic algorithm to achieve maximum recognition accuracy. The UC2018 Dual-Myo database was used for training and testing the model based on EMG signals characterizing the activity of eight different hand gestures. The final structure of the model consisted of two convolutional layers with 131 and 28 kernels, a dense layer with 111 neurons, and a softmax layer with eight neurons. Upon optimizing the hyperparameters using the genetic algorithm, the accuracy of the proposed model increased from 91.86% to 96.4% at best and 95.3% on average in real-time applications and 99.6% in an offline mode. Future work is warranted towards improving the architecture and the computational cost.

The annual energy matrix has been changing in the last years because of the necessity of less dependence on fossil fuels, which are running out on the planet. Therefore, a study was started to simulate the most efficient production of H2 through COMSOL Multiphysics®, as it is a gas that in the future will be essential to supply the world's energy necessities, due to its easy to get and insert in piped gas pipes. From this study, we were able to present an optimization of parameters that presents good indications of how to obtain efficient hydrogen production in an idealized reactor.

The term STODS (Surgical Temporary Ocular Discomfort Syndrome) has been coined to describe the ocular surface perturbations induced by surgery. As one of the most important refractive elements of the eye, Guided Ocular Surface and Lid Disease (GOLD) optimization is fundamental to success in achieving refractive outcomes and mitigating STODS. Effective GOLD optimization and the prevention/treatment of STODS, requires an understanding of the molecular, cellular and anatomic factors that influence ocular surface microenviroment and the associated perturbations induced by surgical intervention. By reviewing the current understanding of STODS etiologies, we will attempt to outline a rationale for a tailored GOLD optimization depending on the ocular surgical insult. With a bench to bedside approach, we will highlight clinical examples of effective GOLD perioperative optimization can mitigate STODS deleterious effect on preoperative imaging and postoperative healing.

An essential step in solving any topology optimization problem is determining the sensitivities of the objective function and optimization constraints. Unfortunately, these sensitivities are usually derived and implemented manually. Nontrivial objective functions and constraints, especially with the involvement of material and geometric nonlinearities, need strenuous mathematical derivation, leading to error-prone implementation. Another intriguing approach to finding sensitivities is automatic differentiation. This paper uses the automatic differentiation and adjoint method to find the sensitivities for two multiphysics topology optimization problems: 1) thermoelasticity and 2) piezoelectricity. This approach is not limited to these examples and can be easily extended to other single- or multi-physics topology optimization problems.

60\% of the global population is expected to be in cities by 2050. At the same time the climate is changing at an accelerated rate. In this short paper we discuss the conflation of these two phenomena and how it may change the cities of the future. We formulate this as an optimization problem that could help answer important questions such as where are they likely to be located? How are they to be powered? What would be their demand for mobility and how might this be met? How over or under ground might these cities be? This paper first looks at a historical paradigm of cities in the absence of the climate crisis and then proposes the new paradigm to look at cities of the future faced by the challenge of the climate change crisis.

In a one price economy, the Fundamental Theorem of Asset Pricing (FTAP) establishes that no-arbitrage is equivalent to the existence of an equivalent martingale measure. Such an equivalent measure can be derived as the normal unit vector of the hyperplane that separates the attainable gain subspace and the convex cone representing arbitrage opportunities. However, in two-price financial models (where there is a bid-ask price spread), the set of attainable gains is not a subspace anymore. We use convex optimization, and the conic property of this region to characterize the “No-Arbitrage” principle in financial models with the bid-ask price spread present. This characterization will lead us to the generation of a set of price factor random variables. Under such a set, we can find the lower and upper bounds (supper-hedging and sub-hedging bounds) for the price of any future cash flow. We will show that for any given cash flow, for which the price is outside the above range, we can build a trading strategy that provides one with an arbitrage opportunity. We will generalize this structure to any two-price finite-period financial model.

In CCS projects, the transportation of CO₂ by ship can be an attractive alternative to transportation using a pipeline, particularly when the distance between source and disposal location is large. However, the energy consumption of the liquefaction process can be significant, making the selection of an energy-efficient design an important factor in the minimization of operating costs. Since the liquefaction process operates at low temperature, its energy consumption will vary with ambient temperature, which could be a factor that influences the trade-off point between pipelines and shipping in different geographic locations. A consistent set of data showing the relationship between energy consumption and cooling temperature is therefore potentially useful to CCS system modelling. This study compares the performance of a wide range of CO₂ liquefaction schemes. It applies a methodical approach to the optimization of process operating parameters and studies performance across a range of operating temperatures. A set of data for the minimum energy consumption cases is presented. The main findings are that open-cycle CO₂ processes often offer minimum energy consumption; NH₃ based schemes often offer better performance at higher ambient temperatures; and that for the cooling temperature range 15 to 50 °C, the energy consumption for the best performing liquefaction process rises by around 40%.

Proper calibration of eye movement signal registered by an eye tracker seems to be one of the main challenges in popularizing eye trackers as yet another user input device. Classic calibration methods taking time and imposing unnatural behavior of users have to be replaced by intelligent methods that are able to calibrate the signal without conscious cooperation with users. Such an implicit calibration requires some knowledge about the stimulus a person is looking at and takes into account this information to predict probable gaze targets. The paper describes one of the possible methods to perform implicit calibration: it starts with finding probable fixation targets (PFTs), then uses these targets to build a mapping - probable gaze path. Various possible algorithms that may be used for finding PFTs and mapping are presented in the paper and errors are calculated utilizing two datasets registered with two different types of eye trackers. The results show that although for now the implicit calibration provides results worse than the classic one, it may be comparable with it and sufficient for some applications.

Energy system models have become indispensable to shape future energy systems by providing insights into different trajectories. However, sustainable systems with high shares of renewable energy are characterized by growing cross-sectoral interdependencies and decentralized structures. To capture important properties of increasingly complex energy systems, sophisticated and flexible modelling tools are needed. At the same time open science becomes increasingly important in energy system modelling. This paper presents the Open Energy Modelling Framework (oemof) as a novel approach in energy system modelling, representation and analysis. The framework forms a toolbox to construct comprehensive energy system models and has been published open source under a free license. With a collaborative development based on open processes the framework seeks for a maximum level of participation and transparency to facilitate open science principles in energy system modelling. Based on a generic graph based description of energy systems it is well suited to flexibly model complex cross-sectoral systems and incorporate various modelling approaches. This makes the framework a multi-purpose modelling environment for modelling and analyzing different systems ranging from an urban to a transnational scale.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems, we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we look at quantum speedup ratios of HHL Algorithm for different scenarios of linear programming. In a first scenario we look quantum speedup ratio (S(N)) as a function of phase transition and the ratio (κ) between the greatest and smallest eigenvalues of the matrix in linear equation system. As a second scenario, we investigate the changes in S(N) as a function of κ and s, which is the coefficient for defining the matrix as s-sparse.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we looked at the duality of resource allocation problems. First, we chose a real world optimization problem and looked at its solution with linear programming. Then, we restudied this problem with a quantum algorithm in order to understand whether if there is a speedup of the solution. The improvement in computation is analysed and some interesting results are reported.

This paper introduces new improvements to the modified version of the BIRECT (BI secting RECTangles) algorithm referred to as BIRECTv. We explore various approaches, by first including a grouping strategy for hyper-rectangles having almost the same sizes by categorizing them into different classes. Therefore constraining them not to exceed a certain pre-defined threshold (a small positive value to define the tolerance level). This approach allows for more efficient computation and can be particularly useful when dealing with a large number of hyper-rectangles with varying sizes. To avoid over-sampling, and preventing redundant or excessive sampling, at some shared vertices in descendant subregions, a particular vertex database is used to limit the number of samples taken within each subregion to two. The experimental investigation shows that these improvements have a positive impact on the performance of the BIRECTv(imp.) algorithm and the proposal is a promising global optimization algorithm compared to the original BIRECTv algorithm and its variants. Additionally, the BIRECTv(imp.) algorithm showed particular efficacy in solving high-dimensional problems.

Using flexible AC transmission system (FACTS) devices in power systems while adhering to some equality and inequality constraints, researchers around the world sought to address this issue with the objectives of improving the voltage profile, reducing power losses in transmission lines, and increasing system reliability and safety. The recent development of FACTS controllers opens up new perspectives for safer and more efficient operation of electrical power networks by continuous and rapid action on power systems parameters, such as phase angle shifting, voltage injection and line impedance compensation. Thus, an improvement on voltage profile and enhancement of power transfer capability can be obtained. It is for that, the idea behind the FACTS concept is to enable the transmission system to be an active element in increasing the flexibility of power transfer requirements and in securing stability of integrated power system. It may also be effective in transient stability improvement, power oscillations damping and balancing power flow in parallel lines. The primary issue that has significantly piqued the interest of a number of researchers working in this field is the FACTS optimization problem, which involves determining the optimal type, location, and size of FACTS devices in electrical power systems. For solving this mixed integer, nonlinear and non-convex optimization problem, this paper provides an in-depth and comprehensive review of the various optimization techniques covered in published works in the field. In this review, a classification of optimization techniques in five main groups that are widely used, such as classical optimization techniques or conventional optimization approaches, Meta heuristic methods, analytic methods or sensitive index methods and mixed or hybrid methods, is summarized. In addition, a performance descriptions and comparison of these different optimization techniques are discussed in this study. Finally, some advice is offered for future research in this field.

Based on collected power generation data associated with solar irradiance, PV system conversion efficiency and cell temperature, an hourly solar PV power estimation model by a parallel artificial neural network (ANN) and particle swarm optimization (PSO) algorithm is proposed. Weight matrices related to different seasons and geographic areas for estimation power generations have been trained by real measured operation data. The parallel PSO algorithm with heuristic global optimization technique assists the ANN training process to get near optimal solutions precisely. The accuracy and reliability of estimation is audited by actual details of photovoltaic power stations in various regions and scales. The results of estimation model can not only assist the electricity dispatcher to explicitly monitor the trend of solar power generation in different areas, but also coordinate with traditional power plants to meet load demand more accurately. The presented model will bring benefits to power dispatching for larger scales of intermittent and unstable solar power generation.

Selecting a feature in data mining is one of the most challenging and important activities in pattern recognition. The issue of feature selection is to find the most important subset of the main features in a specific domain, the main purpose of which is to remove additional or unrelated features and ultimately improve the accuracy of the categorization algorithms. As a result, the issue of feature selection can be considered as an optimization problem and to solve it, meta-innovative algorithms can be used. In this paper, a new hybrid model with a combination of whale optimization algorithms and flower pollination algorithms is presented to address the problem of feature selection based on the concept of opposition-based learning. In the proposed method, we tried to solve the problem of optimization of feature selection by using natural processes of whale optimization and flower pollination algorithms, and on the other hand, we used opposition-based learning method to ensure the convergence speed and accuracy of the proposed algorithm. In fact, in the proposed method, the whale optimization algorithm uses the bait siege process, bubble attack method and bait search, creates solutions in its search space and tries to improve the solutions to the feature selection problem, and along with this algorithm, Flower pollination algorithm with two national and local search processes improves the solution of the problem selection feature in contrasting solutions with the whale optimization algorithm. In fact, we used both search space solutions and contrasting search space solutions, all possible solutions to the feature selection problem. To evaluate the performance of the proposed algorithm, experiments are performed in two stages. In the first phase, experiments were performed on 10 sets of data selection features from the UCI data repository. In the second step, we tried to test the performance of the proposed algorithm by detecting spam emails. The results obtained from the first step show that the proposed algorithm, by running on 10 UCI data sets, has been able to be more successful in terms of average selection size and classification accuracy than other basic meta-heuristic algorithms. Also, the results obtained from the second step show that the proposed algorithm has been able to perform spam emails more accurately than other similar algorithms in terms of accuracy by detecting spam emails.

The COVID-19 pandemic has emphasized the crucial role of ventilation systems in mitigating cross-infections, especially in infectious disease hospitals. This study introduces a dual-design operation ventilation system that can operate under two sets of ventilation conditions for normal and epidemic times. A challenge is optimizing duct diameters for required airflow while maintaining hydraulic balance. We design a genetic algorithm with adaptive penalty factor, the velocity constraint and the improved crossover and mutation probability. The improved genetic algorithm is suitable for ventilation system networks, which can find a better air duct diameters combination to improve the hydraulic balance rate, and reduce the usage of air valves, resulting in efficient hydraulic balancing commissioning. Compared with the traditional genetic algorithm, it has a faster search speed and a better global search ability, which is effective for the optimal design of ventilation system networks.

Drug delivery through Liposomes has shown tremendous potential in terms of the therapeutic application of nanoparticles. There are several drug-loaded liposomal formulations approved for clinical use that help mitigate harmful effects of life-threatening diseases. Developments in the field of liposomal formulations and drug delivery have made it possible for clinicians and researchers to find therapeutic solutions for complicated medical conditions. A key aspect in the development of drug-loaded liposomes is a careful review of optimization techniques to improve the overall formulation stability and efficacy. Optimization studies help in improving/modulating the various properties of drug-loaded liposomes and are vital for the development of this class of delivery systems. A comprehensive overview of the various process variables and factors involved in the optimization of drug-loaded liposomes is presented in this review. The influence of different independent variables on drug release and loading properties with the application of a statistical experimental design is also explained in this article.

Real-time quaking-induced conversion (RT-QuIC) assays have become common in the detection of chronic wasting disease (CWD) and are very sensitive provided the assay duration is sufficient. However, a prolonged assay duration may lead to non-specific signal amplification. The wide range of pre-defined assay durations in current RT-QuIC applications presents a need for optimization of the RT-QuIC assay duration. In this study, receiver operating characteristic (ROC) analysis was applied to optimize assay duration for detection of CWD in obex and retropharyngeal lymph node (RLN) tissue specimens. Two different fluorescence thresholds were used: a fixed threshold based on background fluorescence (Tstdev) and a max-point ratio (maximum/background fluorescence) threshold (TMPR) to determine CWD positivity. The optimal assay duration was 27 h for both obex and RLN based on Tstdev, and 27 and 28 h for obex and RLN, respectively, based on TMPR. The optimized assay durations were then evaluated for screening CWD in white-tailed deer from an affected farm. Results by RT-QuIC using optimized duration based on Tstdev and TMPR were in 100% and 92.3 % or higher agreement with those by the widely used screening assay, ELISA. In comparison, when using a 40 h assay duration, the agreement between RT-QuIC and ELISA reduced to 89.2% or higher, and the RT-QuIC results were significantly (p < 0.05) different from those using optimum durations. These findings demonstrated that the application of ROC analysis for the optimization of assay duration could improve the RT-QuIC assay for screening CWD in white-tailed deer.

This study is focused on an optimal sizing method based on genetic algorithms (GA) in order to design a high-performance photovoltaic system that would be installed in the Alioune Diop University of Bambey, Senegal. The multi-objective optimization allowed us to find a better trade- off between the Total Life Cycle cost (TLCC) and the Loss of Power Supply Probability (LPSP). The goal is to minimize the TLCC while maintaining a good satisfactory of the system with a desired LPSP, under certain constraints. The expressions of the TLCC and the LPSP are established according to the total photovoltaic energy and the battery capacity. The toolbox of Matlab software is used to implement the optimization problem with twelve blocks of the site and its different corresponding loads. The obtained results have led to a several combinations of the photovoltaic and battery capacities of which the best one is selected based on the lowest LPSP, that guaranteed a better load coverage during the night. The results of this proposed method are compared with intuitive method that has been firstly applied. For the block with the lowest load demand, the proposed optimization model leads to a reduction a reduction of 70% and 48% in the storage capacity and the TLCC respectively for a LPSP of 0.007 %.

The predominance of traffic lights in urban settings often induces fluctuations in traffic patterns and energy utilization among vehicles. To counteract the adverse effects of traffic lights on the energy efficiency of electric vehicles (EVs), a Multi-Intersections-Based Eco-Approach and Departure strategy (M-EAD) is proposed. This strategy aims to enhance vehicle energy efficiency, traffic flow, and battery longevity, all while upholding satisfactory driving comfort. The M-EAD strategy unfolds in two distinct stages: the optimization of an eco-friendly green signal window and the refinement of speed trajectories. The initial stage tackles the optimization of traffic light green signal windows, underpinned by the minimization of travel delays via solving the shortest path problem. In the subsequent stage, a receding horizon framework takes center stage, leveraging an iterative dynamic programming algorithm to tackle the speed optimization challenge. The objective here is to curtail energy consumption and reduce battery wear by finding an optimal speed trajectory. Furthermore, the real-world efficacy of this approach is substantiated through on-road vehicle tests, attesting to its viability in actual road scenarios.

The natural distribution of stress in the femur is altered when total hip arthroplasty (THA) is performed. In fact, when a stem is inserted inside the femur, there is a variation in stress due to the difference in rigidity between the material with which the stem is made and the femur. This generates the phenomenon of stress-shielding. The aim of this study is to design an optimized prosthesis that guarantees excellent rotational stability and re-duced stress shielding. Methods: through the finite element method (FEM) the mechanical behavior of the stem subjected to the loads described by ISO 7206-4: 2010 is studied. Re-sults: Through topological optimization, there is a reduction in stress shielding in the proximal zone of 31.46%. The addition of ridges on the dorsal side of the stem also im-proves rotational stability by 27.82%. Conclusions: The decrease in stiffness that is rec-orded with the optimized stem, guarantees a greater distribution of stress on the bone. The presence of dorsal ridges also favors the corticalization of the bone as it loads the bone near the dorsal ensuring further stability. The perforated prosthesis presented in this study, shows an increase in primary stability and an improvement in rotational stability. As there is also a bone regrowth inside the prosthesis.

Due to the impacts from climate change, the allocation of water resources must urgently be optimized worldwide to ensure that the needs of both water managers and farmers are balanced. In this study, manager-oriented and farmer-oriented assessment models were developed for irrigation water optimization and allocation. The distance from water sources and hydraulic head were the main factors in the manager-oriented assessment model; crop value, water demand of crops, and soil type were additional factors in the farmer-oriented assessment model. The developed assessment models were used to assess irrigation water allocation in five villages in Neimen District. Cadasters at high elevation were discovered to not be suitable for cultivation of crops because of the difficulties in constructing irrigation facilities and the loss of irrigation water during transportation. The result obtained from the manager-oriented assessment system was related to the costs involved in the construction and maintenance of irrigation facilities, which indicated that cadasters located at long distances from water sources and at high elevation are unsuitable for cultivation. By contrast, the result obtained from the farmer-oriented assessment system was related to the profits of farmers and revealed that more cadasters would be suitable for cultivation if suitable crops were chosen.

Optimization of Magnetohydrodynamics parameters on the velocity profile and temperature distribution of incompressible fluid flow on a porous channel was evaluated. The fluid flow was considered to be unsteady, incompressible and flowing in 2-D in porous channel. The effects of magnetic parameter, Darcy’s number and fluid pressure on velocity profiles, and the effect of variable viscosity and Eckert number on temperature distribution in incompressible fluid flow were determined. The flow was considered to be in a channel running along the x-axis on which the magnetic field exist and finally along the y-axis on the porous part of the channel. The resulting model equations were solved by Finite Difference Method (FDM) in MATLAB software. Analysis of results indicated that increasing Darcy’s number and fluid pressure leads to increase in fluid velocity profile, while increasing magnetic parameter decreases fluid velocity profile. Also, it was observed that increase in both Eckert number and fluid viscosity lead to increase in temperature distribution. Optimization in temperature was achieved by increasing the magnetic field while viscosity was optimized by increasing the length of the porous part of the channel. This study will helpful to contribute alternative equations and methodology to engineering and in factories where getting the MHD parameters optimally is the main objective, particularly on temperature, velocity and pressure.

The optimization of the pile driver frame is very important to the overall performance of the pile driver. This paper takes the large body structure of a model of hydraulic static pile driver as the research object. ANSYS APDL finite element software is used to perform static analysis and sensitivity analysis on the large body structure of the pile driver. On the premise of meeting the design requirements, according to the most dangerous working conditions of the pile driver, the size optimization of the frame structure of the pile driver is carried out based on sensitivity analysis. The mathematical model is established with the plate thickness as the design variable, the strength and stiffness of the body structure as the constraints, and the minimum mass of the body structure as the objective function. The optimization results show that the optimization design model based on sensitivity analysis not only meets the strength and stiffness conditions of the large structure, but also reduces the structural quality by 22.1% and greatly saves the production cost.

Initial choice of Learning Rate is a key part of gradient based methods and has a great effect on the performance of the Deep Learning Model.This paper studies the behavior of multiple gradient based optimization algorithm which are commonly used in Deep Learning and compare their performance on various learning rate. As observed popular choice of optimization algorithms are highly sensitive to various choice of learning rates. Our goal is to find which optimizer has an edge over others for a specific setting. We look at two datasets namely MNIST and CIFAR10 for benchmarking. The results are quite surprising, and it will help us to choose a learning rate more efficiently.

The purpose of this paper is to develop a theoretical predictive model for LNG shipping routes selection process. Strategic decisions about shipping costs could be improved if a deeper knowledge about products economic value is provided. Developments made on the extraction and industrial processes related to this fossil fuel are driving the natural gas sector towards a unique globalised market. Moreover, data analytics applications as well as machine learning are topics presented as perfect catalysers for achieving an unprecedented natural gas globalised market. Additionally, this paper aims at showing the state of the art of new techniques used in transportation engineering that might have synergies with other industries (eg. commodities cost reduction, energy supply…). Finally, this paper aims to provide foundation for further research and development using more sophisticated data and algorithms that will help to close the gap between theoretical and practical scope of this techniques.

With the ongoing fifth-generation cellular network (5G) deployment, electromagnetic field exposure has become a critical concern. However, measurements are scarce, and accurate electromagnetic field reconstruction in a geographic region remains challenging. This work proposes a conditional Generative Adversarial Network to address this issue. The main objective is to reconstruct the electromagnetic field exposure map accurately according to the environment’s topology from a few sensors located in an outdoor urban environment. The model is trained to learn and estimate the propagation characteristics of the electromagnetic field according to the topology of a given environment. In addition, the conditional Generative Adversarial Network based electromagnetic field mapping is compared with simple kriging. Results show that the proposed method produces accurate estimates and is a promising solution for exposure map reconstruction.

Regulatory T cells (Tregs) are major drivers behind immunosuppressive mechanisms and present a major hurdle for cancer therapy. Tregs are characterized by high expression of CD25, which is a potentially valuable target for Treg depletion to alleviate immune suppression. The preclinical anti-CD25 (αCD25) antibody, clone PC-61, has met with modest anti-tumor activity, due to its capacity to clear Tregs from circulation and lymph nodes but not those that reside in the tumor. Optimization of the Fc domain of this antibody clone has been shown to enhance intratumoral Treg depletion capacity. Here, we generated a stable cell line that produces optimized recombinant Treg depleting antibodies. A genome engineering strategy in which CRISPR-Cas9 was combined with homology directed repair (CRISPR-HDR) was utilized to optimize the Fc domain of the hybridoma PC-61 for effector functions by switching it from the original rat IgG1 to a mouse IgG2a isotype. In a syngeneic tumor mouse model the resulting αCD25-m2a antibody mediated effective depletion of tumor resident Tregs leading to a high effector T cell (Teff) to Treg ratio. Moreover, combination of the αCD25-m2a with αPD-L1 treatment augmented tumor eradication in mice, demonstrating the potential for αCD25 as a cancer immunotherapy.

The enormous increase in the volume of Earth Observations (EOs) has provided the scientific community with unprecedented temporal, spatial, and spectral information. However, this increase in the volume of EOs has not yet resulted in proportional progress with our ability to forecast agricultural systems.This study examines the applicability of EOs obtained from Sentinel2 and Landsat8 for constraining the APSIM-Maize model parameters. We leveraged leaf area index (LAI) retrieved from Sentinel2 and Landsat8 NDVI to constrain a series of APSIM-Maize model parameters in three different Bayesian multi-criteria optimization frameworks across 13 different sites across the U.S Midwest. A time variant sensitivity analysis was performed to identify the most influential parameters driving the LAI estimates in APSIM-Maize model. Then surrogate models were develop using random samples taken from the parameter space using Latin hypercube sampling to emulate APSIM’s behavior in simulating NDVI and LAI at all sites. Site-level, global and hierarchical Bayesian optimization models were then developed using the site-level emulators to simultaneously constrain all parameters and estimate the site to site variability in crop parameters. For within sample predictions, site-level optimization showed the largest predictive uncertainty around LAI and crop yield, whereas the global optimization showed the most constraint predictions for these variables. Lowest RMSE for within sample yield prediction was found for hierarchical optimization scheme (1423 Kg ha−1) while the largest RMSE was found for site-level (1494 Kg ha−1). In out-of-sample predictions within the spatio-temporal extent of the training sites, global optimization showed lower RMSE (1627 Kg ha−1) compared to the hierarchical approach (1822 Kg ha−1) across 90 independent sites in the U.S Midwest. On comparison between these two optimization schemes across another 242 independent sites outside the spatio-temporal extent of the training sites, global optimization also showed substantially lower RMSE (1554 Kg ha−1) as compared to the hierarchical approach (2532 Kg ha−1). Overall, EOs demonstrated their real use case for constraining process-based crop models and showed comparable results to model calibration exercises using only field measurements.

The concept of distributed generation has made photovoltaic an integral source of energy in smart grid systems, especially in peer-to-peer energy trading frameworks that exploit excess power to fulfill the energy requirements of consumers in cost-efficient and eco-friendly manner. It is believed that P2P energy trading will dominate a significant portion of research in forthcoming power generation systems due to the excessive rise of energy demands across the globe. Despite a plethora of studies on energy optimization solutions in P2P trading, minimizing nanogrid energy trading cost and efficient energy sharing between consumers and prosumers are deemed among the challenging problems. This study overcomes essential issues overlooked by the contemporary P2P energy trading models by introducing a predictive optimization-oriented nanogrid energy trading model. The proposed study encompasses two stages: (1) predictive optimization model which harnesses BD-LSTM-based forecasted energy parameters (energy load, energy consumption, and PV generation) that are later incorporated in PSO-enabled objective function to reduce nanogrid trading cost, (2) optimal energy sharing plan is devised to decide the role of nanogrids as prosumers or consumers by emphasizing the use of PV-produced energy. The proposed model is validated on the case study containing nanogrid houses data. The simulation provides detailed experiments by comparing the energy demand and response using the proposed energy sharing model. The outcomes yield that the energy sharing plan holds a significant potential to fulfill maximum energy requirements of nanogrid house in P2P cluster and significantly reduces the energy cost compared to grid.

Water distribution networks are vital infrastructure, needed for providing consumers with sufficient water of appropriate quality. The cost of construction, operation, and maintenance of such networks is extremely large. The problem of optimization of a water distribution network is governed by the type of water distribution network and the size of pipelines placed in the distribution network. This problem of the optimal diameter allocation of pipes in a distribution network has been heavily researched over the past few decades. This study describes the development of a computer program, ‘Smart Optimization Program for Water Distribution Networks’ (SOP–WDN), which applies Genetic Algorithm to the problem of the least-cost design of water distribution networks. SOP–WDN demonstrates the application of an evolutionary optimization technique, Genetic Algorithm, linked with a hydraulic simulation solver EPANET, for the optimal design of water distribution networks. The developed program was applied to three benchmark water distribution network optimization problems and produced consistently good results. SOP–WDN can be utilized as a tool for guiding engineers during the design and rehabilitation of water distribution pipelines.

Innovative practices in irrigation systems can bring improvements in terms of economic efficiency and in the same time can reduce environmental impact. Investment in high tech technologies frequently involves additional costs, but an efficient water management can increase the lifetime of the equipment. The main objective of this article is to reduce the energy consumption by one thousand cubic meters pumped and automatically to increase the economic efficiency of the pumping groups. This paper develops a new operating algorithm that ensures the operation of the pumping group at safe operating intervals and in the same time identifies the equivalent pump operating points for the entire flow range and pumping height of the pumping group. This methodology is based on the principles of an Expert System to perform the optimization process of the energy consumption in pumping groups. The resulting methodology avoids the combinatorial explosion of the solutions to be analyzed and determines the point of maximum efficiency without violation of any of the system constraints under any operating condition. The proposed methodology is tested on an irrigation system that includes a pumping group with 5 pumps, showing its effectiveness in obtaining the optimal solution with a relatively low computational burden.

Applications in high-performance computing (HPC) may not use all available computational resources, leaving some of them underutilized. By co-scheduling, i.e. running more than one application on the same computational node, it is possible to improve resource utilization and overall throughput. Some applications may have conflicting requirements on resources and co-scheduling may cause performance degradation, so it is important to take it into account in scheduling decisions. In this paper, we formalized co-scheduling problem and proposed multiple scheduling strategies to solve it: an optimal strategy, an online strategy and heuristic strategies. These strategies vary in terms of the optimality of the solution they produce and a priori information about the system they require. We showed theoretically that the online strategy provides schedules with a competitive ratio that has a constant upper limit. This allowed us to solve the co-scheduling problem using heuristic strategies that approximate this online strategy. Numerical simulations showed how heuristic strategies compare to the optimal strategy for different input systems. We proposed a method for measuring input parameters of the model in practice and evaluated this method on HPC benchmark applications. We showed high accuracy of measurement method, which allows to apply proposed scheduling strategies in scheduler implementation.

In this paper, we implement a new method binary Particle Swarm Optimization (PSO) for solving the kidney exchange problem, which will improve the future decisions of kidney exchange programs. Because using a kidney exchange, we can help incompatible patient-donor couples to swap donors to receive a compatible kidney. Kidney paired donation programs provide an innovative approach for increasing the number of available kidneys. Further, we implementing binary particle swarm optimization in parallel with MATLAB with one, two, three and four threads and from the computations point of view, the authors compare the performance to reduce the running time for kidney exchange to match patients as fast as possible to help clinicians. Moreover, implementing binary particle swarm optimization in solving the kidney exchange problem is an effective method. The obtained results indicate that binary PSO outperforms other stochastic-based methods such as genetic algorithm, ant lion optimization, and efficient the number of resulting exchanges.

Patch antennas are compact, less complex, planar structures and therefore, widely used in small satellite missions for telecommand, data link, and intersatellite link, particularly in S- band and X- band. Improved performance of these patch antennas in terms of gain and compactness will di-rectly affect the communication efficiency of small satellite missions. Especially the coming IoT (Internet of Things) constellations require high gain and efficient antenna arrays. An optimization of single patch antenna elements is an important cornerstone for the missions. Therefore, the ef-fects of various antenna enhancement techniques, such as slotted ground plane, resistor and ca-pacitor integration, parasitic patch elements, are analyzed. These techniques were applied on a rectangular patch antenna with parameter variation to identify the optimal performances with respect to bandwidth, operating frequency, gain, polarization, and power flow. Finally, the techniques were combined to obtain an optimized antenna in terms of gain and compactness. The results were compared to a slotted reference antenna. For the scenario of a 2.4 GHz patch antenna, a gain optimization of 27 % (from 7.09 to 8.14 dBi) or size reduction of 52 % (from 96.04 to 46.2 cm²) could be achieved. Overall, our study revealed an effective way to increase the patch antenna performance, which can directly contribute to more efficient communication links and design of antenna arrays.

Single cell proteins are the dead dried cells of microorganisms or purified protein isolated from microorganism’s cell culture, used as a food supplement to humans’ food and animals feed. World suffer from malnutrition particularly developing countries, due to rapid increase in population, increased the demand for protein and nutrients requirement. Bacteria is potential microorganism for SCP production due to high protein content, fast generation time, bio-active secondary metabolites production and can grow on various substrates. Actinobacteria species and strain have capability to produce biological active compounds, produced about two-thirds of antibiotics available in the market, actively used as antibiotics, antiprotozoal, antifungal, antiviral, anticancer, anticholesterol, antihelminth and immunosuppressant. Actinomycetes can be used as probiotic as well as single cell protein that will deal with antibiotic as well as protein source.

Feature selection is one of the main data preprocessing steps in machine learning. Its goal is to reduce the number of features by removing extra and noisy features. Feature selection methods must consider the accuracy of classification algorithms while performing feature reduction on a dataset. Meta-heuristic algorithms are the most successful and promising methods for solving this issue. The symbiotic organisms search algorithm is one of the successful meta-heuristic algorithms which is inspired by the interaction of organisms in the nature called Parasitism Commensalism Mutualism. In this paper, three engulfing binary methods based on the symbiotic organisms search algorithm are presented for solving the feature selection problem. In the first and second methods, several S-shaped and V-shaped transfer functions are used for binarizing the symbiotic organisms search algorithm, respectively. These methods are called BSOSS and BSOSV. In the third method, two new operators called BMP and BCP are presented for binarizing the symbiotic organisms search algorithm. This method is called EBSOS. The third approach presents an advanced binary version of the coexistence search algorithm with two new operators, BMP and BCP, to solve the feature selection problem, named EBSOS. The proposed methods are run on 18 standard UCI datasets and compared to base and important meta-heuristic algorithms. The test results show that the EBSOS method has the best performance among the three proposed approaches for binarization of the coexistence search algorithm. Finally, the proposed EBSOS approach was compared to other meta-heuristic methods including the genetic algorithm, binary bat algorithm, binary particle swarm algorithm, binary flower pollination algorithm, binary grey wolf algorithm, binary dragonfly algorithm, and binary chaotic crow search algorithm. The results of different experiments showed that the proposed EBSOS approach has better performance compared to other methods in terms of feature count and accuracy criteria. Furthermore, the proposed EBSOS approach was practically evaluated on spam email detection in particular. The results of this experiment also verified the performance of the proposed EBSOS approach. In addition, the proposed EBSOS approach is particularly combined with the classifiers including SVM, KNN, NB and MLP to evaluate this method performance in the detection of spam emails. The obtained results showed that the proposed EBSOS approach has significantly improved the accuracy and speed of all the classifiers in spam email detection.

Application of solid catalysts synthesized from agricultural wastes provides an environmentally benign and low-cost process route to the synthesis of biodiesel. An ash containing equal mixture of cocoa pod husk, plantain peel and kola nut pod husk ashes (CPK) which was obtained by open combustion of each biomass in air and calcined at 500 oC for 4 h. The calcined CPK ash was characterized to determine its catalytic potential. Two-level transesterification technique was used to synthesize biodiesel using the developed catalyst. The process parameters involved were optimized for the microwave-aided transesterification of a blend of honne, rubber seed and neem oils in volumetric ratio 20:20:60, respectively. The study showed that ash derived from combination of various biomass wastes provides a catalyst which consists all necessary catalytic ingredients in their relative abundance. The calcined CPK consists of 47.67% of potassium, 5.56% calcium and 4.21% magnesium attesting to its heterogenous status. The physisorption isotherms reveals that it was dominantly mesoporous in structure made up of nanoparticles. Maximum of 98.45 wt.% biodiesel was obtained through MeOH:oil blend of 12:1, CPK concentration of 1.158 wt.% and reaction time of 6 min under microwave irradiation. Quality of the synthesized biodiesel satisfied the requirements stipulated by standard specifications. Thus, this work demonstrates that blend of agrowastes and mixture of non-edible oils could be used to synthesize quality and sustainable biodiesel that can replace fossil diesel.

Topology optimization is a pioneering design method that can provide various candidates with high mechanical properties. However, the high-resolution for the optimum structures is highly desired, normally in turn leading to computationally intractable puzzle, especially for the famous Solid Isotropic Material with Penalization (SIMP) method. In this paper, an efficient and high-resolution topology optimization method is proposed based on the Super-Resolution Convolutional Neural Network (SRCNN) technique in the framework of SIMP. The SRCNN includes four processes, i.e. refining, path extraction & representation, non-linear mapping, and reconstruction. The high computational efficiency is achieved by a pooling strategy, which can balance the number of finite element analysis (FEA) and the output mesh in optimization process. To further reduce the high computational cost of 3D topology optimization problems, a combined treatment method using 2D SRCNN is built as another speeding-up strategy. A number of typical examples justify that the high-resolution topology optimization method adopting SRCNN has excellent applicability and high efficiency for 2D and 3D problems with arbitrary boundary conditions, any design domain shape, and varied load.