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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

The combination of artificial intelligence algorithms and numerical methods has recently become popular in the prediction of macroscopic and microscopic hydrodynamics parameters of bubble column reactors. The multi inputs and outputs machine learning can cover small phase interactions or large fluid behavior in industrial domains. This numerical combination can develop the smart multiphase bubble column reactor with the ability of low-cost computational time. It can also decrease case studies for the optimization process when big data is appropriately used during learning. There are still many model parameters that need to be optimized for a very accurate artificial algorithm, including data processing and initialization, the combination of inputs and outputs, number of inputs and model tuning parameters. For this study, we aim to train four inputs big data during learning process by an adaptive neuro-fuzzy inference system or adaptive-network-based fuzzy inference system (ANFIS) method, and we consider the superficial gas velocity as one of the input variables, while for the first time, one of the computational fluid dynamics (CFD) outputs named gas velocity is used as an output of the artificial algorithm. The results show that the increasing number of input variables improves the intelligence of the ANFIS method up to , and the number of rules during learning process has a significant effect on the accuracy of this type of modeling. The results also show that propper selection of model parameters results in more accuracy in prediction of the flow characteristics in the column structure.

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

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

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

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

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

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

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

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

Remaining service life (RSL) of pavement, as a sign of future pavement performance, has always received growing attention from pavement engineers. The RSL describes the time from the moment of pavement inspection until such a time when a major repair or reconstruction is required. The conventional approach to determining RSL involves using non-destructive tests. These tests, in addition to being costly, interfere with traffic flow and compromise users' safety. In this paper, surface distresses of pavement have been used to estimate the pavement’s RSL in order to eliminate the aforementioned problems and challenges. To implement the proposed theory, 105 flexible pavement segments were taken from Shahrood-Damghan Highway (Highway 44) in Iran. For each pavement segment, the type, severity, and extent of surface damage and pavement condition index (PCI) were determined. The pavement RSL was then estimated using non-destructive tests include Falling Weight Deflectometer (FWD) and Ground Penetrating Radar (GPR). After completing the dataset, the modeling was conducted to predict RSL using three techniques include Support Vector Regression (SVR), Support Vector Regression Optimized by Fruit Fly Optimization Algorithm (SVR-FOA), and Gene Expression Programming (GEP). All three techniques estimated the RSL of the pavement by selecting the PCI as input. The Correlation Coefficient (CC), Nash-Sutcliffe efficiency (NSE), Scattered Index (SI), and Willmott’s Index of agreement (WI) criteria were used to examine the performance of the three techniques adopted in this study. In the end, it was found that GEP with values of 0.874, 0.598, 0.601, and 0.807 for CC, SI, NSE, and WI criteria, respectively, had the highest accuracy in predicting the RSL of pavement.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

In order to make full use of the complementarity of existing navigation systems to improve the navigation and positioning accuracy, this paper investigates the visual/INS integrated navigation system based on the factor graph optimization (FGO) algorithm. In the traditional visual/INS integrated navigation system, there is often the problem of image blurring due to the rapid change of light and shadow captured by the vision sensor and the attitude change of the carrier, which leads to the decrease of the positioning accuracy of the combined navigation system. Therefore, this paper firstly introduces Retinex algorithm and BID algorithm to carry out the design of image de-blurring method; then implements the visual/INS integrated navigation algorithm based on the factor graph optimization method; finally, the experimental scheme is designed, comparative experiments are carried out, and the researched method is verified by using the public dataset. The experimental results show that the combined navigation algorithm realized in this paper has high accuracy, and its positioning accuracy is improved by 40% compared with visual positioning.

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

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

Polymer Electrolyte Membrane Fuel Cells (PEMFCs) have emerged as a pivotal technology in the automotive industry, significantly contributing to the reduction of greenhouse gas emissions. The high material costs of the gas diffusion layer(GDL) and bipolar plate(BP) creates a barrier for large scale commercial application. This study aims towards addressing this challenge by optimizing the material and design of the cathode, GDL and BP. While Deterministic design optimization(DDO) methods have been extensively studied, they often fall short when manufacturing uncertainties are introduced. This issue is addressed by introducing Reliability based design optimization(RBDO) to optimize four key PEMFC design variables i.e., δ_gdl, d_ch, w_ch, and w_land. The objective is to maximize cell voltage(V_cell) considering material cost of cathode gas diffusion layer(Cost_cGDL), and cathode bipolar plate(Cost_cBP) as reliability constraints. Results of the DDO show an increment in V_cell of 31mV, with reliability of around 50% for Cost_cGDL and Cost_cBP. In contrast RBDO method provides a reliability of 95% for both Cost_cGDL and Cost_cBP.

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.

