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.

The article presents a model for optimizing biomass supply chains using the linear programming framework integrated with a Geographic Information System. Based on the distance from a given type of biomass resource, its calorific value, price, and transportation costs, the model identifies the optimal source of biomass, allowing it to cover the demand for the required total energy value with the lowest possible costs. The case study includes the Połaniec power plant in southeastern Poland and potential sources of forest biomass and agricultural straw within 100 km of the plant. Unit costs of biomass varied depending on biomass availability and energy demands. For energy demand on the level of 1 PJ yearly, the lowest unit costs of biomass (4.08 €/MJ) were when all kinds of biomass were available, and the highest (5.47 €/MJ) was when only stacked wood was available. As energy demand increased, unit costs increased, and the ability to meet this demand with just one type of biomass decreased. The energy biomass sector can utilize the model to benefit both biomass producers and their final buyers.

This study focuses on the optimal deployment problem, and determines the optimal size of a military force to send to the battle field. The decision is optimized, based on an objective function, that considers the cost of deployment, the cost of the time it takes to win the battle, and the costs of killed and wounded soldiers with equipment. The cost of deployment is modeled as an explicit function of the number of deployed troops and the value of a victory with access to a free territory, is modeled as a function of the length of the time it takes to win the battle. The cost of lost troops and equipment, is a function of the size of the reduction of these lives and resources. An objective function, based on these values and costs, is optimized, under different parameter assumptions. The battle dynamics is modeled via the Lanchester differential equation system based on the principles of directed fire. First, the deterministic problem is solved analytically, via derivations and comparative statics analysis. General mathematical results are reported, including the directions of changes of the optimal deployment decisions, under the influence of alternative types of parameter changes. Then, the first order optimum condition from the analytical model, in combination with numerically specified parameter values, is used to determine optimal values of the levels of deployment in different situations. A concrete numerical case, based on documented facts from the Battle of Iwo Jima, during WW II, is analyzed, and the optimal US deployment decisions are determined under different assumptions. The known attrition coefficients of both armies, from USA and Japan, and the initial size of the Japanese force, are parameters. The analysis is also based on some parameters without empirical documentation, that are necessary to include to make optimization possible. These parameter values are motivated in the text. The optimal solutions are found via Newton- Raphson iteration. Finally, a stochastic version of the optimal deployment problem is defined. The attrition parameters are considered as stochastic, before the deployment decisions have been made. The attrition parameters of the two armies have the same expected values as in the deterministic analysis, are independent of each other, have correlation zero, and have relative standard deviations of 20%. All possible deployment decisions, with 5000 units intervals, from 0 to 150000 troops, are investigated, and the optimal decisions are selected. The analytical, and the two numerical, methods, all show that the optimal deployment level is a decreasing function of the marginal deployment cost, an increasing function of the marginal cost of the time to win the battle, an increasing function of the marginal cost of killed and wounded soldiers and lost equipment, an increasing function of the initial size of the opposing army, an increasing function of the efficiency of the soldiers in the opposing army and a decreasing function of the efficiency of the soldiers in the deployed army. With stochastic attrition parameters, the stochastic model also shows that the probability to win the battle is an increasing function of the size of the deployed army. When the optimal deployment level is selected, the probability of a victory is usually less than 100%, since it would be too expensive to guarantee a victory with 100% probability. Some of many results of relevance to the Battle of Iwo Jima, are the following: In the deterministic Case 0 analysis, the optimal US deployment level is 66200, the time to win the battle is 30 days and 14000 US soldiers are killed or wounded. If the marginal cost of the time it takes to win a victory doubles, the optimal deployment increases to 75400, the time to win a victory is reduced to 26 days, and less than 12000 soldiers are killed or wounded. In the stochastic Case 0 analysis, the optimal US deployment level is 65000, the expected time to win the battle is 46 days and almost 25000 US soldiers are expected to be killed or wounded. If the cost per killed or wounded soldier increases from 0 to 5 M $US, the optimal deployment level increases to 75000. Then, the victory is expected to appear after 35 days and 19900 US soldiers are expected to be killed or wounded.

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.

Sustainable continuous cover forestry is defined and analyzed in several ways. The differential equation representing growth of the basal areas of individual trees, motivated by fundamental biological production theory by Lohmander (2017a), is analyzed and extended in different directions. From the solution of the differential equation, the basal area and the tree diameter are obtained as explicit functions of time. The diameter is a strictly increasing function of time. In the absence of competitors, the diameter increment is shown to be a strictly decreasing function of time. Hence, the diameter increment can also be interpreted as a strictly decreasing function of the diameter. Alternative forms of adjustment of the differential equation, with consideration of competition, are defined. If the competition is strong, with large trees in the vicinity of a particular tree, then the basal area increment, and the diameter increment, are reduced. The growth of a large tree is less sensitive than the growth of a small tree, to competition from other trees. Under strong competition, the basal area increment, and the diameter increment, are strictly concave functions of the size of the tree. The unique maximum of the diameter increment occurs at a higher diameter, if the competition increases. In dynamic equilibrium, the tree size frequency distribution is stationary. If natural tree mortality can be avoided via the harvest strategy, the tree size frequency distribution is a function of the size and competition dependent growth function, and the harvest strategy. Empirical tree size frequency data are used to simultaneously estimate parameters of a size and competition dependent growth function and the applied harvest strategy, via nonlinear optimization. The properties of the estimated growth function are consistent with the corresponding properties of the production theoretically motivated hypothetical function, and the properties of the estimated harvest strategy confirm the corresponding hypotheses. The R2 of the nonlinear regression exceeds 0.97. With access to an empirically estimated equilibrium tree size distribution, it is possible to: 1. Estimate size frequency relevant parameters of tree size and competition dependent growth functions for individual trees. 2. Estimate the applied harvest strategy. 3. Explain and reproduce the empirically estimated tree size equilibrium distribution.

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

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.

