Optimal planning and design of microgrids is a priority for electrification of off-grid areas. Indeed, according to one of the Sustainable Development Goals (SDG) 7, the UN recommends universal access to electricity for all but, at the lowest cost. To achieve this goal, several optimization methods with different strategies have been proposed in the literature. This paper proposes a microgrid installation and planning model based on a combination of several techniques. Python 3.10, the programming language, has been used in conjunction with machine learning techniques such as unsupervised learning based on K-means clustering and deterministic optimization methods based on mixed linear programming. These methods were complemented by the open-source spatial method for optimal electrification planning: onsset. The results obtained enabled us to simulate the model obtained, with a cluster considered as a case study, based on the elbow and k-means clustering method; then, in a second phase, to size the microgrid with a capacity of 40 kW, by optimizing all the resources available on the site: the example of the various resources in the case of Togo was considered (solar, wind, hydropower). This study therefore highlighted the optimal resources obtained by integrating battery systems by the optimization model formulated on the basis of the various technology costs, such as investment, maintenance and operating costs, based on the technical limits of the various technologies. For the optimum results obtained, solar systems account for 80% of the maximum load considered, compared with 7.5% for wind systems and 12.5% for battery systems. Next, an optimal microgrid connection model was proposed, based on the constraints of a voltage stability limit estimated at 10% of the maximum voltage drop. The substation capacity limit was also taken into account. The results obtained from the case studied enabled us again, to present selective results for load nodes in relation to the substation node. And finally, the spatial technology planning tool made it possible to obtain results on the different strategies for the various technologies required for the electrification planning study of the Togo case. The various results obtained from the different techniques provide the leads needed for a feasibility study for optimal electrification of off-grid areas, using microgrid systems.

Lead optimization in drug discovery is a crucial phase where initial hits are refined into compounds with improved pharmacological properties. While traditional methods rely on manual experimentation and modifications, AI-driven techniques have revolutionized this process by leveraging big data and predictive modeling. This review explores how AI-driven approaches accelerate lead optimization, showcasing examples like deep neural networks and reinforcement learning. Integration of multi-omic data and experimental validation further enhances AI-driven strategies. The future lies in refining these AI methods, democratizing tools, and interdisciplinary collaboration to streamline drug discovery and address medical needs efficiently.

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

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

The high performance of liquid chromatography(HPLC) has long been an indispensable tool for vigilance and analysis across range disciplines such as pharmaceuticals, environmental monitoring, food safety attributes etc. We will discuss about HPLC method development and validation, types of liquid chromatography methods focusing on proper use of a mobile phase like an eluent selection, how to optimize the conditions as well take it through its various procedures required for approval from regulatory bodies. Strategies to improve method robustness, sensitivity and reproducibility are highlighted. The future breakthroughs in HPLC technology and some innovative trends have also been speculated to limit this fundamental methodology.

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

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

The power generation structure and load characteristics in different provinces are quite different in China, and the distribution of peak regulating resources and demands is extremely unbalanced. Due to many factors such as low power marketization degree, shortage of peak regulating resources and block of transmission channels, the consumption of new energy is facing greater pressure. In order to improve the mutual aids in regional power grid, this paper proposes a two-layer optimization dispatching model considering the mutual aids of peak regulation resources between each province, and determines the optimal units startup mode and power output in each provinces, thus obtaining all the power supply output arrangements and the technical and economic indicators. Finally, take the actual regional power grid in China as an example, the simulation results show that the proposed model can significantly improve the new energy utilization rate, which verified the effectiveness and feasibility of the proposed model and methods in this paper.

Combining modern thermodynamics theory branches, including finite time thermodynamics or entropy generation minimization, constructal theory and entransy theory, with metallurgical process engineering, this paper provides a new exploration on generalized thermodynamic optimization theory for iron and steel production processes. The theoretical core is to thermodynamically optimize performances of elemental packages, working procedure modules, functional subsystems, and whole process of iron and steel production processes with real finite-resource and/or finite-size constraints with various irreversibilities toward saving energy, decreasing consumption, reducing emission and increasing yield, and to achieve the comprehensive coordination among the material flow, energy flow and environment of the hierarchical process systems. A series of application cases of the theory are reviewed. It can provide a new angle of view for the iron and steel production processes from thermodynamics, and can also provide some guidelines for other process industries.

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

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.

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.

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

This paper 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.

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

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

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

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

In order to obtain stable and reliable configuration transformation ability, reliability optimization design is regarded as an effective way to reduce the probability of kinematic function failure for the constrained metamorphic mechanism. Based on the structural composition principle of multi-configuration source metamorphic mechanism that can operate in an under-actuated state, the modularized calculation methods are established for the force analysis of augmented Assur groups including metamorphic kinematic joints. According to the equivalent resistance gradient model of metamorphic mechanisms, with considering the uncertainties in the link dimensions, masses, and compliance parameters et al, a probabilistic evaluation method for describing the configuration transformation ability of the constrained metamorphic mechanism is established. Based on reliability evaluation and reliability sensitivity analysis, a reliability optimization design method for improving the configuration transformation ability is proposed, and then the optimization design is carried out for tolerances of random variables focusing on those structural parameters with higher reliability sensitivity, so that the optimized results can satisfy the requirements of both reliability and economic simultaneously. Finally, the feasibility and effectiveness of the proposed method is verified by the illustration of a paper folding metamorphic mechanism. The research provides the foundation of reliability design of metamorphic mechanisms to obtain the high-probability repeated execution ability of configuration transformation, it also has theoretical and practical significance to promote the engineering application of metamorphic mechanisms.

