Recently, the Hypervolume Newton method (HVN) has been proposed as fast and precise indicator-based method for solving unconstrained bi-objective optimization problems with objective functions that are at least twice continuously differentiable. The HVN is defined on the space of (vectorized) fixed cardinality sets of decision space vectors for a given multi-objective optimization problem (MOP) and seeks to maximize the hypervolume indicator adopting the Newton-Raphson method for deterministic numerical optimization. To extend its scope to non-convex optimization problems the HVN method was hybridized with a multi-objective evolutionary algorithm (MOEA), which resulted in a competitive solver for continuous unconstrained bi-objective optimization problems. In this paper, we extend the HVN to constrained MOPs with in principle any number of objectives. We demonstrate the applicability of the extended HVN on a set of challenging benchmark problems and show that the new method can be readily be applied to solve equality constraints with a high precision problems, and to some extend also inequalities. We finally use HVN as local search engine within a MOEA and show the benefit of this hybrid method on several benchmark problems.

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

The practical application of a multi-objective optimization strategy based on evolutionary algorithms was proposed to optimize the plastics thermoforming process. For that purpose, the various steps of the process were considered individually and the optimization strategy was applied to the determination of the final part thickness distribution with the aim of demonstrating the validity of the methodology proposed. The preliminary results obtained considering three different theoretical initial sheet shapes indicates clearly that the methodology proposed is valid, as it provides solutions with physical meaning and with a great potential to be applied in real practice.

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

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.

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.

We introduce and discuss a generalization of the classical multi-objective optimization to pairs of functions. This procedure is referred to as bi-multi-objective optimization. A justification of this general optimization procedure is presented, related both to multi-objective optimization under ambiguity concerning individual preferences and to Pareto optimality for a family of preferences with nontransitive indifference. Incidentally, the binary relation naturally associated to a bi-multi-objective optimization problem is represented by a finite bi-multi-utility, which generalizes to the nontransitive case the classical finite multi-utility representation. An important application is presented to Markowitz portfolio selection under ambiguity concerning both the vector of returns and the covariance matrix.

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.

In real-life scenario, there are many mathematical tools to handle the incomplete and imprecise data. One of them is the fuzzy approach. This article aims to contribute to the literature of fuzzy multi-objective dynamic programming issues involving the fuzzy objective functions. The piecewise quadratic fuzzy numbers characterize these fuzzy parameters. Some basic notions in the problem under the α-pareto optimal solution concept is redefined and analyzed to study the stability of the problem. Furthermore, a technique, named as enhancing decomposition approach, is presented for achieving a subset for the parametric space that contains the sameα-pareto optimal solution. For a better understanding and comprehension of the suggested concept, a numerical example is provided.

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

The bottleneck in creating dynamic models of biological networks and processes often lies in estimating unknown kinetic model parameters from experimental data. In this regard, experimental conditions have a strong influence on parameter identifiability and should therefore be optimized to give the maximum information for parameter estimation. Existing model-based design of experiment (MBDOE) methods commonly rely on the Fisher Information Matrix (FIM) for defining a metric of data informativeness. When the model behavior is highly nonlinear, FIM-based criteria may lead to suboptimal designs since the FIM only accounts for the linear variation of the model outputs with respect to the parameters. In this work, we developed a multi-objective optimization (MOO) MBDOE, where model nonlinearity was taken into consideration through the use of curvature. The proposed MOO MBDOE involved maximizing data informativeness using a FIM-based metric and at the same time minimizing the model curvature. We demonstrated the advantages of the MOO MBDOE over existing FIM-based and other curvature-based MBDOEs in an application to the kinetic modeling of fed-batch fermentation of Baker's yeast.

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

Building facade design plays an essential role in enhancing energy efficiency and reducing environmental impact in high-performance building design. Balancing the conflicts among various building facade design parameters to satisfy different optimization objectives constitutes a highly complex optimization problem. The rapidly increasing number of studies demonstrates a significant interest in implementing multi-objective optimization methods to tackle building facade optimization problems. This study conducts a systematic review of optimization methods for building facade optimization (BFO). The optimization objectives and design variables are categorized based on their characteristics. The efficiency and effectiveness of optimization algorithms in addressing BFO problems are compared. Building optimization techniques and tools are showcased, along with their functions and limitations. Key findings highlight the robust feasibility and effectiveness of optimization algorithms, methods, and techniques in resolving a diverse range of BFO challenges. The limitations, challenges, and future potential of these methods are summarized and proposed.

The paper deals with the modelization and optimization of an integrated multi-component energy system. On-off operation and presence-absence of components must be described by means of binary decision variables, besides equality and inequality constraints; furthermore, the synthesis and the operation of the energy system should be optimized at the same time. In this paper a hierarchical optimization strategy is used, adopting a genetic algorithm in the higher optimization level, to choose the main binary decision variables, whilst a MILP algorithm is used in the lower level, to choose the optimal operation of the system and to supply the merit function to the genetic algorithm. The method is then applied to a distributed generation system, which has to be designed for a set of users located in the center of a small town in the North-East of Italy. The results show the advantage of distributed cogeneration, when the optimal synthesis and operation of the whole system are adopted, and significant reduction in the computing time by using the proposed two-level optimization procedure.

: Polymer single screw extrusion is a major industrial processing technique used to obtain plastics products. To assure high outputs, tight dimensional tolerances, and excellent product performance, extruder screws may show different design characteristics. Barrier screws, which contain a second flight in the compression zone, have become quite popular as they promote and stabilize polymer melting. Therefore, it is important to design efficiently extruder screws and decide whether a conventional screw will do the job efficiently, or a barrier-screw should be considered instead. This work uses multi-objective evolutionary algorithms to design conventional and barrier screws (Maillefer screws will be studied) with optimized geometry. Processing of two polymers, Low Density Polyethylene and Polypropylene, is analyzed. A methodology based on the use of Artificial Intelligence (AI) techniques, namely data mining, decision making and evolutionary algorithms, is presented and utilized to obtain results with practical significance, based on relevant performance measures (objectives) used in the optimization. For the various case studies selected, Maillefer screws were generally advantageous for processing LDPE, while for PP the use of both types of screws would be feasible.

Although different assessments and evaluations of Dual-Miller cycle performed, specified output power and thermal performance associated with engine determined. Besides, multi objective optimization of thermal efficiency, Ecological Coefficient of performance ( ) and Ecological function ( ) by the mean of NSGA-II technique and thermodynamic analysis performed. The Pareto optimal frontier obtaining the best optimum solution is chosen by fuzzy Bellman-Zadeh, LINMAP, and TOPSIS decision-making techniques. Based on the results, performances of dual-Miller cycles and their optimization are improved.