Currently, software development is more associated with families of configurable software rather than the single implementation of a product. Due to the numerous possible combinations in a software product line, testing these families of software product lines (SPLs) is a difficult undertaking (SPL). Moreover, the presence of optional features makes the testing of SPLs impractical. Several features are presented in SPLs, but due to the environment's time and financial constraints, these features are rendered unfeasible. Testing subsets of configured products is thus one approach to solving this issue. In order to reduce testing effort and get better results, alternative methods of testing SPLs are required, such as the combinatorial interaction testing (CIT) technique. Unfortunately CIT method produces unscalable solutions for large size SPLs with excessive constraints. The CIT method costs more because of feature combinations. The optimization of the various conflicting testing objectives, such as reducing the cost and configuration number, have also been considered. In this article, we have proposed a search-based software engineering solution using multi-objective optimization algorithms (MOEAs). In particular, the research is applied to different types of MOEA methods; Indicator-Based Evolutionary Algorithm (IBEA), Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D), Non-Dominated Sorting Genetic Algorithm II (NSGAII), NSGAIII, and Strength Pareto Evolutionary Algorithm 2 (SPEA2). The results of the algorithms are examined in the context of distinct objectives and two quality indicators. The results revealed how feature model attributes, implementation context and the number of objectives affect the performance of the algorithms.

The optimal structural design is imperative to minimize material consumption and reduce the environmental impact of construction. Given the complexity in the formulation of structural design problems, the process of optimization is commonly performed using artificial intelligence (AI) global optimization, such as Genetic Algorithm (GA). However, the integration of AI-based optimization together with visual programming (VP) in building information modeling (BIM) projects warrants further investigation. This study proposes a workflow by combining structure analysis, VP, BIM, and GA to optimize trusses. The methodology encompasses several steps including: (i) generation of parametric trusses in Dynamo VP; (ii) performing the finite element modeling (FEM) using Robot Structural Analysis (RSA); (iii) retrieving and evaluating the FEM results interchangeably between Dynamo and RSA; (iv) finding the best solution using GA; and (v) importing the optimized model into Revit, enabling the user to perform simulations and engineering analysis, such as life cycle assessment (LCA) and quantity surveying. The feasibility of the proposed workflow was tested on benchmark problems and compared with open literature. The outcomes of this study offer insight into the opportunities and limitations of combining VP, GA, FEA, and BIM for structural optimization applications, particularly to enhance structural efficiency and sustainability in construction.

This paper explores the application of various machine learning techniques for predicting customer churn in the telecommunications sector. We utilized a publicly accessible dataset and implemented several models, including Artificial Neural Networks, Decision Trees, Support Vector Machines, Random Forests, Logistic Regression, and gradient boosting techniques (XGBoost, LightGBM, and CatBoost). To mitigate the challenges posed by imbalanced datasets, we adopted different data sampling strategies, namely SMOTE, SMOTE combined with Tomek Links, and SMOTE combined with Edited Nearest Neighbors. Moreover, hyperparameter tuning was employed to enhance model performance. Our evaluation employed standard metrics such as Precision, Recall, F1-Score, and the Receiver Operating Characteristic Area Under Curve (ROC AUC). Regarding the F1-Score metric, CatBoost demonstrates superior performance compared to other machine learning models, achieving an outstanding 93% following the application of Optuna hyperparameter optimization. In the context of the ROC AUC metric, both XGBoost and CatBoost exhibit exceptional performance, recording remarkable scores of 91%. This achievement for XGBoost is attained after implementing a combination of SMOTE with Tomek Links, while CatBoost reaches this level of performance after the application of Optuna hyperparameter optimization.

The economical load dispatch problem is a critical concern in thermal power systems to ensure cost-effective operation. This paper conducts a comparative analysis between the Social Spider Algorithm (SSA) and Particle Swarm Optimization (PSO) for economical load dispatch in a 6-unit thermal power system with the integration of 11,000 plug-in electric vehicles (PEVs). Both SSA and PSO are population-based optimization techniques designed to minimize the overall fuel cost while satisfying the load demand by determining the optimal power output of each unit. SSA emulates the social behavior of spiders, while PSO simulates the collective intelligence of a swarm of particles. Performance evaluation of the algorithms considers power system data, such as unit fuel costs, minimum and maximum loads, and total load demand. The objective is to minimize fuel cost while meeting the load demand. Comparative analysis of SSA and PSO includes convergence speed, solution quality, and computational efficiency. Experimental results indicate that SSA outperforms PSO in achieving a more optimal and economical load dispatch solution for the 6-unit thermal power system. SSA demonstrates faster convergence and provides superior-quality solutions compared to PSO. This paper contributes to the field by highlighting SSA's effectiveness in achieving cost-efficient operation of thermal power systems. The findings suggest that SSA holds promise as an optimization technique for similar power system optimization problems, enhancing overall operational efficiency and reducing costs for thermal power plants.