One of the industries with the fastest rate of growth is healthcare, and this industry's enormous data requires extensive cloud storage. The cloud may offer some protection, but there is no assurance that data owners can rely on it for refuge and privacy amenities. Therefore, it is essential to offer security and privacy protection. Increased customer satisfaction with security and privacy preservation is crucial since healthcare big data and its sources are stored in the cloud and contain increasingly private and sensitive information. However, maintaining privacy and security in an untrusted green cloud environment is difficult, thus the data owner should have complete data control. A new work SecPri-BGMPOP(security and privacy of Boost graph Convolutional Network -Pinpointing-Optimization Performance) is suggested that can offer a solution that involves several different steps in order to handle the numerous problems relating to security and protecting privacy. Initially Boost Graph Convolutional Network Clustering (BGCNC) algorithm, which reduces computational complexity in terms of time and memory measurements, is first applied to the input dataset to begin the clustering process. Second, enlarge by employing a piece of the magnifying bit string to generate a safe key, pinpointing based encryption avoids amplify leakage even if a rival or attacker decrypts the key or asymmetric encryption. Finally, to determine the accuracy of the method, an optimal key was created using a meta-heuristic algorithmic framework called Hybrid fragment horde bland lobo Optimization (HFHBLO). Our proposed method currently kept in a cloud environment, allowing analytics users to utilize it without risking their privacy or security.

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.

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

The average sizes \ {\bar{L}}_{i\ } and their dispersion W_i along the i-th axis of crystallites in powders are used to determine the X-ray diffraction sizes, D_{i\ XRD}, averaged over crystallite columns within the BWA method. Numerical calculations have been carried out for an orthorhombic lattice of crystallites, such as LiFePO4, NMC, having Lamé's g-type superellipsoid shape. For Lognormal distributions, the analytical expression for the normalized coefficient Kn is found and includes two constants. The first K_{g,0} is a constant at W→0, the second K_g is a constant depending on the g -type shape. The dependences of D_{i\ XRD} are also calculated for Normal distribution. A fairly simple equation can be obtained as a result of analytical transformations in the framework of experimentally validated approximations. However, a simpler way is to carry out numerical computer calculations with subsequent approximation of the calculated curves. Using the obtained analytical expressions to control technologies from nuclear fuel to cathode materials will improve the efficiency of flexible energy network especially storage in autonomous and standby power plants.

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

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

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.

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

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

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

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

The integration of automation and process optimization within the context of AI-powered digital transformation has emerged as a pivotal strategy for organizations aiming to enhance efficiency, foster innovation, and competitiveness. This paper is devoted to present innovative contribution by providing a comprehensive structured roadmap that outlines the foundational principles necessary for the successful integration of automation and optimizing processes within the con-text of emerging AI technologies. The paper introduce a cohesive framework consisting of es-sential key pillars: Data-Driven Insights, Seamless Automation, Adaptive Learning and Contin-uous Improvement, Human-Centric Collaboration, Ethical and Responsible AI, Strategic Align-ment, Scalability, and Innovation. These pillars function as guiding principles to navigate the in-tricate landscape of automation-driven initiatives within AI-powered digital transformation. By embracing these pillars, organizations can embark on a transformative journey that maximizes the potential of automation, fosters innovation, and positions them as leaders in the ever-evolving landscape of AI-driven business operations.

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

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

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.

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

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

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

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

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.

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

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

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.

The capacitated multi-item lot-sizing problem abbreviated as CLSP, is to determine the lot sizes of products in each period in a given planning horizon of finite periods meeting the product demand and resource limits in each period, and minimize the total cost consisting of production, inventory holding, and setup costs. CLSPs are often encountered in industry production settings and thus the solution is significant. In this paper, we propose a Lagrange relaxation (LR) approach for the solution of its. The approach decomposes the CLSP into several uncapacitated single-item lot-sizing problems each of which can be easily solved by dynamic programming. The feasible solutions are achieved by solving the resulting transportation problems with a proposed stepping-stone algorithm and a fix-up procedure. The Lagrange multipliers are updated by using subgradient optimization. Experimental results show that the LR approach explores high-quality solutions and has better applicability compared with other commonly used solution approaches in the literature.

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

The present work aims at the comprehensive application of stochastic and optimization tools with the support of Information and Communication Technologies (ICT) through a case study in a logistics process for electronic goods; simulation and Response Surface Methodology (RSM) are applied for this purpose. The problem to be evaluated is to define an optimal distribution cost for products shipped to wholesale customers located in different cities in Mexico from a manufacturing plant in Tijuana, Mexico. The factors under study are the product allocation for each distribution center, finished good inventory level and on time deliveries, which are supposed to be significant to get the objective. The methodology applied for this problem considers the design of a discrete event simulation model to represent virtually the real life of logistics process, which is considered a complex system due to different activities are interrelated to carry it out. This model is used to execute the different experiments proposed by the RSM. The results obtained from simulation model were analyzed with the RSM to define the mathematical model that allows identifying the parameters of the factors in order to optimize the process. The findings prove how the ICT facilitate the application of stochastic tools with the purpose of process optimization.

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