Blasting pattern optimization is an attempt to optimize blast design parameters aiming to achieve optimum fragmentation, reduce mining operating costs as well as environmental side consequences. The present study aims to propose a multi-objective optimization model, employing artificial intelligence and metaheuristics, to simultaneously minimize the mine-to-crusher operating costs and the impact of blasting consequences including fly-rock and back-break. To achieve the purpose of the study, a multi-variable regression model was developed to model total costs from drilling to crushing. In addition to the costs, multilayer perception neural networks were implemented to predict the blast-induced back-break and fly-rock as a function of collected variables such as number of holes, hole length, burden, spacing, hole slope, stemming, blasted rock per hole, powder factor, and charge per delay. High-precise estimations for both back-break and fly-rock were achieved with the average of 99% coefficient of determination for train, test and validation data sets. Then, the developed regression model and the neural networks were used in an optimization framework, employing Grasshopper algorithm, to find the optimum blast design satisfying practical constraints. The proposed model was tested on a lead-zinc open-pit mine, where 1032 blasting patterns were recorded and analyzed. The results of the optimization model provide a Pareto set of solutions, such that any of these solutions can be implemented according to the strategy of the mining operation management team. The blast pattern with the lowest cost, result in a relatively high fly-rock and back-break, while the pattern with low fly-rock and back-break raises the cost by 20.13 % compared the minimum cost blast design.

The optimization of the production process of metal mines has been traditionally driven only by economic benefits while ignoring resource efficiency. However, it has become increasingly aware of the importance of resource efficiency since mineral resource reserves continue to decrease while the demand continues to grow. To better utilize the mineral resources for sustainable development, this paper proposes a multi-objective optimization model of the production process of metal mines considering both economic benefits and resource efficiency. Specifically, the goals of the proposed model are to maximize the profit and resource utilization rate. Then, the fast and elitist Non-Dominated Sorting Genetic Algorithm (NSGA-II) is used to optimize the multi-objective optimization model. The proposed model has been applied to the optimization of the production process of a stage in the Huogeqi Copper Mine. The optimization results provide a set of Pareto-optimal solutions that can meet varying needs of decision makers. Moreover, compared with those of the current production indicators, the profit and resource utilization rate of some points in the optimization results can increase respectively by 2.99% and 2.64%. Additionally, the effects of the decision variables (geological cut-off grade, minimum industrial grade and loss ratio) on objective functions (profit and resource utilization rate) were discussed using variance analysis. The sensitivities of the Pareto-optimal solutions to the unit copper concentrate price were studied. The results show that the Pareto-optimal solutions at higher profits (with lower resource utilization rates) are more sensitive to the unit copper concentrate prices than those obtained in regions with lower profits.

In order to improve the performance of the draft tube in hydraulic turbine, a multi–objective optimization method for the draft tube is developed by combining the design of experiment (DOE), the radial basis function (RBF) and the non–dominated sorting genetic algorithm (NSGA–II) in this paper. The geometrical design variables of the median section in the draft tube and the cross section in its exit diffuser are considered as design parameters in this optimization, which objective function is to maximize the pressure recovery factor (Cp) and minimize the energy loss coefficient (ζ). The limited numbers of design matrix required for the shape optimization of the draft tube is generated by optimal Latin hypercube (OLH) method of the DOE technique, of which performances are evaluated through computational fluid dynamic (CFD) numerical simulation. For reducing of the computational consumption, the approximate model is used based on the RBF. The Pareto optimal solutions are finally performed using the NSGA–II for obtaining the best geometrical parameters of the draft tube. The optimization result of the draft tube shows a marked performance improvement over the original, which verifies the theoretical validity and feasibility of the proposed method in this paper.

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

The weight coefficients of the diaphragm spring depend on experiences in the traditional optimization. However, this method not only cannot guarantee the optimal solution but it is also not universal. Therefore, a new optimization target function is proposed. The new function takes the minimum of average compress force changing of the spring and the minimum force of the separation as total objectives. Based on the optimization function, the result of the clutch diaphragm spring in a car is analyzed by the non-dominated sorting genetic algorithm (NSGA-II) and the solution set of Pareto is obtained. The results show that the pressing force of the diaphragm spring is improved by 4.09%by the new algorithmand the steering separation force is improved by 6.55%, which has better stability and steering portability. The problem of the weight coefficient in the traditional empirical design is solved. The pressing force of the optimized diaphragm spring varied slightly during the abrasion range of the friction film, and the manipulation became remarkably light.

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

Recycling waste products is an environmental-friendly activity that can bring benefits to accompany, saving manufacturing costs and improving economic efficiency. For the beer industry, recycling bottles can reduce manufacturing costs and reduce the industry's carbon footprint. This paper presents a model for a multi-objective collection-distribution center location and allocation problem in a closed loop supply chain for the beer industry, in which the objective is to minimize total costs and transportation pollution. Uncertainties in the form of randomness and fuzziness are jointly handled in this paper to ensure a more practical problem solution, for which returned bottle sand unusable bottles are considered fuzzy random variables. A heuristic algorithm based on priority-based global-local-neighbor particle swarm optimization (pb-glnPSO) is applied to ensure reliable solutions for this NP-hard problem. A case study on a beer operation company is conducted to illustrate the application of the proposed model and demonstrate the priority-based global-local-neighbor particle swarm optimization.

Neural-objective and image optimization approaches for drilling fluid rheology automation are crucial for drilling engineering optimization. A myriad of intelligent computational models are employed to predict and monitor the parameters of mud rheology and filter cake permeability posture using an artificial neural network feedforward (ANN-FF) function, a non-ANN-FF function, an image processing tool, and a model optimization tool. 498 datasets of synthetic-based mud (SBM) flat rheology from a drilling mud laboratory at Nazarbayev University were imported into a user-friendly MATLAB application using image processing and nftool. Apart from the Google TensorFlow Sequential API DNN architecture used, a Levenberg-Marquardt training algorithm with input sigmoid hidden neurons 10, 12, and 18 coupled with a linear output layer was also used to predict the SBM flow index. OBM and SBM filter cakes were processed for void spaces; however, a model study was extrapolated to maximize filtration volume Vf. The study’s findings show that the ANN-FF model employed for rheological property monitoring and prediction had higher steady and exponential levels of accuracy and a correlation coefficient of 0.96-0.99. More so, SBM and OBM image processing presented an area of void spaces of 1790M2 and 1739M2, respectively. The porosity and permeability postures of both SBM and OBM resulted in a significant void space capable of maximizing the flow index. In addition, the single-objective modelling based on a genetic algorithm did validate the experimental rheological data for flow index or filtration volume Vf optimization; the study resulted in the finding that the constrained physics-informed objective function hindered maximizing oil recovery and instead predicted possible formation damage. It is empirical to note that automating flow predictions with neural, objective, and image functions has presented an alternative novel method for non-programmers using MATLAB and Google Colabs that is capable of enhancing mud rheological parameters, drilling efficiency, and hydrocarbon recovery.