Reliable quantification of pulmonary arterial pressure is essential in the diagnostic and prognostic assessment of a range of cardiovascular pathologies including rheumatic heart disease, yet an accurate and routinely available method for its quantification remains elusive. This work proposes an approach to infer pulmonary arterial pressure based on scientific machine learning techniques and non-invasive, clinically available measurements. A 0-D multicompartment model of the cardiovascular system was optimized using several optimization algorithms, subject to forward-mode automatic differentiation. Measurement data were synthesized from known parameters to represent the healthy, mitral regurgitant, aortic stenosed and combined valvular disease situations with and without pulmonary hypertension. Eleven model parameters were selected for optimization based on 95 % explained variation in mean pulmonary arterial pressure. A hybrid Adam and limited-memory Broyden-Fletcher-Goldfarb-Shanno optimizer yielded the best results with input data including valvular flow rates, heart chamber volume changes and systematic arterial pressure. Mean absolute percentage errors ranged from 1.8 % to 3.78 % over the simulated test cases. The model was able to capture pressure dynamics under hypertensive conditions with pulmonary arterial systole, diastole, and mean pressure average percentage errors of 1.12 %, 2.49 % and 2.14 %, respectively. The relatively low errors highlight the potential of the proposed model to recover pulmonary pressures for diseased heart valve and pulmonary hypertensive conditions.

Early detection of cancer increases the probability of recovery. This paper presents an intelligent decision support system (IDSS) for the early diagnosis of cancer based on gene expression profiles collected using DNA microarrays. Such datasets pose a challenge because of the small number of samples (no more than a few hundred) relative to the large number of genes (on the order of thousands). Therefore, a method of reducing the number of features (genes) that are not relevant to the disease of interest is necessary to avoid overfitting. The proposed methodology uses the information gain (IG) to select the most important features from the input patterns. Then, the selected features (genes) are reduced by applying the grey wolf optimization (GWO) algorithm. Finally, the methodology employs a support vector machine (SVM) classifier for cancer type classification. The proposed methodology was applied to two datasets (Breast and Colon) and was evaluated based on its classification accuracy, which is the most important performance measure in disease diagnosis. The experimental results indicate that the proposed methodology is able to enhance the stability of the classification accuracy as well as the feature selection

Intersections within urban centers do not allow all citizens to move in a fluid manner. In this sense, this paper proposes a queuing network model based on Kendall's notation for the intersection of two urban streets (East 53rd Street and East 56th Street) in Panama City. A set of traffic lights operating under a fixed time scheme controls the vehicular flow at the intersection. The objective is to optimize the vehicular flow at the intersection by minimizing the waiting time of the vehicles using mathematical models, Linear Regressor Model, and simulations performed in MATLAB evaluating the waiting time experienced by the vehicles. Based on the results obtained, the optimal signal timing of the traffic lights is determined to minimize the waiting time for both streets.

Microgrids (MGs) have evolved as critical components of modern energy distribution networks, providing increased dependability, efficiency, and sustainability. Effective control strategies are essential for optimising MG operation and maintaining stability in the face of changing environmental and load conditions. Traditional rule-based control systems are extensively used due to their interpretability and simplicity. However, these strategies frequently lack the flexibility for complex and changing system dynamics. This paper provides a novel method called hybrid intelligent control for adaptive MG that integrates basic rule-based-control and deep learning techniques, including gated recurrent units (GRU), basic recurrent neural network (RNN) and long short-term memory (LSTM). The main target of this hybrid approach is to improve MG management performance by combining the strengths of basic rule-based systems and deep learning techniques. These deep learning techniques readily enhance and adapt control decisions based on historical data and domain-specific rules, leading to increasing system efficiency, stability, and resilience in adaptive MG. Our results show that the proposed method optimises MG operation, especially under demanding conditions such as variable renewable energy supply and unanticipated load fluctuations. This study investigates special RNN architectures and hyper-parameter optimization techniques with the aim of predicting power consumption and generation within the adaptive MG system. Our promising results show the highest-performing models indicating high accuracy and efficiency in power prediction. The finest-performing model accomplishes an R2 value close to 1, representing a strong correlation between predicted and actual power values.

Diabetes is a serious health problem throughout the world, including in Indonesia. The International Diabetes Federation (IDF) reports that the number of adults with diabetes is increasing every year. The Behavioral Risk Factor Surveillance System (BRFSS) is a survey conducted by the Centers for Disease Control and Prevention (CDC) in the United States. Classification methods in data mining techniques are used to classify diabetics and non-diabetics. The data mining process is carried out by preprocessing, feature selection, and dataset classification stages. In the preprocessing stage, data cleaning, data formatting, and data oversampling are carried out using the Synthetic Minority Over-sampling Technique (SMOTE). Next, the feature selection stage is carried out using the Particle Swarm Optimization (PSO) algorithm to find the best attributes. The dataset classification stage is carried out using the CART Model Decision Tree algorithm. The results of the performance evaluation of the CART algorithm are calculated using the confusion matrix and the MAE value, the results obtained for the CART algorithm without SMOTE and PSO obtained the best accuracy of 75.34% and the MAE value of 0.2466, while the CART algorithm using SMOTE and PSO can increase accuracy by 10 .94% to 86.28% and an MAE value of 0.1372.