To date, several independent methods and algorithms exist exploiting constraint-based stoichiometric models to find metabolic engineering strategies that optimize microbial production performance. Optimization procedures based on metaheuristics facilitate a straightforward adaption and expansion of engineering objectives as well as fitness functions, while being particularly suited for solving problems of high complexity. With the increasing interest in multi-scale models and a need for solving advanced engineering problems, we strive to advance genetic algorithms, which stand out due to their intuitive optimization principles and proven usefulness in this field of research. A drawback of genetic algorithms is that premature convergence to sub-optimal solutions easily occurs if the optimization parameters are not adapted to the specific problem. Here, we conducted comprehensive parameter sensitivity analyses to study their impact on finding optimal strain designs. We further demonstrate the capability of genetic algorithms to simultaneously handle (i) multiple, non-linear engineering objectives, (ii) the identification of gene target-sets according to logical gene-protein-reaction associations, (iii) minimization of the number of network perturbations, and (iv) the insertion of non-native reactions, while employing genome-scale metabolic models. This framework adds a level of sophistication in terms of strain design robustness, which is exemplarily tested on succinate overproduction in Escherichia coli.

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

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.

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

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

The notion of enhancement of the image is to ameliorate the perceptibility of information contained in an image. In the present research, a novel technique for the enhancement of image quality is propounded using fuzzy logic technique with a cuckoo optimization algorithm. Generally, the image is transformed from RGB domain to HSV domain keeping the color information intact within the image. The image has been categorized into three regions: underexposed, overexposed and mixed region on the basis of two threshold values. For the fuzzification of under and overexposed area the degree of membership is defined by the Gaussian membership, while the mixed area is fuzzified by parametric sigmoid function. The key parameters like visual factors and fuzzy contrast provide the quantitative analysis of an image. An objective function is framed which involves entropy and visual factor has been optimized by a new evolutionary cuckoo optimization algorithm. The results procured after simulation by the cuckoo optimization algorithm are compared with Bacterial foraging algorithm and ant colony optimization based image enhancement and this approach is found to be improved.

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

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.

In tracking-by-detection paradigm for multi-target tracking, target association is modeled as an optimization problem that is usually solved through network flow formulation. In this paper, we proposed combinatorial optimization formulation and used a bipartite graph matching for associating the targets in the consecutive frames. Usually, the target of interest is represented in a bounding box and track the whole box as a single entity. However, in the case of humans, the body goes through complex articulation and occlusion that severely deteriorate the tracking performance. To partially tackle the problem of occlusion, we argue that tracking the rigid body organ could lead to better tracking performance compared to the whole body tracking. Based on this assumption, we generated the target hypothesis of only the spatial locations of person’s heads in every frame. After the localization of head location, a constant velocity motion model is used for the temporal evolution of the targets in the visual scene. Qualitative results are evaluated on four challenging video surveillance dataset and promising results has been achieved.

This study presents a comprehensive approach to trim optimization as a energy efficiency improvement measure, focusing on reducing fuel consumption for one RO-RO car carrier. Utilizing Computational Fluid Dynamics (CFD) software, the methodology incorporates Artificial Neural Networks (ANN) to develop a mathematical model for estimating key parameters such as brake power, daily fuel oil consumption (DFOC) and propeller speed. The complex ANN model is then integrated into a user-friendly software tool for practical engineering applications. The research outlines a seven-phase trim optimization process and discusses its potential extension to other types of ships, aiming to establish a universal methodology for CFD-based engineering analyses. Based on trim optimization results, the biggest DFOC goes up to 10.5% at 7.5m draft and up to 8% for higher drafts. Generally, in every considered case, it is recommended to sail with the trim towards the bow, meaning that the ship’s weight (ballast) should be adjusted to tilt slightly forward.

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

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

Managing sidelobe levels (SLLs) in metasurface-driven beam-steering antennas poses a significant challenge due to intrinsic factors leading to grating lobes. Our proposed method employs an equivalent model to optimize large periodic metasurfaces efficiently. This model predicts complete metasurface performance, accounting for mutual coupling between patches. We introduce an evolutionary optimization algorithm based on the Cross Entropy (CE) method to enhance PGM-based beam-steering antennas and suppress sidelobes. Two strategies were employed: first is to optimize the patch dimensions for a sidelobe-free pattern and the second is to maintain the PGM dimensions while optimizing feed array amplitudes. Both strategies effectively suppressed sidelobes, offering insights into the CE method's applicability and effectiveness for CPU-intensive electromagnetic optimization challenges. The proposed CE method variant retains its simplicity while improving monitoring capabilities, addressing this limitation. Smaller generations yield better improvements per evaluation