This study will lead to the development of a numerical data set that will assist in the design of Savonius wind turbines. A major objective of this study is to develop a better design for Savonius turbine blades in order to increase their torque coefficients, rotational speeds, and pressure coefficients. As part of the experimental design methodology, a full dataset was generated by simulating three-dimensional scale models utilizing computational fluid dynamics (CFD) simulations that were validated by wind tunnel data. This process is multi-objective optimization for optimizing turbine performance. The twist angle, aspect ratio, and overlap ratio are all important factors in determining the optimal torque and power coefficients. The group method of data handling (GMDH) algorithm was utilized to model objective functions based on input-output data. The Pareto fronts were plotted using polynomial models obtained from the evolutionary Pareto-based optimization approach (modified NSGA-II), and the optimal commercial points were determined using TOPSIS. A comparison of three- and two-objective optimization data revealed that two-objective optimization data lie within the boundaries of a three-objective optimization problem. The torque coefficient, rotational speed, and power coefficient are all improved by 13.74%, 0.071%, and 5.32%, respectively, using multi-objective optimization. As a result of the multi-objective optimization of the turbine, some significant characteristics of objective functions were discovered.

In this paper, we generalize the problems of finding simple polygons with the minimum area, maximum perimeter and maximum number of vertices so that they contain a given set of points and their angles are bounded by $\alpha+\pi$ where $\alpha$ ($0\leq\alpha\leq \pi$) is a parameter. We also consider the maximum angle of each possible simple polygon crossing a given set of points, and derive an upper bound for the minimum of these angles. The correspondence between the problems of finding simple polygons with the minimum area and maximum number of vertices is investigated from a theoretical perspective. We formulate the three generalized problems as nonlinear programming models, and then present a Genetic Algorithm to solve them. Finally, the computed solutions are evaluated on several datasets and the results are compared with those from the optimal approach.

There exist numerous high-dimensional problems in the real world which cannot be solved through the common traditional methods. The metaheuristic algorithms have been developed as successful techniques for solving a variety of complex and difficult optimization problems. Notwithstanding their advantages, these algorithms may turn out to have weak points such as lower population diversity and lower convergence rate when facing complex high-dimensional problems. An appropriate approach to solve such problems is to apply multi-agent systems along with the metaheuristic algorithms. The present paper proposes a new approach based on the multi-agent systems and the concept of agent, which is named Multi-Agent Metaheuristic (MAMH) method. In the proposed approach, several basic and powerful metaheuristic algorithms, including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Firefly Algorithm (FA), Bat Algorithm (BA), Flower Pollination Algorithm (FPA), Gray Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Crow Search Algorithm (CSA), Farmland Fertility Algorithm (FFA), are considered as separate agents each of which sought to achieve its own goals while competing and cooperating with others to achieve the common goals. In overall, the proposed method was tested on 32 complex benchmark functions, the results of which indicated effectiveness and powerfulness of the proposed method for solving the high-dimensional optimization problems. In addition, in this paper, the binary version of the proposed approach, called Binary MAMH (BMAMH), was executed on the spam email dataset. According to the results, the proposed method exhibited a higher precision in detection of the spam emails compared to other metaheuristic algorithms and methods.

The ultimate aim of dynamic load balancing in cloud computing systems is to maximise the efficiency with which resources are utilised and workloads are distributed. Given that load balancing is a multi-objective process and that response time is a priority, the Harris hawk optimisation (HHO) algorithm was developed as a unique solution for dynamic load balancing. Based on burden distribution and resource utilisation, the HHO algorithm is responsible for dynamically assigning workloads to virtual machines (VMs). Through iterative interactions and position updates, the hawks investigate the solution space, determine the optimal method for dividing the work, and adapt to the ever-changing conditions of the workload. The HHO algorithm has been demonstrated to be effective and efficient in the management of dynamic load balancing via a series of experimental evaluations and comparisons with other load-balancing approaches. These discoveries have led to quicker response times and more efficient resource utilisation. Utilising the collaborative search behaviour of hawks, this technique provides a solution that is both practicable and effective for addressing load balancing concerns in dynamic scenarios.

Energy demand and consumption in recent times have witnessed a rapid proliferation influenced by technological developments, increased population and economic growth. This has fuelled research trends in the domain of energy management employing tri-generation systems such as the combined cooling, heating and power (CCHP) systems. Furthermore, the incorporation of renewable energy, especially solar energy, to complement the thermal input by fossil fuels has facilitated the effectiveness and sustainability of CCHP systems. This study proposes a new approach to improve the overall efficiency of CCHP systems and compute the optimal design parameters in order to assist decision makers to identify the best geometrical configuration. A multi-objective optimization formulation of a solar-assisted CCHP system was adopted to maximize the net power, the exergy efficiency and minimize the CO2 emission using the greywolf optimization technique. In addition, the effects of the decision variables on the objective functions were analysed. The proposed optimization approach yielded 100 set of Pareto optimal solutions which would serve as options to the decision maker to make a selection in order to improve the performance of a solar-assisted CCHP system. This study demonstrates that the proposed approach is potentially suitable for the optimization of a solar-assisted CCHP system.

The innovation driven Industry 5.0, in agreement with Industry 4.0, leads to consider human in a prominence position as the center of manufacturing field. This pushes towards the hybridization of manufacturing plants promoting a fully collaboration between human and robot. Furthermore, the new paradigm of "human centred design" and "anthropocentric design" allows enabling a synergistic combination of human and robot skills. However, properly collaborative workplaces are currently very few. Industry is still not confident, and systems integrators hesitate to venture into Human-Robot Collaboration (HRC). Despite the effort in collaborative robotics, a general solution to overcome the current limitations in designing of collaborative workplaces still misses. In the current work, a Knowledge-Based Approach (KBA) is adopted to face collaborative workplace designing problem. The framework resulting from the KBA allows developing a modelling paradigm that enable to define a streamlined approach for the layout designing of a collaborative workplace. Finally, a what-if analysis and a ANOVA analysis are performed to generate and evaluate a set of scenarios related to a collaborative workplace for quality inspection of welded parts. Facing the high complexity and multidisciplinary of HRC can be conveyed to develop a general design approach aimed at overcoming the difficulties that limit the spread of HRC in the manufacturing field.

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

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.

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