Today, Colebrook’s equation is mostly accepted as an informal standard for modeling of turbulent flow in hydraulically smooth and rough pipes including transient zone in between. The empirical Colebrook’s equation relates the unknown flow friction factor (λ) with the known Reynolds number (R) and the known relative roughness of inner pipe surface (ε/D). It is implicit in unknown friction factor (λ). Implicit Colebrook’s equation cannot be rearranged to derive friction factor (λ) directly and therefore it can be solved only iteratively [λ=f(λ, R, ε/D)] or using its explicit approximations [λ≈f(R, ε/D)]. Of course, approximations carry in certain error compared with the iterative solution where the highest level of accuracy can be reached after enough number of iterations. The explicit approximations give a relatively good prediction of the friction factor (λ) and can reproduce accurately Colebrook’s equation and its Moody’s plot. Usually, more complex models of approximations are more accurate and vice versa. In this paper, numerical values of parameters in various existing approximations are changed (optimized) using genetic algorithms to reduce maximal relative error. After this improvement computational burden stays unchanged while accuracy of approximations increases in some of the cases very significantly.

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.

Background: The aim of the present investigation was to evaluate the clinical success of horizontal ridge augmentation in the severely atrophic maxilla (Cawood and Howell class IV) using freeze-dried custom made bone harvested from cadaver donors tibial hemiplateau and to analyze the marginal bone level gain prior dental implants placement at 9 months after bone grafting and before prosthetic rehabilitation. Methods: A 52-year-old woman received custom made bone grafts. Patient underwent CT scans 2 weeks prior and 9 months after surgery for graft volume and density analysis. Results: The clinical and radiographic bone observations showed a very low rate of resorption after bone graft and implant placement. Conclusions: The custom-made allograft material was a highly effective modality for restoring the alveolar horizontal ridge, resulting in this way to reduce the need to obtain autogenous bone from a secondary site with predictable procedure. Further studies are needed to investigate its behavior at longer time points.

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.

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

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.

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.

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.

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.

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

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.

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.

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

The 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.

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.

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.

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

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

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

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.

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.

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.

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.

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.

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.

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

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.

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.

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

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

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

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

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.

This paper undertakes an in-depth exploration of a primary strategy aimed at mitigating the volumetric risk in wind power generation within Greece, which originates from the variability of wind speeds. The proposed strategy hinges on portfolio theory, serving as the foundation for creating diverse generation portfolios, thus facilitating the strategic distribution of available capacity across space. Optimization techniques and quadratic programming are harnessed to derive the minimum variance portfolio along with alternative optimal allocation plans. In parallel, Factor Analysis techniques are deployed to discern prevalent sources of variability that exert influence on wind generation dynamics within Greece. Our assessment encompasses an appraisal of the diversification efficacy inherent in an array of distinct portfolios. This analysis is conducted through the application of Principal Component Analysis (PCA) techniques. Furthermore, we expound upon key spatiotemporal attributes characterizing the Greek landscape, elucidating their potential contributions to the site-selection process.

In this work a new method is proposed to tackle down the multiple objective optimization problem of the calculation of cation distribution in spinels structure, through the difference of intensity ratios between experimental and calculated intensities of cation sensitive Bragg planes, by introducing a new factor, Rabs, in Bertaut method. This factor is introduced as the sum of absolute R factors, and it is minimized by varying cation distribution. To test this method aluminate manganese spinel where synthesized though modified Pechini method and characterized though XRD. The results show to be in agreement with literature for the aluminum inversion in tetrahedral sites, which is near to the reported value of 10%. Also, it was noticed that the manganese atoms are present in octahedral sites with a mixed valence state of +2 and +3. Which might be an indicator that oxygen vacancies are present in the structure, so the vacancies value of oxygen is proposed considering the total charge of cations and thus proposing the value of 3.678 mol per formula unit of the spinel, thus having the next stoichiometry considering normalized Al and Mn, MnAl2O3.678. Finally, the last cation distribution proposed was [Mn0.867^(+2) Al0.129^(+3) ][Mn0.034^(+2) Mn0.098^(+3) Al1.871^(+3) ] O3.678 with a Rabs factor value of 0.6466, which considers the cation distribution and oxygen vacancies.

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.

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.

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.

In this work we study the energy consumption by various modern secured hash functions (MD2, MD5, SHA-1, and SHA-2) and modern symmetric key encryption protocols (Blowfish, DES, 3DES, and AES) from the algorithmic perspective. We identify various parameters that moderate energy consumption of these hashes and protocols. Our work is directed towards redesigning or modifying these algorithms to make them consume lesser energy. As a first step, we try to determine the applicability of the asymptotic energy complexity model by Roy et. al. on these hashes and protocols. Specifically, we try to observe whether parallelizing the access of blocks of data in these algorithms reduces their energy consumption based on the energy model. Our results confirm the applicability of the energy model on these hashes and protocols. Our work is motivated by the relevance and importance of cryptographic hashes and symmetric key protocols for modern ICT (Information and Communication Technology), and ICT enabled industry to keep them protected from dynamically changing threat scenarios. Hence the design of more energy efficient hashes and protocols will definitely contribute in reducing the ICT energy consumption that is continuously increasing.