With an increasing concern for global warming, there have been many attempts to reduce greenhouse gas emissions. About 30 % of total energy has been consumed by buildings and much attention has been paid to reducing building energy consumption. While there are many ways of reducing building energy consumption, accurate energy consumption prediction becomes more significant. As mechanical systems are the most energy-consuming components in the building, the present study developed the energy consumption prediction model for a direct-fired absorption chiller by using the ANN technique for the short term. The ANN model was optimized and validated with the actual data collected through a BAS. For the optimization, the numbers of input variables and neurons, and the data size of training were applied. By changing these parameters, the predictive performance was analyzed. In sum, the outcome of the present study can used to predict the energy consumption of the chiller as well as improve the efficiency of the energy management. The outcome of the present study can be used to develop a more accurate prediction model with a few datasets in that it can improve the efficiency of building energy management.

Numerical optimization methods are widely used for designing turbomachinery components due to the cost and time savings they can provide. In the available literature, shape optimization of radial compressors is mainly focused on improving the impeller alone. However, it is a well-established knowledge that the volute plays a key role in the overall performance of the compressor. The aim of the present paper is to perform the adjoint-based optimization of a volute that is designed for the SRV2-O compressor. The CAD model is first created, using a parametrization of 33 design parameters. Then, a butterfly topology is applied to mesh the computational domain with a multi-block structured grid, and an elliptic smoothing procedure is then used to improve the quality of the fluid grid. A steady-state RANS CFD solver with Spalart-Allmaras turbulence model is used to solve the Navier-Stokes equations, and flow sensitivities are computed with an adjoint solver. The objective function consists in minimizing the loss coefficient of the volute. The optimization is performed to obtain an improved design with 14% losses reduction. Detailed flow and design analysis is carried out to highlight the loss reduction mechanisms followed by the optimizer. Finally, the compressor map of the full stage is compared between the baseline and the optimized volute through CFD simulations using a mixing plane interface. This research demonstrates the successful use of a gradient-based optimization technique to improve the volute of a radial compressor and opens the door towards optimizing simultaneously the wheel and the volute.

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.

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

This paper introduces a new rotor design for the easy insertion and removal of the rotor windings. The shape of the rotor is optimized based on surrogate method in order to achieve the lowest power loss under the maximum power output. The performance of the new rotor is examined in 2-D finite element software and validated by experiments. This rotor shows good potentials for reducing the maintenance and repair costs of synchronous machines, making it suitable for manufacturers within the mass production markets such as gen-sets, steam turbines, wind power generators and hybrid electric vehicles.

This article is devoted to overcoming the contradiction between the problem of maximizing the extraction of wind energy as the goal of optimizing wind turbines, and the use of traditional methods based on criteria for the aerodynamic quality of the blades. A modified technique is considered in which the optimization criterion is the directly extracted flow power. It is based on pulse theory methods that use specific power as an optimization criterion. A comparative analysis of the energy efficiency of different types of turbines is carried out, and the effects of blade inversion are considered. A method for calculating multi-rotor turbines based on the concept of uniform power distribution is presented. The compatibility of proprietary and traditional methods is considered by comparing the results of numerical experiments with calculated and experimental data from sources. Optimization computational algorithms generate data from numerical experiments and determine optimal parameter configurations for the turbines under consideration. It is shown that orthogonal Darrieus turbines in high-speed mode provide energy efficiency comparable to collinear turbines, and multi-rotor turbines with power uniformly distributed over the working section are not inferior in energy efficiency to basic turbines, with linear blade velocities halved.

This paper details a design optimization on a hardware accelerator for an on-board real-time SAR imaging system using the Backprojection algorithm, focusing on algorithm-specific approximations intended to reduce the overhead introduced by intensive functions such as the square root, sine, and cosine functions. The main novelty of this work is that new approximations were investigated so that the final image retains high quality regardless of the error in the approximation function. This paper revisits existing approximation methods, such as linear interpolation, polynomial approximation using the Vandermonde matrix, and Chebyshev polynomials, and compares their performance on the algorithm. Results demonstrate that it is possible to maintain the image quality with an SSIM above 0.99 with less 93% LUTs for the square root and less 88% LUTs for the sine and cosine functions using polynomial approximation with the Vandermonde matrix when compared to the HLS baseline functions.

We proposed a deep learning based chemometric data analysis technique. We trained L2 regularized sparse autoencoder end-to-end for reducing the size of the feature vector to handle the classic problem of curse of dimensionality in chemometric data analysis. We introduce a novel technique of automatic selection of nodes inside hidden layer of an autoencoder through pareto optimization. Moreover, linear regression, ϵ-SVR , and Gaussian process regressor are applied on the reduced size feature vector for the regression. We evaluated our technique on orange juice and wine dataset and results are compared against state-of-the-art methods. Quantitative results are shown on Normalized Mean Square Error (NMSE) and the results show considerable improvement in the state-of- the-art.

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

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.