The hybrid system is analyzed and optimized to produce electric energy in Non-Interconnected Zones in the Colombian Caribbean region, contributing both to the improvement in the reduction of greenhouse gas emissions and to the rational use of energy. A comparative analysis of the performance of these systems was carried using a dynamic model in real wind and solar data. The model is integrated by a Southwest Wind Power Inc. wind turbine. AIR 403, a proton exchange fuel cell (PEM), an electrolyze, a solar panel and a charge regulator based on PID controllers to manipulate oxygen and hydrogen flows in the cell. The transient responses of the cell voltage, current, and power were obtained for the demand of 200 W for changes in solar radiation and wind speed for all days of the year 2013 in the Ernesto Cortissoz airport, Puerto Bolívar, Alfonso Lopez airport and Simon Bolívar airport, by regulating the flow of hydrogen and oxygen into the fuel cell. The maximum contribution of power generation from the fuel cell was presented for the Simon Bolívar airport in November with a value of 158,358W (9.45%). A multi-objective design optimization under a Pareto front is presented for each place studied to minimize the Levelized Cost of Energy and CO₂ emission, where the objective variables are the number of panel and stack in the PV system and PEM.

Under high-frequency operating conditions, the high-speed solenoid valve (HSV) experiences energy loss and heat generation, which significantly impact its operational lifetime. Reducing the energy loss of HSV without compromising its opening response characteristics poses a significant challenge. To address this issue, a finite element simulation model of HSV coupled with a current feedback model is constructed to investigate the synergistic effects of dynamic response and energy loss. Predictive models for the opening response time, HSV driving energy, and Joule energy using Back Propagation neural network (BPNN) are established. Furthermore, a multi-objective optimization study on the current driving strategy using Non-dominated Sorting Genetic Algorithm II (NSGA-II) is conducted. After optimization, although there was a 6.24% increase in the opening response time, both HSV drive energy and Joule energy were significantly reduced by 15.67% and 22.49%, respectively. The proposed multi-objective optimization method for HSV driving strategy holds great significance in improving its working durability.

The optimization of guide vane closing schemes (OGVCS) of pumped storage hydro unit (PSHU) is the research field of cooperative control and optimal operation of pumped storage, wind power and solar power generation. This paper presents a OGVCS model of PSHU considering the rise rate of the unit rotational speed and the specific node pressure of each hydraulic unit, as well as various complicated hydraulic and mechanical constraints. OGVCS model is formulated as a multi-objective optimization problem to optimize conflictive objectives, i.e., unit rotational speed and water hammer pressure criteria. In order to realize the efficient solution of the OGVCS model, an enhanced multi-objective bacterial-foraging chemotaxis gravitational search algorithm (EMOBCGSA) is proposed to solve this problem, which adopts population reconstruction, adaptive selection chemotaxis operator of local searching strategy and Elite archive set to efficiently solve the multi-objective problem. Especially, novel constraints-handling strategy with eliminating and local search based on violation ranking is used to balance various hydraulic and mechanical constraints. Finally, simulation cases of complex extreme operating conditions (i.e., load rejection and pump outage) of ‘single tube-double units’ type PSHU system are conducted to verify the feasibility and effectiveness of the proposed EMOBCGSA in solving OGVCS problem. The simulation results indicate that the proposed EMOBCGSA can provide lower rise rate of the unit rotational speed and smaller water hammer pressure than other method established recently while considering various complex constraints in OGVCS problem.

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.

Real-world optimization problems are often gov- erned by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Opti- mization Problems (COPs) fueled by advances in computational power. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose a novel hybrid Evolutionary Algorithm based on the Differential Evolution algorithm and Adaptive Parameter Gaining Sharing Knowledge-based algo- rithm to solve global real-world constrained parameter space. The proposed CHAGSKODE algorithm leverages the power of multiple adaptation strategies concerning the control parameters, search mechanisms, as well as uses knowledge sharing between junior and senior phases. We test our method on the benchmark functions taken from the CEC2020 special session & competition on real-world constrained optimization. Experimental results indicate that CHAGSKODE is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

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

In this paper, our goal is to establish the relationship between solutions of local sharp vector variational type inequality and sharp efficient solutions of vector optimization problems, also Minty local sharp vector variational type inequality and sharp efficient solutions of vector optimization problems, under generalized approximate $\eta$-convexity conditions for locally Lipschitzian functions

An approach to estimating the objective function value of minimization maximum lateness problem is proposed. It is shown how to use transformed instances to define a new continuous objective function. After that, using this new objective function, the approach itself is formulated. We calculate the objective function value for some polynomially solvable transformed instances and use them as interpolation nodes to estimate the objective function of the initial instance. What is more, two new polynomial cases, that are easy to use in the approach, are proposed. In the end of the paper numeric experiments are described and their results are provided.

The capital allocation framework proposed by [] presents capital allocation principles as solutions to particular optimization problems and provides a general solution of the quadratic allocation problem via a geometric proof. However, the widely used haircut allocation principle is not reconcilable with that optimization setting. In this paper we provide an alternative proof of the quadratic allocation problem based on the Lagrange multipliers method to reach the general solution. We show that the haircut allocation principle can be accommodated to the optimization setting with the quadratic optimization criterion if one of the original conditions is relaxed. Two examples are provided to illustrate the accommodation of this allocation principle.

Interval-valued functions have been widely used to accommodate data inexactness in optimization and decision theory. In this paper, we study interval-valued vector optimization problems, and derive their relationships to interval variational inequality problems, of both Stampacchia and Minty types. Using the concept of interval approximate convexity, we establish necessary and sufficient optimality conditions for local strong quasi and approximate $LU$-efficient solutions to nonsmooth optimization problems with interval-valued multiobjective functions.

The overall cost of a hydropower plant is mainly due to the expenses for civil works, mechanical equipment (turbine and control units) and electrical components. The goal of a new draft tube design is to obtain a geometry that reduces investment costs, especially the excavation ones, but the primary driver is to increase the overall machine efficiency allowing for reduced payback time. In the present study, an optimization study of the elbow-draft tube assembly of a Kaplan turbine was conducted. A CFD model for the complete turbine has been developed and validated; next, an optimization of the draft tube alone was performed using a Design of Experiments technique; finally, several optimum solutions for the draft tube were obtained using a Response Surface technique aiming at maximizing pressure recovery and minimizing flow losses. A selection of optimized geometries was subsequently post-checked using the validated model of the entire turbine and a detailed flow analysis on the obtained results could make it possible to provide insight into the improved designs. It was observed that efficiency could be improved by 1% (in relative terms), and the mechanical power increased by 1,8% (in relative terms) with respect to the baseline turbine.

The problem of scheduling is an area that has attracted a lot of attention from researchers for many years. Its goal is to optimize resources in the system. The assigning task to the lecturer is an example of the timetabling problem, a class of scheduling. This study introduces a mathematical model to assign fixed tasks (the time and required skills to be fixed) to university lecturers. Our model is capable of generating a calendar that maximizes faculty expectations. The formulated problem is in the form of a multi-objective problem that optimal makes decisions require the trade-off presence of trade-offs between two or more conflicting objectives. To solve this, we use the Compromise Programming approach to multi-objective programming. We then proposed the new version of the Genetic Algorithm to solve the introduced model. Finally, the model and algorithm tested with real scheduling data collected at the Computing Fundamental Department, FPT University, Hanoi, Vietnam.