Ant Colony Optimization (ACO) is a stochastic optimization algorithm inspired by the foraging behavior of ants. We investigate a simplified computational model of ACO, wherein ants sequentially engage in binary decision-making tasks, leaving pheromone trails contingent upon their choices. The quantity of pheromone left is the number of correct answers. We scrutinize the impact of a salient parameter in the ACO algorithm, specifically, the exponent $\alpha$ that governs the pheromone levels in the stochastic choice function. In the absence of pheromone evaporation, the system is accurately modeled as a multivariate nonlinear P\'{o}lya urn, undergoing a phase transition as $\alpha$ varies. The probability of selecting the correct answer for each question asymptotically approaches the stable fixed point of the nonlinear P\'{o}lya urn. The system exhibits dual stable fixed points for $\alpha\ge \alpha_c$ and a singular stable fixed point for $\alpha<\alpha_c$. When pheromone evaporates over a time scale $\tau$, the phase transition does not occur and leads to a bimodal stationary distribution of probabilities for $\alpha\ge \alpha_c$ and a monomodal distribution for $\alpha<\alpha_c$.

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.

Dump design and scheduling are critical elements to effective mine planning, especially if several of them are required in large-scale open pit mines. Infrastructure capital and transportation costs are considerable from an early stage in the mining project, and through the life-of-mine as these dumps gradually become immense structures. Delivered mining rates, as well as certain spatial and physical constraints, provide a set of parameters of mathematical and economic relationship that creates opportunities for modelling and thus facilitates the measuring and optimization of ultimate dump design by using programming and empirical techniques while achieving economic objectives. This paper presents a methodology to model and optimize the design of a mine dump by minimizing the total haulage costs. The proposed methodology consists on: (i) Formulation of a dump model based on a system of equations relying on multiple relevant parameters; (ii) Solves by minimizing the total cost using linear programming and determines a ‘preliminary’ dump design; (iii) Through a series of iterations, modifies the ‘preliminary’ footprint by projecting it to the topography and creates the ultimate dump design. Finally, an example application for a waste rock dump illustrates this methodology.

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.

Forming a clustered network structure has been proposed as a solution to increase network performance, scalability, stability and manageability in an ad hoc network. A good clustering algorithm aims to select cluster heads among available nodes so that a number of specific constraints are satisfied; thus the cluster head selection problem is a multiobjective optimization problem. This paper proposes an algorithm on the basis of ant colony optimization (ACO) to be used to solve this problem. The proposed algorithm is a simple, one hop cluster formation algorithm, to form a clustered structure with the minimum number of clusters. The centralized ACO-based clustering algorithm is evaluated and compared with other clustering algorithms in ad hoc networks in terms of cluster density.

Kelly's Criterion is well known among gamblers and investors as a method for maximizing the returns one would expect to observe over long periods of betting or investing. These ideas are conspicuously absent from portfolio optimization problems in the financial and automation literature. This paper will show how Kelly's Criterion can be incorporated into standard portfolio optimization models. The model developed here combines risk and return into a single objective function by incorporating a risk parameter. This model is then solved for a portfolio of 10 stocks from a major stock exchange using a differential evolution algorithm. Monte Carlo calculations are used to verify the accuracy of the results obtained from differential evolution. The results show that evolutionary algorithms can be successfully applied to solve a portfolio optimization problem where returns are calculated by applying Kelly's Criterion to each of the assets in the portfolio.

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.

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

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.

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.

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.

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.

This paper introduces a surrogate model to reduce the huge computational load in the process of simulation-optimization and uncertainty analysis. First, the groundwater numerical simulation model was established, calibrated and verified in the northeast of Hetao Plain. Second, two surrogate models of simulation model were established using support vector regression (SVR) method, one (surrogate model A, SMA) was used to describe the corresponding relationship between the pumping rate and average groundwater table drawdown, and another (surrogate model B, SMB) was used to express the corresponding relationship between the hydrogeological parameter values and average groundwater table drawdown. Third, an optimization model was established to search an optimal groundwater exploitation scheme using the maximum total pumping rate as objective function and the limitative average groundwater table drawdown as constraint condition, the SMA was invoked by the optimization model for obtaining the optimal groundwater exploitation scheme. Finally, the SMB was invoked in the process of uncertainty analysis for assessing the reliability of optimal groundwater exploitation scheme. Results show that the relative error and root mean square error between simulation model and the two surrogate models are both less than 5%, which is a high approximation accuracy. The SVR surrogate model developed in this study could not only considerably reduce the computational load, but also maintain high computational accuracy. The optimal total pumping rate is 7947 m3/d and the reliability of optimal scheme is 40.21%. This can thus provide an effective method for identifying an optimal groundwater exploitation scheme and assessing the reliability of scheme quickly and accurately.

In this paper, a multi-patch weakly singular isogeometric boundary element method (WSIGABEM) for two-dimensional elastostatics is proposed. Since the method based on the weakly singular boundary integral equation, the quadrature techniques, dedicated for the weakly singular and regular integrals, are applied in the method. A new formula for the generation of collocation points is suggested to take the full advantage of the multi-patch technique. The generated collo-cation points are essentially inside the patches without any correction. If the boundary conditions are assumed to be continuous in every patch, no collocation point lies on the discontinuous boundaries, thus simplifying the implementation. The multi-patch WSIGABEM is verified by the simple examples with analytical solutions. The feature of the present multi-patch WSIGABEM is investigated by the comparison with the traditional IGABEM. Furthermore, the combination of the present multi-patch WSIGABEM and the particle swarm optimization algorithm results in a shape optimization method in two-dimensional elastostatics. By changing some specific control points and their weights, the shape optimizations of the fillet corner, the spanner and the arch bridge are verified to be effective.

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

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