Class Incremental Learning (CIL) has emerged as a vital machine learning paradigm, particularly suited for environments with continuous data streams, such as those encountered in the financial industry. CIL enables models to progressively acquire and accumulate new knowledge without retraining the entire dataset, making it highly efficient for dynamic financial markets. In this paper, we explore the application of CIL to financial data streams, where high-frequency, high-dimensional data, such as stock prices and cryptocurrency transactions, evolve rapidly. The challenges inherent in CIL, including catastrophic forgetting—where the model loses previously learned knowledge—and intransigence—where it resists learning new classes—are addressed through both regularization-based techniques and dynamic architecture expansion. We present a comprehensive analysis of the algorithms designed to mitigate these challenges and highlight their relevance in financial applications like algorithmic trading, portfolio management, risk assessment, and fraud detection. By demonstrating how CIL enables models to adapt to new market conditions and asset classes while retaining past knowledge, we illustrate its critical role in advancing real-time financial decision-making. Through a detailed examination of the methodologies and their applications, this paper aims to provide insights into the future of adaptive financial models using Class Incremental Learning. We have also summarized methodologies into a model optimization-based class and a data focused class.

Digital Microfluidic Biochips (DMFBs), used in various kinds of fields like DNA analysis, clinical diagnosis, and PCR testing, have made biochemical experiments more compact, efficient, and user-friendly than previous ways. However, their reliability is often compromised by their inability to adapt to all kinds of errors. All errors in biochips can be categorized into two types: known errors and unknown errors. Known errors are detectable before the start of the routing process through sensors or cameras. Unknown errors, in contrast, become apparent only during the routing process and remain undetected by sensors or cameras, which is the biggest issue to unexpectedly stop the routing process and diminishes the reliability of biochips. This paper introduces a deep reinforcement learning-based routing algorithm designed to manage not only known errors but also unknown errors. Our experiments demonstrate that our algorithm outperforms previous ones in terms of the success rate of the routing in the scenario including both known errors and unknown errors. Additionally, our algorithm contributes to detecting unknown errors during the routing process and identifying the most efficient routing path with high probability.

Given the existing movable rotating plate type grading device for potatoes with a high safety factor and heavy mass, the body frame of the grading device and movable rotating plate were optimized and a lightweight design was carried out. Based on ANSYS Workbench 2022, the static analysis of the body frame before and after improvement was compared, and it was verified that the strength and deformation of the optimized body frame met the design requirements, and the weight of the optimized body frame was reduced by 32.3%. Based on the direct optimization module of ANSYS Workbench 2022, the plate length, width, and height were used as design variables for the lightweight design of the movable rotating plate. The MOGA algorithm was used to generate sixty design solutions, and the optimal combination of size parameters for the plate was 610 mm, 95mm, and1.2 mm. Compared with the whole grading device before optimization, the total mass was reduced by 22.86% after optimization. The research of this article provides a reference for the structural design and optimization analysis of potato grading devices.

Limonene is a valuable monoterpenoid that with diverse applications. Microbial biosynthesis offers a sustainable alternative to plant-based extraction, which is prone to hinderance by climate change and acreage. In the present study, the effects on limonene production of carbon source, inoculum, working volume, temperature, pH, dodecane coverage, and media were investigated with engineered strains of Rhodosporidium toruloides. Through single-factor and orthogonal experiments, the limonene titer was improved from 52.2 to 358.1 mg/L on 250-mL flask, a 586% increase. The optimized medium was MM, with a working volume of 50 mL, inoculum OD600=0.6, 22 °C, pH 6, and dodecane coverage (v/v) of 20%. The results here demonstrated that the R. toruloides could be explored as an efficient limonene producer and facilitate other monoterpenoids biosynthesis with R. toruloides.

In the present study, a hybrid optimizing algorithm has been proposed using Genetic Algorithm (GA)and Particle Swarm Optimization (PSO) for Artificial Neural Network (ANN) to improve the estimation of electricity demand of the state of Tamil Nadu in India. The GA-PSO model optimizes the coefficients of factors of gross state domestic product (GSDP) , electricity consumption per capita, income growth rate and consumer price index (CPI) that affect the electricity demand. Based on historical data of 25 years from 1991 till 2015 , the simulation results of GA-PSO models are having greater accuracy and reliability than single optimization methods based on either PSO or GA. The forecasting results of ANN-GA-PSO are better than models based on single optimization such as ANN-BP, ANN-GA, ANN-PSO models. Further the paper also forecasts the electricity demand of Tamil Nadu based on two scenarios. First scenario is the "as-it-is" scenario , the second scenario is based on milestones set for achieving goals of "Vision 2023" document for the state. The present research also explores the causality between the economic growth and electricity demand in case of Tamil Nadu. The research indicates that a direct causality exists between GSDP and the electricity demand of the state.