The container relocation problem (CRP) is one of the important topics in container terminals, which aims to find the optimal sequence of movements to minimize the total number of relocations needed to retrieve all the containers within a bay according to a given specific layout and retrieval order. However, determining such an order may be difficult due to uncertainty. Various CRP solution methods proposed so far show a common pitfall concerning the complexity of the solving process, whose scale grows exponentially with the number of containers. Considering the retrieval operation process of the inbound containers in a bay consists of several operation rounds, this paper focuses on the real-time operation scenario of each round to minimize the actual number of relocations during the pick-up process, i.e., starting from the initial layout of the bay, we minimize the sum of the incremental number of blocking containers due to the layout change and the number of reallocated containers unrelated to the target container. We present a heuristic algorithm (called SPFH) based on the three rules (LL, MSS, and FSS), considering the adjustment of the pick-up order of containers. Numerical experiments on a set of instances generated from the literature are performed. The proposed methodology excels in both execution efficiency and solution quality and is capable of solving instances that were impossible to solve before. This also makes our methods appealing for being applied in practice. The source codes are available at https://github.com/zhou-sf/rt-scrp.

Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. The advances in algorithms and the increasing interest in Pareto optimal solutions have led to a wide range of new applications related to optimal and feedback control which results in new challenges such as expensive models or real-time applicability. Since the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging which is particularly problematic when the objectives are costly to evaluate or when a solution has to be presented very quickly. This article gives an overview over recent developments in accelerating multiobjective optimal control for complex problems where either PDE constraints are present or where a feedback behavior has to be achieved. In the first case, surrogate models yield significant speed-ups. Besides classical meta-modeling techniques for multiobjective optimization, a promising alternative for control problems is to introduce a surrogate model for the system dynamics. In the case of real-time requirements, various promising model predictive control approaches have been proposed, using either fast online solvers or offline-online decomposition. We also briefly comment on dimension reduction in many-objective optimization problems as another technique for reducing the numerical effort.

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

Continuous Distributed Constraint Optimization Problem (C-DCOPs) are a powerful framework to model problems with continuous variables in multi-agent systems. Previous works about C-DCOP algorithms mainly use pseudo-trees to guarantee the anytime property or are without anytime property guarantees. However, there is a risk of privacy leakage in the pseudo-tree due to utility passing between agents. Therefore, based on the basic constraint graph instead of the pseudo-tree, we (i) extend the Maximum Gain Message (MGM) algorithm by combining the local search strategy to solve C-DCOPs, named Continuous MGM (C-MGM), and it’s able to guarantee the monotonicity of the solution quality; (ii) propose a Parallel C-MGM (C-PMGM) algorithm to improve the solution quality through parallel random search; and (iii) introduce the differential search into C-PMGM to design a Parallel Differential Search C-MGM (C-PDSM) algorithm, which constructs a heuristic method to speed up convergence and improve solution quality. Compared to other anytime C-DCOP algorithms using pseudo-trees, the proposed three algorithms can exhibit better performance in avoiding privacy violations. We theoretically prove that the proposed algorithms are the anytime algorithms and empirically demonstrate that our algorithms outperform the state-of-the-art C-DCOP algorithms.

A new model predictive control (MPC) algorithm is used to select optimal air conditioning setpoints for a commercial office building, considering variable electricity prices, weather, occupancy and lighting. This algorithm, Cost-Comfort Particle Swarm Optimization (CCPSO), is the first to combine a realistic, smooth representation of occupants’ willingness to pay for thermal comfort with a bottom-up, non-linear model of the building and air conditioning system under control. We find that using a quadratic preference function for temperature can yield solutions that are both more comfortable and lower-cost than previous work that used a ``brick wall'' preference function with no preference for further cooling within an allowed temperature band and infinite aversion to going outside the allowed band. Using historical pricing data for a summer month in Chicago, CCPSO provided a 3\% reduction in costs vs. a ``brick-wall'' MPC approach with similar comfort and 13\% reduction in costs vs. a standard night setback strategy. CCPSO also reduced peak-hours demand by 3\% vs. the ``brick-wall'' strategy and 15\% vs. standard night-setback. At the same time, the CCPSO strategy increased off-peak energy consumption by 15\% vs. the ``brick-wall'' strategy. This may be valuable for power systems integrating large amounts of renewable power, which can otherwise become uneconomic due to saturation of demand during off-peak hours.

Real-world optimization problems are often governed by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Optimization Problems (COPs) fueled by advances in computational intelligence. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose an ensemble of multi- method hybrid EA framework with four mutation operators, two crossover operators, multi-search [Differential Evolution (DE) & Gaining Sharing Knowledge (GSK)] optimization algorithm, and ensemble of constraint handling techniques to solve global real- world constrained optimization problem. The proposed frame- work FEPEA has an ascendancy of multiple adaptation strategies concerning the control parameters, search mechanisms, two sub-populations as well as uses knowledge sharing mechanism between junior and senior phases. The algorithm also combines the power of four popular constraint handling techniques (CHT) and uses a voting mechanism to select any particular CHT. On top of that, this algorithm also uses both linear and non- linear population size reduction in every step of the evolutionary process. We test our method on 57 real-world problems provided as part of the CEC 2020 special session & competition on real- world constrained optimization benchmark suite. Experimental results indicate that FEPEA is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

In the past, Unmanned Aerial Vehicles (UAVs) were mostly used in the military operations to prevent pilot losses. Nowadays, the fast technological evolution enables the production of a class of cost-effective UAVs which can service a plethora of public and civilian applications, specially when configured to work cooperatively to accomplish a task. However, designing a communication network among the UAVs is challenging task. In this article, we propose a centralized UAV placement strategy, where UAVs are used as flying access points forming a mesh network, providing connectivity to ground nodes deployed in a target area. The geographical placement of UAVs is optimized based on a Multi-Objective Evolutionary Algorithm (MOEA). The goal of the proposed scheme is to cover all ground nodes using a minimum number of UAVs, while maximizing the fulfillment of their data rate requirements. The UAVs can employ different data rates depending on the channel conditions, which are expressed by the Signal-to-Noise-Ratio (SNR). In this work, elitist Non-Dominated Sorting Genetic Algorithm II (NSGA-II) is used to find a set of optimal positions to place UAVs, given the positions of the ground nodes. We evaluate the trade-off between the number of UAVs used to cover the target area and the data rate requirement of the ground nodes. Simulation results show that the proposed algorithm can optimize the UAV placement given the requirement and the positions of the ground nodes in the geographical area.