Purpose of review The forest industry has deployed ICTs to improve productivity of forest supply chains. In this sense, digitalization of data flows significantly impacts wood supply chains, from forest to mills, which must react flexibly to market fluctuations of forest products. The goal of this study was to conduct a literature review on data flow implementations in management systems of wood supply chains and to evaluate their applicability in supply chains to analyze the opportunities for improving them in practice. Recent findings We utilized the ScienceDirect database, Scopus and Web of Science in order to document data flows in systems and actual applications. Due to ongoing outsourcing, the wood procurement chains, and the wood supply chains were identified in the forest industry. Several different technologies can be implemented also in wood supply chains to digitalize the data flow depending on the specific needs of organizations. In this regard, digitalization of Big Data causes significant changes in elements of supply models that should be integrated and standardized in the optimization and simulation systems. Summary A modelling guide is suggested for accurate dynamic solution of problems of forest logistics. Then, the opportunities in digitalization for connecting different data flows, technologies, and stakeholders are discussed thoroughly. We conclude that data-driven dynamic optimization, and locally implemented digitalization contributes to wood supply modeling in the establishment of standards for cloud-based platforms at time-related and sequential measures which will ensure successful forest logistics through the planning and the monitoring of wood supply chains.

Recently, 3D printing techniques gained much attention in solid dosage form production. Even though the methods are increasingly studied, there are still many challenges in establishing an accurate content of active ingredients in the final products. In the present study, new experimental design techniques and statistical software were developed to identify and optimize a formula to predict the mass of the tablet to be 3D printed before it actually is. The first step was to develop a virtual 3D object in the FreeCad Software, then, using a CURA slicer software, the G-code Format was obtained. The tablets were printed using a Cartesian 3D printer based on the generated data. Finally, adapting the object sequencing mode, a predicted drug mass value was obtained. As expected, the oblong tablet's scaling directly influences its mass. The software generates a correlation coefficient (r) of 0.84, confirming the directly proportional relationship between scaling and tablet weight. However, the r values progressively decreased, indicating a poor correlation between tablet weight and other factors: infill density percent (r = 0.403) and wall thickness (r = 0.185). After repeating the 3D printing with the values ​​suggested by the software, tablets with a practical value of 1066 mg were obtained. Considering that the confidence interval calculated is [834.95—1165.05] and the experimental value is 1066 mg, it can be certified that the proposed model is valid.

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.

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.

The conventional well placement was done manually by using a numerical reservoir simulator, and it required a lengthy trial-and-error process. It required great experience and expertise to manipulate the variables and uncertainties that lie on the reservoir to determine the best placement of the well. In addition, the traditional gradient-based methods such as Line-search and Trust-region were not viable in terms of maximum results obtained. Gradient-based methods were too dependent on the surface gradient of the solution and may only converge to local optima instead of global optima. Complex reservoirs have rough surfaces with high uncertainties, which hinders the traditional gradient-based method from converging to global optima. Thus, genetic algorithms were utilized to automate the manual trial-and-error process and to overcome the limitations of the traditional gradient-based method. The objectives of this study were to analyse the effect of different initial well placement distributions, the number of random solution sizes, and the crossover rate on cumulative oil production. A synthetic reservoir model built using CMG Builder was used as the testing platform for the optimization problems. Well-placement parameterization and optimization set-up were carried out using the CMG CMOST optimization tool. The integration of CMG IMEX and CMOST optimized cumulative oil production based on the objectives of the study. The results obtained showed that the higher number of random solutions used resulted in higher cumulative oil production, with more generations needed to reach the optimum solution. It can be concluded that the larger number of random solutions used increased the probability of reaching the optimum solution, but will take more generations.

The paper presents models of path and control planning for parking, docking, and movement of autonomous vehicles at low speeds considering space constraints. Given the low speed of motion, and in order to test and approve the proposed algorithms, vehicle kinematic models are used. Recent works on the development of parking algorithms for autonomous vehicles are reviewed. Bicycle kinematic models for vehicle motion are considered for three basic types of vehicles: passenger car, long wheelbase truck, and articulated vehicles with and without steered semitrailer axes. Mathematical descriptions of systems of differential equations in matrix form and expressions for determining the linearization elements of nonlinear motion equations that increase the speed of finding the optimal solution are presented. Options are proposed for describing the interaction of vehicle overall dimensions with the space boundaries, within which a maneuver should be performed. An original algorithm that considers numerous constraints is developed for determining vehicle permissible positions within the closed boundaries of the parking area, which are directly used in the iterative process of searching for the optimal plan solution using nonlinear model predictive control (NMPC). The process of using NMPC to find the best trajectories and control laws while moving in a semi-limited space of constant curvature (turnabouts, roundabouts) are described. Simulation tests were used to validate the proposed models for both constrained and unconstrained conditions and the output (state-space) and control parameters' dependencies are shown. The proposed models represent an initial effort to model the movement of autonomous vehicles for parking and has the potential for other highway applications.

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.