In the present study, a hybrid optimizing algorithm has been proposed using Genetic Algorithm (GA)and Particle Swarm Optimization (PSO) for Artificial Neural Network (ANN) to improve the estimation of electricity demand of the state of Tamil Nadu in India. The GA-PSO model optimizes the coefficients of factors of gross state domestic product (GSDP) , electricity consumption per capita, income growth rate and consumer price index (CPI) that affect the electricity demand. Based on historical data of 25 years from 1991 till 2015, the simulation results of GA-PSO models are having greater accuracy and reliability than single optimization methods based on either PSO or GA. The forecasting results of ANN-GA-PSO are better than models based on single optimization such as ANN-BP, ANN-GA, ANN-PSO models. Further the paper also forecasts the electricity demand of Tamil Nadu based on two scenarios. First scenario is the “as-it-is” scenario, the second scenario is based on milestones set for achieving goals of “Vision 2023” document for the state. The present research also explores the causality between the economic growth and electricity demand in case of Tamil Nadu. The research indicates that a direct causality exists between GSDP and the electricity demand of the state.

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

Buckling defect will appear on the outer surface of the deformed ring during constrained ring rolling (CRR) of aluminum alloy thin wall conical ring with inner high ribs (AATWCRIHR), if the geometrical dimension of the ribs doesn't match the wall thickness. To avoid the buckling defect, a quantitative method for characterizing the degree of the buckling defect is proposed using the area of buckling profile. Then an orthogonal experimental scheme was designed taking the width of the middle rib, thickness of wall, and height of the middle rib as design variables and defining the area of buckling profile as optimization objective. Subsequently, a quadratic polynomial response surface model was established by combining the optimization algorithm with the finite element method (FEM), and the geometrical dimension of the middle ribs of the deformed AATWCRIHR is optimized. Also the optimal parameter combination to minimize the area of buckling profile is obtained and verified using FE simulation. Results show that the AATWCRIHR after optimization doesn’t generate the buckling defect during constrained ring rolling, and it is proved that the quantitative buckling defect representation method and the optimization design method based on the response surface model and the finite element simulation results are feasible for the constrained ring rolling process of the AATWCRIHR.

Deep learning neural networks require an immense amount of computation, especially in the training phase of the network when networks with multiple layers of intermediate neurons need to be built. In this paper, we will focus on the PSO algorithm with the aim of significantly accelerating the DLNN training phase by taking advantage of the GPGPU architecture and the Apache Spark analytics engine for large-scale data processing tasks. PSO is a bio-inspired stochastic optimization method whose goal is to iteratively improve the solution to a (usually complex) problem by attempting to approximate a given objective. However, parallelizing an efficient PSO is not a straightforward process due to the complexity of the computations performed on the swarm of particles and the iterative execution of the algorithm until a solution close to the objective with minimal error is achieved. In the present work, two parallelizations of the PSO algorithm have been implemented , both designed for a distributed execution environment. The synchronous parallel PSO implementation ensures consistency at the cost of potential idle time due to global synchronization, while the asynchronous parallel PSO approach improves execution time by reducing the need for global synchronization, making it more suitable for large datasets and distributed environments such as Apache Spark. Both variants of PSO have been implemented to distribute the computational load supported by this algorithm –due to the costly fitness evaluation and updating of particle positions– across the different Spark cluster executor nodes to effectively achieve coarse-grained parallelism, resulting in a significant performance increase over current sequential variants of PSO.

Drone technology has undoubtedly become an integral part of our everyday life these days. The business and industrial use of unmanned aerial vehicles (UAV) can provide advantageous solutions in many areas of life, and they are also optimal for emergency situations and for accessing hard-to-reach places. However, their application poses numerous technological and regulatory challenges to be overcome. One of the weak links in the operation of UAVs is the limited availability of energy. In order to address this issue authors developed a novel trajectory planning method for UAVs to optimize the energy necessity during flight. First, an “energy map” was created, which was the basis for trajectory planning, i.e., determining the energy consumption of the individual components. This was followed by configuring the 3D environment including partitioning of the work space (WS), in fact, defining the free spaces, occupied spaces (obstacles) and semi-occupied/free spaces. Then the corresponding graph-like path(s) were generated on the basis of the partitioned space, where a graph search-based heuristic trajectory planning was initiated, taking into account the most important wind conditions including velocity and direction. Finally, in order to test the theoretical results, some sample environments were created to test and analyse the proposed path generations. The method eventually proposed was able to determine the optimal path in terms of energy consumption.

The effectiveness of Fuzzy Inference Systems (FISs) in manipulating uncertainty and nonlinearity makes them a subject of significant interest for decision-making in embedded systems. Accordingly, optimizing FIS hardware improves its performance, efficiency, and capabilities, leading to a better user experience, increased productivity, and cost savings. To be compatible with the limited power budget in most embedded systems, this paper presents a framework to realize ultra-low power FIS hardware. It supports optimizations for both conventional arithmetic as well as MSDF-computing to be highly consistent with MSDF-based sensors. In MSDF-computing FIS all the processes of fuzzification, inference, and defuzzification are done on serially coming data bits. To demonstrate the efficiency of the proposed framework, we utilized Matlab, Chisel3, and Vivado to implement it from high-level descriptions of FIS to hardware synthesis. We also developed a Scala library in Chisel3 to establish a connection between these tools, bridging the gap, and facilitating design space exploration at the arithmetic level. Furthermore, we realized an FIS for the navigation of autonomous mobile robots in unknown environments. Synthesis results show the superiority of the output of our suggested design framework in terms of resource usage as well as power and energy consumption compared to the Matlab HDL code generator output.