The energy-intensive sector of the cement industry needs to find technologically advanced methods to produce cement with as little energy as possible, without polluting the environment and without sacrificing the quality (fineness) of the cement. In addition, the stress on the machines changes the behavior of the data. By combining the k-means method, two (2) feature selection methods, nine (9) machine learning methods, and the differential evolution (DE) method, a dynamic system is created where the user determines the key performance indicators (KPIs) each time. The user has the potential to control the distribution of the data, the input of machine learning models, and the ability to switch the system to the suggested values without damage. The selection of the best-performing models is based on the normalized root mean squared error (NRMSE). The DE method optimizes the dynamic objective function. The optimal values of the manipulated variables are evaluated compared to the value of the objective function from the actual values of the variables. In all experiments, the recommendations are acceptable. The final results show an improvement in the operation of both the cement mill and kiln compared to the current operating condition.

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.

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

Quantum computing is an emerging field that have given a significant impact on optimization. Among the diverse quantum algorithm, the quantum gradient descent has become a prominent technique for solving unconstrained optimization problems. In this paper, we propose a quantum-spectral Polak-Ribi{\'e}re-Polyak (PRP) conjugate gradient approach. The technique is considered as a generalization of the spectral PRP method which employs a $q$-gradient that approximate the classical gradient with quadratically better dependence on the quantum variable $q$. Additionally, the proposed method reduces to the classical variant as quantum variable $q$ gets closer to $1$. The quantum search direction always satisfies the sufficient descent condition and does not depend on any line search. This approach is globally convergent with the standard Wolfe line search without any convexity assumption. Numerical experiments are conducted and compared with the existing approach to demonstrate the improvement of the proposed strategy.

Abstract: Safety issues related to the electrification of more electric aircraft (MEA) need to be addressed because of the increasing complexity of aircraft electrical power systems and the growing number of safety-critical sub-systems that need to be powered. Managing the energy storage systems and the flexibility in the load-side plays an important role in preserving the system’s safety when facing an energy shortage. This paper presents a system-level centralized operation management strategy based on model predictive control (MPC) for MEA to schedule battery systems and exploit flexibility in the demand-side while satisfying time-varying operational requirements. The proposed online control strategy aims to maintain energy storage (ES) and prolong the battery life cycle, while minimizing load shedding, with fewer switching activities to improve devices lifetime and to avoid unnecessary transients. Using a mixed-integer linear programming (MILP) formulation, different objective functions are proposed to realize the control targets, with soft constraints improving the robustness of the model. Besides, an evaluation framework is proposed to analyze the effects of various objective functions and the prediction horizon on system performance, which provides the designers and users of MEA and other complex systems with new insights into operation management problem formulation.

A method was developed to perform shape optimization of a tidal stream turbine hydrofoil using a multi-objective genetic algorithm. A bezier curve parameterized the refrence hydrofoil profoil NACA 63815. Shape optimization of this hydrofoil maximized its lift-to-darg ratio and minimized its pressure coefficient, thereby increasing the turbines power output power and improving its cavitation characteristics. The Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) was employed to perform the shape optimization. A comparative study of two-and three-dimensional optimizations was carried out. The effect of varing the angle of attack on the quality of optimized results was also studied. predictions based on two-dimensional panel method results was also studied. Preditions based on a two-dimensional panel method and on a computational fluid dynamics code were compared to experimental measurments.

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.

In this paper, stochastic multi-objective intelligent framework (MOIF) is performed for distribution network reconfiguration to minimize power losses, the number of voltage sags, the system's average RMS fluctuation, the average system interruption frequency (ASIFI), the momentary average interruption frequency (MAIFI), and the system average interruption frequency (SAIFI) considering the network uncertainty. The unscented transformation (UT) approach is applied to model the demand uncertainty due to simplicity to implement and no presumptions to simplify. A human-inspired intelligent method named improved mountaineering team-based optimization (IMTBO) is applied to determine the decision variables defined as the network's optimal configuration. The conventional MTBO is improved using a quasi-opposition-based learning strategy to overcome premature convergence and achieve the optimal solution. The simulation results showed that in single- and double-objective optimization, some objectives are weakened compared to their base value, while the results of the MOIF indicated a fair compromise between different objectives, and all objectives are improved. The results of MOIF based on the IMTBO cleared that the losses are reduced by 30.94%, the voltage sag numbers and average RMS fluctuation are reduced by 33.68% and 33.65%, and also ASIFI, MAIFI, and SAIFI are improved by 6.80%, 44.61%, and 0.73%, respectively. Also, the superior capability of the MOIF based on the IMTBO is proved compared to the conventional MTBO, particle swarm optimization, and artificial electric field algorithm. Moreover, the results of the stochastic MOIF based on the UT showed the power loss increased by 7.62%, voltage sag, and SARFI increased by 5.39% and 5.31%, and ASIFI, MAIFI, and SAIFI weakened by 2.28%, 6.61%, and 1.48%, respectively compared to the deterministic MOIF model.

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

An active power dispatch method for a microgrid (MG) with multi-type loads, renewable energy sources (RESs) and distributed energy storage devices (DESDs) is the focus of this paper. The MG operates in a grid-connected model, and distributed power sources contribute to the service for load demands. The outputs of multiple DESDs are controlled to optimize the active power dispatch. Our goal with optimization is to reduce the economic cost under time-of-use (TOU) price, and to adjust the excessively high or low load rate of distributed transformers (DTs) caused by the peak-valley demand and load uncertainties. To simulate a practical environment, the stochastic characteristics of multi-type loads are formulated. The transition matrix of system state is provided. Then, a finite-horizon Markov decision process (FHMDP) model is established to describe the dispatch optimization problem. A learning-based technique is adopted to search the optimal joint control policy of multiple DESDs. Finally, simulation experiments are performed to validate the effectiveness of the proposed method, and the fuzzification analysis of the method is presented.

In response to the structural optimization problem of PCB stator coreless disc motors, the orthogonal response surface method was used to optimize the motor structure, determine the basic parameters of the motor preliminarily, and conduct orthogonal experiments on the motor parameters based on the optimization design objectives, The optimization factors were the quantity of magnetic pole of the motor rotor, the ratio of main/auxiliary pole size, the thicknessof the permanent magnet, and the air gap length.The motor torque，the amplitude of magnetic density of the air gap and waveform distortion rateare used as optimization objectives. The motor parameters that make the motor torque reach the maximum, the air gap magnetic density maximum, and the waveform distortion rate minimum. Due to the use of PCB plates instead of motor stator cores in PCB coreless disc motors,The service life of the PCB board during motor operation will be reduced with the temperature rise generated by the stator winding To solve this problem, the response surface analysis of the motor is carried out to reduce the temperature rise of the stator windings during the operation of the motor. PCB board and stator winding are the main factors affecting the temperature rise of the motor.Taking the thickness of the PCB board, the hole diameter on the board, and the uneven width of the stator winding as optimization factors, the motor parameters with the lowest temperature rise of the motor winding are obtained. Simulation analysis is conducted using Ansys/Maxwell software, and the results prove the feasibility of optimization.