In recent years, integration of electric vehicles (EVs) has increased dramatically due to their lower carbon emissions and reduced fossil fuel dependency. However, charging EVs could have significant impacts on the electrical grid. One promising method for mitigating these impacts is the use of renewable energy systems. Renewable energy systems can also be useful for charging EVs where there is no local grid. This paper proposes a new strategy for designing a renewable energy charging station consisting of wind turbines, a photovoltaic system, and an energy storage system to avoid the use of diesel generators in remote communities. The objective function is considered to be the minimization of the total net present cost, including energy production, components setup, and financial viability. The proposed approach, using stochastic modeling, can also guarantee profitable operation of EVs and reasonable effects on renewable energy sizing, narrowing the gap between real-life daily operation patterns and the design stage. The proposed strategy should enhance the efficiency of conventional EV charging stations. The key point of this study is the efficient use of excess electricity. The infrastructure of the charging station is optimized and modeled.

Wireless sensor networks are attractive largely because they need no wired infrastructure. But precisely this feature makes them energy constrained. Recent studies find that sensing behaviors that are otherwise deemed efficient consume comparable energy with communication. The duty cycle scheduling is perceived as contributing to achieving energy efficiency of sensing. Because of different research assumptions and objectives, various scheduling schemes have various emphases. This paper designed an adaptive sensing scheduling strategy. The objective function of the scheduling strategy includes minimizing average energy expenditure and maximizing sensing coverage (reducing event miss-rate), and it requires relatively loose assumptions. We determine the functional relationship between the variables of the objective function and the step-size parameters of the proposed strategy through the numerical fitting. We found that the objective function aggregated by the fitting functions is a bivariate multi-peak function that favors the Fibonacci tree optimization algorithm. Once the optimization of parameters is done, the strategy can be easily deployed and behaves consistently in the coming hours. We name the proposed strategy as “FTOS”. The experimental results show that the Fibonacci tree optimization algorithm gets a better optimistic effect than the comprehensive learning particle swarm optimization (CLPSO) algorithm and differential evolution (DE) algorithm. The FTOS strategy is superior to the fixed time scheduling strategy in achieving the scheduling objectives. It also outperforms other strategies with the same scheduling objectives such as LDAS, BS, DSS and PECAS.

Liver radioembolization is a treatment option for unresectable liver cancers, performed by infusion of 90Y or 166Ho loaded spheres in the hepatic artery. As tumoral cells are mainly perfused via the liver artery unlike hepatic lobules, a twofold tumor to normal liver dose ratio is commonly obtained. To improve tumoral cells killing while preserving lobules, co-infusion of arterial vasoconstrictor has been proposed but with limited success: the hepatic arterial buffer response (HABR) and hepatic vascular escape mechanism hamper the arterioles vasoconstriction. The proposed project aims to take benefit of the HABR by co-infusing a mesenteric arterial vasodilator: the portal flow enhancement inducing the vasoconstriction of the intra sinusoids arterioles barely impacting liver tumors that are mainly fed by novel and anarchic external arterioles. Animal studies were reviewed and dopexamine was identified as a promising safe candidate reducing by 4 the hepatic lobules arterial flow. A clinical trial design is proposed. A four to sixfold improvement of the tumoral to normal tissue dose ratio is expected, pushing the therapy towards a real curative intention, especially in HCC where ultra-selective spheres delivery is often not possible.

Full-waveform seismic data inversion has given rise to hope for the simultaneous and automated execution of tomography and imaging by solving a nonlinear least-squares optimization problem. As previously recognized, brute force minimization by classical methods is hopeless if the data lacks low temporal frequencies. The article developed a reliable numerical method for recovering smooth velocity using model space decomposition. We present realistic synthetic examples to test the presented algorithm.

Slime Mould Algorithm (SMA) is a new swarm intelligence algorithm inspired by the oscillatory behavior of slime molds during foraging. Numerous researchers have widely applied SMA and its variants in various domains and proved its value by the experiments in literatures. In this paper a comprehensive survey on SMA is introduced, which is based on 130 articles visa Google-scholar between 2022 and July, 2023. Firstly, the theory of SMA is described. Secondly the improved SMA variants are provided and categorized according to the approach that they are applied with. Finally, it also discusses the main applications domains of SMA such as engineering optimization, energy optimization, machine learning, network, scheduling optimization, image segmentation and etc. This review presents some research suggestion for researcher who is interested in this algorithm.

In the era of Industry 4.0, the focus on optimizing manufacturing processes is crucial. This study provides a comprehensive analysis of the EnPAS system, a proprietary automated control and monitoring tool developed by KAD3, implemented in the production process of Corten steel furnishings - the "Lila" chair and "Line" planter. Designed to enhance operational efficiency, EnPAS facilitates improved workflow by streamlining production stages and reducing downtime. The research design involves a comparative analysis of the workshop's production process, both before and after the implementation of the EnPAS system. Elements such as de-greasing, oxidation, and finishing stages, among others, were examined. The implementation of the EnPAS system led to a significant reduction in the total production time for both products. Further, there was a substantial decrease in waiting time and setup time. These findings unequivocally indicate the transformative impact of the EnPAS system on the manufacturing process, showcasing its potential in driving efficiency improvements, reducing production times, and increasing output. The study underscores the importance of leveraging such advanced control and monitoring tools to optimize modern manufacturing processes and does not exaggerate conclusions not backed by the research.