This study investigates the applications of reconfigurable intelligent surfaces (RIS) in heterogeneous downlink networks (HetNet). Due to the network densification, the small cell base station (SBS) interferes with the macrocell users (MUE). In this paper, we utilize RIS to mitigate cross-tier interference in an HetNet via directional beamforming by adjusting the phase shift of the RIS. We consider an RIS-assisted HetNet consisting of multiple SBS nodes and MUEs that utilize both direct paths and reflected paths. Therefore, the aim of this study is to maximize the sum rate of all MUEs by jointly optimizing the transmit beamforming of the macrocell base station (MBS) and the phase shift of the RIS. An efficient RIS reflecting coefficients-based optimization (RCO) is proposed based on a successive convex approximation approach. Simulation results are provided to show the effectiveness of the proposed scheme in terms of its sum rate in comparison with the scheme HetNet without RIS and the scheme HetNet with RIS but with random phase shifts.

Environmental and economic needs drive the increased penetration of intermittent renewable energy in electricity grids, enhancing uncertainty in market conditions prediction and network constraints. Thereafter, the importance of energy systems with flexible dispatch is reinforced, ensuring energy storage as an essential asset for these systems to be able to balance production and demand. In order to do so, such systems should participate in whole-sale energy markets, enabling competition among all players, including conventional power plants. Consequently, an effective dispatch schedule considering market and resource uncertainties is crucial. In this context, an innovative dispatch optimization strategy for schedule planning of renewable systems with storage is presented. Based on an optimization algorithm combined with a machine learning approach, the proposed method develops a financial optimum schedule with the incorporation of uncertainty information. Simulations performed with a concentrated solar power plant model following the proposed optimization strategy demonstrate promising financial improvement with a dynamic and intuitive dispatch planning method, emphasizing the importance of uncertainty treatment on the enhanced quality of renewable systems scheduling.

In this paper, a completely different metaheuristic algorithm called the Orangutan Optimization Algorithm (OOA) is introduced, which replicates the complex and adaptive behaviors of Orangutans in their natural habitat. The main inspiration for OOA lies in the strategic foraging techniques of Orangutans, alongside their highly developed nesting abilities. More words are used to provide a detailed theoretical explanation of OOA, followed by a comprehensive modeling of the algorithm’s implementation in two key phases: exploration and exploitation. These phases are mathematically structured to ensure the balance required for optimal search processes. The performance of OOA is rigorously evaluated using twenty-nine benchmark functions from the CEC 2017 test suite, with problem dimensions of 10, 30, 50, and 100. More sentences are included to elaborate on the optimization outcomes, which reveal that OOA effectively balances the exploration and exploitation stages, yielding suitable and competitive solutions across the benchmark functions. Additionally, to further validate its quality, the results from OOA are compared against twelve other well-established metaheuristic algorithms. The analysis of these simulation results demonstrates that OOA consistently outperforms competing algorithms by achieving superior results across most benchmark functions. Furthermore, to assess its real-world applicability, OOA is implemented on a set of twenty-two constrained optimization problems drawn from the CEC 2011 test suite. The extended simulation results clearly indicate that OOA is highly efficient in solving real-world optimization challenges, consistently delivering a superior performance when compared to other competitor algorithms.

Bipedal locomotion remains one of the major open challenges of humanoid robotics. The common approaches are based on simple reduced model dynamics to generate walking trajectories, often neglecting the whole-body dynamics of the robots. As motions in nature are often considered as optimal with respect to certain criteria, in this work we present an optimal control based approach that allows us to generate optimized walking motions using a precise whole-body dynamic model of the robot, in contrast with the common approaches. The optimal control problem is formulated to minimize a set of desired objective functions with respect to physical constraints of the robot and contact constraints of the walking phases. We apply the method with combinations of different objective criteria to the model of a reduced version of the iCub humanoid robot of 15 internal DOF. The obtained trajectories are executed on the real robot and we carry out a discussion on the differences between the outcomes of this approach with the classic approaches.

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.

A variable speed anti-tangling reel mechanism was designed to address the problems of tangling, hanging and rewinding of the tassel wheel and the high paddling loss in the current Chinese rape combine harvester cutting table. The kinematic equations of the reel mechanism were developed, and the analysis showed that the speed in the entry stage is low and the speed in the exit stage is high, and the attitude of the reel teeth change with the rape plant movement during the whole paddling process. A single-factor test and a multi-factor regression orthogonal combination test were carried out using the cutting table loss rate of rape harvesting as the evaluation index. The main and secondary factors affecting the cutting table loss of the variable speed reel were obtained as the reel speed, the machine travel speed and the ground angle of the frame. A mathematical model of regression of cutter loss and the main influencing factors was established, with the coefficient of determination R2 = 0.9918. The optimal combination of parameters for the variable speed reel was obtained with the lowest cutting table loss rate in rape harvesting as the optimization target: reel speed 25r/min, frame parallel to the ground and implement travel speed 0.7m/s. Field validation tests and comparative tests of cutting table loss of the two reels were carried out. The test results show that the regression mathematical model of the cutting table loss is more accurate, and the cutting table loss is reduced by 13.9% with the variable speed reel compared to the cam-action reel, and there are no problems with the paddle teeth hanging and tangling during the paddling process.

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.

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.

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