The food distribution process is responsible for significant quality loss in perishable products. However, preserving quality is costly and consumes a tremendous amount of energy. To tackle the challenge of minimizing transportation costs and CO2 emissions while also maximizing product freshness, a novel multi-objective model is proposed. The model integrates a vehicle routing problem with temperature, shelf life, and energy consumption prediction models, thereby enhancing its accuracy. Non-dominated sorting genetic algorithm II is adapted to solve the proposed model for the set of Solomon test data. The conflicting nature of these objectives and the sensitivity of the model to shelf life and shipping container temperature settings are analyzed. The results show that optimizing freshness objective degrade the cost and the emission objectives, and the distribution of perishable foods are sensible to the shelf life of the perishable foods and temperature settings inside the container.

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

Wind power as a renewable source of energy, has numerous economic, environmental and social benefits. In order to enhance and control the renewable wind power, it is vital to utilize models that predict wind speed with high accuracy. Due to neglecting of requirement and significance of data preprocessing and disregarding the inadequacy of using a single predicting model, many traditional models have poor performance in wind speed prediction. In the current study, for predicting wind speed at target stations in the north of Iran, the combination of a multi-layer perceptron model (MLP) with the Whale Optimization Algorithm (WOA) used to build new method (MLP-WOA) with a limited set of data (2004-2014). Then, the MLP-WOA model was utilized at each of the ten target stations, with the nine stations for training and tenth station for testing (namely: Astara, Bandar-E-Anzali, Rasht, Manjil, Jirandeh, Talesh, Kiyashahr, Lahijan, Masuleh and Deylaman) to increase the accuracy of the subsequent hybrid model. Capability of the hybrid model in wind speed forecasting at each target station was compared with the MLP model without the WOA optimizer. To determine definite results, numerous statistical performances were utilized. For all ten target stations, the MLP-WOA model had precise outcomes than the standalone MLP model. The hybrid model had acceptable performances with lower amounts of the RMSE, SI and RE parameters and higher values of NSE, WI and KGE parameters. It was concluded that WOA optimization algorithm can improve prediction accuracy of MLP model and may be recommended for accurate wind speed prediction.

This paper introduces a novel multi-strategy enhanced dung beetle optimization (MSDBO) algorithm that is designed to address several issues identified in the standard dung beetle optimization algorithm. Specifically, the MSDBO aims to enhance convergence speed, reduce susceptibility to local optima, and increase search accuracy. By incorporating three strategies: tent chaotic mapping for population initialization, the golden sinusoidal strategy for position updating, and the Lévy flight strategy for balancing exploration and exploitation, the standard dung beetle optimization algorithm is enhanced. The MSDBO algorithm is evaluated using twelve benchmark test functions and compared against five state-of-the-art algorithms. The results consistently show that MSDBO exhibits faster convergence speeds and more accurate solutions than the other algorithms across most of the test functions. In addition, MSDBO is also applied to optimize the parameters of a valve plate, including the close angle, cross angle, triangle groove sizes, and wrap angle. The optimization outcomes reveal that MSDBO effectively minimizes pressure ripples in the piston chamber, resulting in reduced flow rate fluctuations and noise emission compared to the initial design. This study highlights the potential of the MSDBO algorithm in tackling complex nonlinear engineering optimization problems.

Robot Operating System 2 (ROS 2) is a robotic software that uses a set of Quality of Service (QoS) policies to manage the quality of robot data transmissions in a network, such as the RELIABLE and KEEP_LAST options. In ROS 2 node communication, the RELIABLE connection guarantees that all message data can be properly sent from the publisher to the subscriber. However, strict reliability is not guaranteed if the RELIABLE connection uses the KEEP_LAST option to transmit the robot data in the publish-subscribe communication. This study aims to analyze the efficiency of local cache, cache control, and QoS balancing optimization to improve ROS 2 node communication when using the RELIABLE and KEEP_LAST options to transmit multi-robot data in Aggregated Robot Processing (ARP) architecture. Our idea in local cache and cache control is to streamline the sensor data output before processing it when the sensor device produces the data with the same value in a row. Furthermore, QoS balancing optimization aims to balance the DEPTH and DEADLINE QoS configuration to determine the rates and buffer size in ROS 2 node communication. This study shows that combining local cache and QoS balancing optimization improves multi-robot data transmission and cooperation in ARP architecture.

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

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

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

The present study propose an innovative turn-boring operation method and focuses on finding optimal turn-boring process parameters for 15-5PH Stainless steel by considering multiple performance characteristics using Taguchi orthogonal array with the grey relational analysis, the effect of machining variables such as concentration of cutting fluid , temperature of cutting fluid , feed rate, depth of cut and cutting speed are optimized with considerations of multiple performance characteristics namely surface roughness, roundness error and material removal rate, the optimal values were found out from the Grey relational grade. The result of the Analysis of Variances (ANOVA) is shown that the most significant factor is cutting speed, followed by feed rate, concentration of cutting fluid, radial depth of cut and temperature of cutting fluid. Finally, confirmation tests were carried out to make a comparison between the experimental results and developed model. Experimental results have shown that machining performance in the turn-boring process can be improved effectively through this approach.

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.

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

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

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.

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.

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.

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.

Non-pneumatic tires have gained a lot of attention due to their advantages, including not having to worry about getting a flat tire. In this type of tire, metamaterial cells replace the pneumatic part of the tire. In general, metamaterials are formed by stacking cells together. These cells are obtained by various methods including topology optimization. Therefore, in this research, to achieve a metamaterial cell suitable for a non-pneumatic tire with the objective function of increasing compressive strength and bending fatigue life, optimization for three types of geometry including (1) square plane, (2) rectangular plane, and (3) entire circumference of tire and three types of material including polylactic acid (PLA), thermoplastic polyurethane (TPU) and void have been done. Optimization has been implemented by using MATLAB code in 2D mode. The cubic cell is obtained from extruding the optimized response of the square plane. From the optimized response of the rectangular plane, the cylindrical cell and from extruding the optimized response of the entire circumference of tire to the tire cross-section size, the main geometry of the tire has been calculated. Finally, to check the quality of 3D printing in producing cells and how they are connected, the optimal cell fabricated by the fused deposition modeling (FDM) method has been observed using a field-emission scanning electron microscopy (FE-SEM). The results show that in the optimization of the square plane, the sample with the minimum remaining weight constraint equal to 40% and in the optimization of the rectangular plane and the entire circumference of tire, the sample with the minimum remaining weight constraint equal to 60% was selected as the optimal sample. From checking the quality of 3D printing, it has been concluded that PLA and TPU materials are completely connected.

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.

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.

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