The availability of rail infrastructure resources is a major driver of rail operations performance. To evaluate the impact of infrastructure provision, network simulation models can be used to accurately represent train traffic behavior in a wide range of scenarios. However, performing this task can result in a problem of high combinatorial nature as the number of factors and their associated levels increase. This requires more sophisticated techniques such as experimental design formulations or optimization modeling in order to yield satisfactory results. Yet the research in network simulation models for rail systems has hitherto been limited to simple what-if analysis, made up from few factors that cannot represent the whole spectrum of interventions. This is especially critical in closed-loop rail systems where trains are subject to various interferences. Local improvements can be misleading as the queues are merely transferred within the network. Considering this, we propose a hybrid simulation-optimization model to aid the strategic decision of minimizing supplementary capital costs in a heavy-haul Brazilian railroad under construction. As soon as the railroad is completed, investments in both loading and unloading rail terminals will be necessary. First, we developed a representative and flexible model capable of dealing with complex relations between variable infrastructure provision and the resulting operational performance. Then, we simulated this system to prove that the current set of proposed infrastructure resources cannot meet the transportation demands. Afterwards, we demonstrate that local improvements can be delusive as the queues are shifted from loading to unloading operations, reciprocally. Then, we solve an optimization model to define the minimal supplementary investment in order to meet the commercial goals of mining companies. This is done by choosing the best trackage configuration, equipment quantity and capacity and fleet sizing in 3 different production scenarios. The best values of the objective function were found by improving both loading and unloading equipment and increasing the number of trains.

The expansion of renewable energies is progressing strongly. The influence on the power supply networks by the volatility of the infeed must be met with new concepts. In this paper we investigate the possibilities of integrating microgrids as a cooperating unit in the power supply network to support further expansion of RES power plants. In this paper a differentiation of microgrids from similar network structures is established, a classification of proposed groups is made. Then, after the description of simulation of components in a microgrid, with practical advice, an example model is shown, which aids the dimensioning of the components within a microgrid to achieve a specified goal.

With the dramatic increase in world population, continued advances in modern greenhouse agriculture and plant growth practices are expected to help overcome the global problem of future food shortages. Next generation greenhouse design practices will need to address a range of issues, ranging from energy and land use efficiency to providing plant-optimised growth techniques. In this paper, we focus on investigating the optimum irradiation spectra matched to the lettuce species (Lactuca sativa, L.), which is commonly grown in greenhouse environments, in order to develop low-emissivity glass panes that maximize the biomass productivity of glass greenhouses. This low-emissivity glass passes the solar spectral components needed for crop growth, while rejecting other unwanted radiations, leading to significant energy savings and other beneficial effects related to greenhouse climate control, in a range of climates. This is due to reducing both the solar heat gain and photosaturation, which can raise the temperature of the crops to harmful levels. Experimental results show that substantial biomass productivity improvements in lettuce (up to ~14.7%) can be attained using spectrally optimized illumination, compared with white light irradiation. We also report on the development of advanced metal-dielectric thin-film filters that produce the optimum illumination spectrum when exposed to sunlight.

An adaptive operation strategy for on-demand control of DMFC system is proposed as an alternative method to enhance the voltage stability. Based on a single-cell DMFC stack, a newly simplified semi-empirical model is developed from the uniform-designed experimental results to describe the I-V relationship. Integrated with this model, the multi-objective optimization method is utilized to develop an adaptive operation strategy. Although the voltage instability is frequently encountered in unoptimized operations, the voltage deviation is successfully decreased to a required level by adaptive operations with operational adjustments. Moreover, the adaptive operations are also found to be able to extend the range of operating current density or to decrease the voltage deviation according to ones requirements. Numerical simulations are implemented to investigate the underlying mechanisms of the proposed adaptive operation strategy, and experimental adaptive operations are also performed on another DMFC system to validate the adaptive operation strategy. Preliminary experimental study shows a rapid response of DMFC system to the operational adjustment, which further validates the effectiveness and feasibility of the adaptive operation strategy in practical applications. The proposed strategy contributes to a guideline for the better control of output voltage from operating DMFC systems.

Background: Computed tomography examinations have produced high radiation doses to patients, especially the CT brain. This study aimed to optimize the radiation dose and image quality in adult CT brain protocol. Materials and Methods: Images were acquired by Catphan 700 phantom. Radiation doses were recorded as CTDIvol and dose length product (DLP). CT brain protocols were optimized by varying parameters such as kVp, mAs, signal-to-noise ratio (SNR) level, and Clearview iterative reconstruction (IR). Image quality were also evaluataion by The AutoQA Plus software. Results: CT Number accuracy and linearity had a robust positive correlation with the linear attenuation coefficient (µ) and showed more inaccurate CT numbers when using 80 kVp. MTF showed a higher value in 100 and 120 kVp protocols, while high contrast spatial resolution showed a higher value in 80 and 100 kVp protocols. Low contrast detectability and CNR tended to increase when using high mAs, SNR and Clearview IR protocol. Noise decreased when using a high radiation dose and a high percentage of Clearview IR. CTDIvol and DLP were increased with increasing kVp, mAs, and SNR levels, while the increasing percentage of Clearview did not affect the radiation dose. Conclusion: Optimized protocols, including radiation dose and image quality, should be evaluated to preserve diagnostic capability. The recommended parameter settings include kVp set between 100-120 kVp, mAs ranging from 200-300 mAs, SNR level within the range of 0.7-1.0, and an iterative reconstruction value of 30% Clearview to 60% or higher.

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.