This paper presents Double Database Decomposition Framework, which integrates vertical and horizontal table decompositions to minimize data leakage due to intrusions. Vertical decompositions segregate sensitive attributes, while horizontal ones partition data based on user access patterns. In this way, the framework ensures that users access only the data necessary for their operations, adhering to the principle of least privilege. This double decomposition approach improves the robustness of the original database against impersonation attacks and limits the blast radius of potential intrusions. Furthermore, the framework significantly mitigates the risks associated with data breaches by confining unauthorized access to specific data subsets and restricting the exposure of sensitive information. Performance analysis highlights the trade-offs between robustness and overhead offered by distinct allocation strategies of the output of the decompositions to, among other, physical machines, virtual machines, and containers, to balance security and resource efficiency. We present a case study in a healthcare environment that confirms both the effectiveness of the framework and its applicability in complex systems where data security is paramount. By integrating advanced security measures and optimising data access, the framework results in a scalable and adaptable solution for enhancing database security and performance in various domains.

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

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

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.

This study evaluates the efficiency of biodegradable polyurethane foams as thermal insulation materials compared to conventional materials like expanded polystyrene (EPS). Key parameters analyzed include thermal conductivity, energy savings, CO2 emission reductions, and investment payback periods. Biodegradable polyurethane foams demonstrated a thermal conductivity of 0.022 W/(m·K), significantly lower than EPS’s 0.035 W/(m·K), leading to higher energy savings. Calculations reveal an annual energy saving of 443,820 kWh for polyurethane foams, compared to 441,330 kWh for EPS. Financially, polyurethane foams save approximately €53,258.4 annually, while EPS saves €52,959.6. In terms of environmental impact, polyurethane foams reduce CO2 emissions by 88,764 kg annually, versus 88,266 kg for EPS. Despite the higher initial cost of polyurethane foams (€50/m² compared to €30/m² for EPS), the payback period is remarkably short at 0.094 years (1.13 months) compared to EPS’s 0.057 years (0.68 months). These findings highlight biodegradable polyurethane foams as a superior option for thermal insulation, offering significant energy, financial, and environmental benefits.

The main goal of optimization is to find factors values that bring minimum feedstock consumption or maximum final product or services of the production process. In a production process, the factors that make up the model that describes it are usually the properties of the final product. In the case of biodiesel, which is the final product of the process that is the object of study, among the various properties, the glycerol content is among the most important. The present study aims to maximize the model yield that defines glycerol content on the biodiesel composition. This optimization was executed by a hybrid metaheuristic algorithm (SAGAC),and its experimental results are compared with other optimization techniques named by RSM (Response Surface Methodology). After run the experimental assays, SAGAC algorithm has find the follow values of model factors: molar ratio = 3(mol/mol), catalyst content = 0.52 (wt%), reaction temperature = 49(^oC), Time = 45 (min) generating model yield of 14.46 that, match with EN 14105 standard value of 0.33 (wt%). Comparing results between SAGAC and RSM methodologies, SAGAC has presented an improvement of 31%.

Influencer marketing has become a pivotal component of digital marketing strategies, offering brands a unique way to connect with audiences through trusted voices. However, measuring the return on investment (ROI) from influencer marketing campaigns can be challenging due to the intangible nature of brand influence and engagement. This abstract explores various techniques and strategies to measure and optimize ROI in influencer marketing. Measurement Techniques: The paper delves into both quantitative and qualitative methods for assessing influencer marketing ROI. Quantitative techniques include tracking metrics such as impressions, clicks, conversions, and sales, using tools like Google Analytics and social media insights. Additionally, advanced attribution models, such as multi-touch attribution and econometric modeling, are discussed for more accurately linking influencer activities to business outcomes. Qualitative approaches involve sentiment analysis and brand awareness studies, which help gauge the impact of campaigns on brand perception and customer loyalty. Optimization Strategies: To maximize the effectiveness of influencer marketing, the paper outlines several optimization strategies. These include selecting the right influencers based on audience alignment and engagement rates, setting clear and measurable campaign goals, and employing A/B testing to refine content and strategies. The importance of long-term partnerships and content diversification is also emphasized, as they can enhance authenticity and sustain audience interest. The abstract concludes that a comprehensive approach combining rigorous measurement techniques and strategic optimization can significantly enhance the ROI of influencer marketing campaigns. By continuously analyzing data and refining strategies, brands can better leverage influencer partnerships to achieve their marketing objectives.

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.

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.