The multiobjective optimization problem is a key research direction in the field of optimization. Based on the multivariant optimization algorithm (MOA), this paper puts forward a multiobjective multivariant optimization algorithm (MMOA). A good point set is adopted for population initialization and to ensure the homogeneity of the initial solution set and avoid prematurity; global atoms are acquired by non-dominated sorting and an external archiving strategy; a nonlinear search radius is designed to balance global and local searches and enhance the convergence precision of the algorithm. Levy Flight and Sine chaotic mapping are introduced to redesign the update formula for local atoms, increase the convergence rate of the algorithm, and boost the optimization efficiency. Comparative experiments are conducted between MMOA and NSGA-II, MOEA/D, NSWOA, MOGWO, NSMFO on multiobjective test functions and an engineering example. The simulation results show that MMOA has superior convergence and diversity to the other five algorithms.

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

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

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.

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.

Drying food involves complex physical atmospheric mechanisms with non-linear relations from the air-food interactions and those relations are strongly dependent on the moisture contents and the type of food. Such dependence makes it complex to design suitable dryers dedicated to a single drying process. To streamline the design of a novel compact food-drying machine, a heat pump dryer component design optimization algorithm was developed as a subprogram of a Computer Aided Engineering tool. The algorithm requires inputting food and air properties, the volume of the drying container and the technical specifications of the heat-pump off-the shelf components. The heat required to dehumidify the food supplied by the heat exchange process from condenser to evaporator, and the compressor’s requirements (refrigerant mass flow rate and operating pressures) are then calculated. Compressors can then be selected based in the volume and type of food to be dried. The algorithm is shown via a flow chart to guide the user through 3 different stages: Changes in drying air properties, Heat flow within dryer and Product moisture content. Example results of how different compressors are selected for different type of produces and quantities (Agaricus Blazei mushroom with 3 different moisture contents or fish from Thunnini tribe) conclude this article.

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.

The minimum dominating tree (MDT) problem consists of finding a minimum weight sub-graph from an undirected graph, such that each vertex not in this sub-graph is adjacent to at least one of the vertices in it, and the sub-graph is connected without any ring structures. This paper presents a Dual Neighborhoods Search (DNS) algorithm for solving the MDT problem, which integrates several distinguishing features, such as two neighborhoods collaboratively working for optimizing the objective function, a fast neighborhood evaluation method to boost the searching effectiveness, and several diversification techniques to help the searching process jump out of the local optimum trap thus obtaining better solutions. DNS improves the previous best-known results for 4 public benchmark instances while providing competitive results for the remaining ones. Several ingredients of DNS are investigated to demonstrate the importance of the proposed ideas and techniques.

In the realm of smart transportation and mobility, delivery organizations are continuously refining their strategies, harnessing resources and advanced analytical techniques to streamline operations, aiming to achieve optimal solutions in terms of both efficiency and cost-effectiveness. However, a persistent challenge faced by these delivery companies revolves around the effective assignment of delivery personnel to customer orders, often grappling with suboptimal assignments that lead to inefficiencies and delays. To address this issue, we propose an architecture that uses the Munkres algorithm to optimize the task assignment problem for delivery personnel with pending orders, employing different cost functions obtained with deterministic and machine learning techniques. We compared the performance of linear and polynomial regression methods to construct different cost functions represented by matrices with orders and delivery people information. Subsequently, we applied the Munkres optimization algorithm to solve the assignment problem, which optimally assigns delivery people and orders. The results demonstrate that linear regression, used to estimate distance information, can reduce estimation errors by up to 568.52 km (1.51%) for our dataset compared to other methods. Conversely, polynomial regression proves effective in constructing a superior cost function based on time information, reducing estimation errors by up to 17,143.41 minutes (11.59%) compared to alternative methods. The proposed approach aims to enhance delivery personnel allocation within the delivery sector, optimizing the efficiency of this process.

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

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

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

Machine learning forks into three main branches such as supervised learning, unsupervised learning, and reinforcement learning where reinforcement learning is much potential to artificial intelligence (AI) applications because it solves real problems by progressive process in which possible solutions are improved and finetuned continuously. The progressive approach, which reflects ability of adaptation, is appropriate to the real world where most events occur and change continuously and unexpectedly. Moreover, data is getting too huge for supervised learning and unsupervised learning to draw valuable knowledge from such huge data at one time. Bayesian optimization (BO) models an optimization problem as a probabilistic form called surrogate model and then directly maximizes an acquisition function created from such surrogate model in order to maximize implicitly and indirectly the target function for finding out solution of the optimization problem. A popular surrogate model is Gaussian process regression model. The process of maximizing acquisition function is based on updating posterior probability of surrogate model repeatedly, which is improved after every iteration. Taking advantages of acquisition function or utility function is also common in decision theory but the semantic meaning behind BO is that BO solves problems by progressive and adaptive approach via updating surrogate model from a small piece of data at each time, according to ideology of reinforcement learning. Undoubtedly, BO is a reinforcement learning algorithm with many potential applications and thus it is surveyed in this research with attention to its mathematical ideas. Moreover, the solution of optimization problem is important to not only applied mathematics but also AI.

: The significance of heating load (HL) accurate approximation is the primary motivation of this research to distinguish the most efficient predictive model among several neural-metaheuristic models. The proposed models are through synthesizing multi-layer perceptron network (MLP) with ant lion optimization (ALO), biogeography-based optimization (BBO), dragonfly algorithm (DA), evolutionary strategy (ES), invasive weed optimization (IWO), and league champion optimization (LCA) hybrid algorithms. Each ensemble is optimized in terms of the operating population. Accordingly, the ALO-MLP, BBO-MLP, DA-MLP, ES-MLP, IWO-MLP, and LCA-MLP presented their best performance for population sizes of 350, 400, 200, 500, 50, and 300, respectively. The comparison was carried out by implementing a ranking system. Based on the obtained overall scores (OSs), the BBO (OS = 36) featured as the most capable optimization technique, followed by ALO (OS = 27) and ES (OS = 20). Due to the efficient performance of these algorithms, the corresponding MLPs can be promising substitutes for traditional methods used for HL analysis.

A novel metaheuristic optimization method is proposed based on an earthquake that is a geology phenomenon. The novel Earthquake Algorithm (EA) proposed, adapts the principle of propagation of geology waves P and S through the earth material composed by random density to ensure the dynamic balance between exploration and exploitation, in order to reach the best solution to optimization complex problems by searching for the optimum into the search space. The performance and validation of the EA are compared against the Bat Algorithm (BA) and the Particle Swarm Optimization (PSO) by using 10 diverse benchmark functions. In addition, an experimental engineering application is implemented to evaluate the proposed algorithm. Early results show a feasibility of the proposed method with a clearly constancy and stability. It is important highlight the fact that the main purpose of this paper is to present a new line of research, which is opened from the novel EA.

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

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