Mechanical response of composite structures concerning also natural frequencies is a function of material and geometrical describing plates and shells. In the present paper the optimization of those parameters is demonstrated. It is based on the formulation that uses the key-points (spline functions) and evolutionary algorithms. The numerical solutions dealing with the optimal design of axisymmetric cylindrical shells having variable radius are presented and discussed in details.

Within the past few decades, thousands of experiments have been performed to characterize waste and biomass to estimate the bioenergy potential and product identification. There is a need to develop an integrated process model based on experimental literature, and simulation to obtain suitable products. In this study municipal solid waste (MSW) characterization and integrated process model have been developed to optimize final products in a reactor system. The process model has two modes R&amp;D and reactor control (RC) to obtain suitable products including bio-oil, char, and gases. A database was integrated based on thermokinetics, machine learning and simulation models to optimize product efficiency. The experimental data includes thermogravimetric analysis, Fourier transform Infrared Spectroscopy, Gas chromatography, and Mass spectrometry, which are linked with pyrolysis experimental setup. Feedstock-product mapping models were incorporated into the database along with the temperature, heating rates, elemental analysis, and final product concentration, which are utilized for pyrolysis reactor setup. Product feasibility is conducted based on lifecycle cost, affordability, and product efficiency. The present work will bridge the gap between experimental study and decision making based on obtained products at several experimental conditions around the world.

Ultrasound based haptic feedback is a potential technology for human-computer interaction (HCI) with the advantages of low cost, low power consumption and controlled force. In this paper, the phase optimization for multipoint haptic feedback based on ultrasound array is investigated and the corresponding experimental verification is provided. A mathematical model of acoustic pressure is established for the ultrasound array and then a phase optimization model for an ultrasound transducer is constructed. We propose a pseudo-inverse (PINV) algorithm to accurately determine the phase contribution of each transducer in the ultrasound array. By controlling the phase difference of the ultrasound array, the multipoint focusing forces are formed leading to various shapes such as geometries and letters that can be visualized. Because the unconstrained PINV solution results in unequal amplitudes for each transducer, a weighted amplitude iterative optimization is deployed to further optimize the phase solution, by which the uniform amplitude distributions of each transducer are obtained. For the purpose of experimental verifications, a platform of ultrasound haptic feedback consisting of a Field Programmable Gate Array (FPGA), an electrical circuit and an ultrasound transducer array is prototyped. The haptic performances of single point, multiple points and dynamic trajectory were verified by controlling the ultrasound force exerted on the liquid surface. The experimental results demonstrate that the proposed phase optimization model and theoretical results are effective and feasible, and the acoustic pressure distribution is consistent with the simulation results.

The adoption of Machine Learning (ML) for building emulators for complex physical processes has seen an exponential rise in the recent years. While neural networks are good function approximators, optimizing the hyper-parameters of the network to reach a global minimum is not trivial, and often needs human knowl- edge and expertise. In this light, automatic ML or autoML methods have gained large interest as they automate the process of network hyper-parameter tuning. In addition, Neural Architecture Search (NAS) has shown promising outcomes for improving model performance. While autoML methods have grown in popularity for image, text and other applications, their effectiveness for high-dimensional, complex scientific datasets remains to be investigated. In this work, a data driven emulator for turbulence closure terms in the context of Large Eddy Simulation (LES) models is trained using Artificial Neural Networks and an autoML frame- work based on Bayesian Optimization, incorporating priors to jointly optimize the hyper-parameters as well as conduct a full neural network architecture search to converge to a global minima, is proposed. Additionally, we compare the effect of using different network weight initializations and optimizers such as ADAM, SGDM and RMSProp, to explore the best performing setting. Weight and function space similarities during the optimization trajectory are investigated, and critical differences in the learning process evolution are noted and compared to theory. We observe ADAM optimizer and Glorot initialization consistently performs better, while RMSProp outperforms SGDM as the latter appears to have been stuck at a local minima. Therefore, this autoML BayesOpt framework provides a means to choose the best hyper-parameter settings for a given dataset.

Indoor Positioning Systems (IPSs) are designed to provide solutions for location-based services. Wireless local area network (WLAN)-based positioning systems are the most widespread around the globe and are commonly found to have a ready-to-use infrastructure composed mostly of access points (APs). They provide useful information on signal strength to be processed by adequate location algorithms, which are not always capable of achieving the desired localization error only by themselves. In this sense, this paper proposes a new method to improve the accuracy of IPSs by optimizing some of their most relevant infrastructure components. Included are the arrangement of APs over the environment, the number of reference points (RPs), and the number of samples per location estimation test. A simulation environment is also proposed, in which the impact of key influencing factors on system accuracy is analyzed. Finally, a case study is simulated to validate an optimal combination of design parameters and its compliance with the requirements of localization error and the limited number of access points. Our simulation results clearly show that the desired localization accuracy, which is set as a goal, can be achieved while maintaining the factors already mentioned at minimal levels, which decreases both system deployment costs and computational effort.

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.