: Controlling the distribution of water and wastewater between industrial processes is very vital in rationalizing water and preserving the environment. In this paper, a mathematical technique is proposed to optimize water-wastewater networks; a nonlinear program is introduced to minimize the consumption of freshwater, and consequently, the flowrate of the wastewater dis-charge will be also minimized. A general mathematical model, able to handle industrial plants containing up to eight sources and eight sinks, is developed using LINGO optimization software to facilitate dealing with complex case studies. The introduced model can handle single contam-inant networks as well as multiple contaminants cases. The optimal water network is synthe-sized through two steps; the first step is to introduce the case study data to the developed mathematical model. The second step considers using the optimal solution produced after run-ning the developed LINGO model as feed data for a pre-designed Excel sheet able to deal with these results and simultaneously draw the optimal water-wastewater network. The proposed mathematical model is applied to two case studies; The first case study includes actual data from four fertilizer plants located in Egypt; the water resources and requirements are simultaneously integrated to obtain a sensible cutting in both freshwater consumption (lowered by 52.2%) and wastewater discharge (zero wastewater discharge). The second case study is for a Brazilian pet-rochemical plant; the obtained results showed noticeable reductions in freshwater consumption for the second case study by 12.3 % while the reduction percentage of wastewater discharge is 4.5%.

The canonical decomposition of a bipartite graph is a new decompositionmethod that involves three operators, parallel, series and K+S. The class of weak bisblit graphs is totally decomposable with respect of these operators, and the class of bicographs is totally decomposable with respect of parallel and series operators. We prove in this paper that the class of bipartite (P_6,C_6)-free graphs is exactly the class of bipartite graphs that are totally decomposable with respect of parallel and K+S operators. We simplify the recognition algorithm of weak-bisplit graphs to adepte with bipartite (P_6,C_6)-free graphs. As a result of this adapted algorithm, we prsent efficient solutions in this class of graphs for two optimization graph problems, the first is the maximm balanced bi-clique problem and the the second is the maximum independent set problem.

Reverse engineering is applied to identify optimum polymerization conditions for the synthesis of polymer with pre-defined properties. The proposed approach uses multi-objective optimization (MOO) and provides multiple candidate polymerization procedures to reach the targeted polymer property. The objectives for optimization include maximal similarity of molar mass distributions (MMD) compared to the target MMD, minimal reaction time, and maximal monomer conversion. The method is tested for vinyl acetate radical polymerizations and can be adopted to other monomers. The data for the optimization procedure is generated by an in-house developed kinetic Monte-Carlo (kMC) simulator for a selected recipe search space. The proposed reverse engineering algorithm comprises several steps: kMC simulations for the selected recipe search space to derive initial data, performing MOO for a targeted MMD, and identification of the Pareto optimal space. The last step uses a weighted sum optimization function to calculate the weighted score of each candidate polymerization conditions. To decrease the execution time clustering of the search space based on MMDs is applied. The performance of the proposed approach was tested for various target MMDs. The suggested MOO-based reverse engineering provides multiple recipe candidates depending on competing objectives.

Everyone should therefore consistently get access to enough and safe water. The operation of the existing distribution network as well as the proper optimization and implementation of the new distribution systems are required for a sufficient and safe water supply. In Sekota town sufficient amount of water was not reached to the beneficiaries due to shortage of water at the source. The primary goal of this study was to evaluate the performance and optimize the existing Sekota water supply distribution system using Bentley Water GEMS.The system's hydraulic modeling is carried out by considering as a continuous supply system, and the evaluation procedure used the extended period simulation approach after calibration was done. Calibration is used to ensure the performance of the model using the observed pressure values. The output of the existing system shows pressure is very high means above the maximum pressure and velocity is very low at peak hour demand. The results of velocity and pressure before optimization have negative effect on the performance of the system. The number of pipes and junctions their velocities and pressures which were in admissible ranges are 15 and 42 pipes for velocities and zero and 59 junctions for pressure before and after optimization were evaluated respectively.

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

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