Search

We present an algorithm to find first order saddle points on the potential energy surface (PES). The algorithm is formulated as a constrained optimization problem that involves two sets of atomic coordinates (images), a time-varying distance constraint and a constraint on the energy difference. Both images start in different valleys of the PES and are pulled toward each other by gradually reducing the distance. The search space is restricted to the pairs of configurations that share the same potential energy. By minimizing the energy while the distance shrinks, a minimum of the constrained search space is tracked. In simple cases, the two images are confined to their respective sides of the barrier until they finally converge near the saddle point. If one image accidentally crosses the barrier, the path is split at suitable locations and the algorithm is repeated recursively. The optimization is implemented as a combination of a quasi-Newton optimization and a linear constraint. The method was tested on a set of Lennard-Jones-38 cluster transitions and a set of 121 molecular reactions using density functional theory calculations. The efficiency in terms of energy and force evaluation is better than with competing methods as long as they do not switch to single-ended methods. The construction of a continuous search path with small steps and the ability to focus on arbitrary subsegments of the path provide an additional value in terms of robustness and flexibility. [ABSTRACT FROM AUTHOR]

This paper investigates the robust stabilization problem of linear delay systems with parametric uncertainty. First, by means of the argument principle, a delay‐dependent sufficient condition is derived for designing a feedback controller, with which the closed‐loop system can achieve robust stability. Then, based on the fundamental matrix of the linear delay systems, a constrained optimization problem is formulated for solving the feedback gain matrices. The effectiveness of the proposed method is verified by some simulation results. [ABSTRACT FROM AUTHOR]

Uniform magnetic field coils are widely used as electromagnetic equipment in industrial, medical, and research applications, with Helmholtz coils being a common configuration. For applications requiring a relatively high magnetic field (∼mT), Helmholtz coils typically feature a large coil cross-section. However, this characteristic makes them unsuitable for describing the magnetic field generated by a current loop model during the design process. In this work, we model the magnetic field of a large cross-section Helmholtz coil system, often referred to as a thick-walled Helmholtz coil. By employing a genetic algorithm, we transform the design problem of a Helmholtz coil into a constrained optimization problem. Subsequently, we propose a method for reverse designing a Helmholtz coil based on constraints on the target magnetic field. Finite element simulations verify the accuracy of the established magnetic field calculation model in describing the magnetic field generated by the thick-walled Helmholtz coil. Moreover, the designed Helmholtz coil effectively meets the design constraints and objectives. This method addresses the issue of significant errors in calculating the magnetic field and its uniformity resulting from the cross-sectional effect during the design of thick-walled Helmholtz coils. Furthermore, it satisfies the constraints for coil operating time and lightweight design. [ABSTRACT FROM AUTHOR]

In the paper, we consider both finite-dimensional and infinite-dimensional optimization problems with inclusion-type and equality-type constraints. We obtain sufficient conditions for the stability in the weak topology of a solution to this problem with respect to small perturbations of the problem parameters. In the finite-dimensional case, conditions for the stability in the strong topology of the solution are obtained for the problem with equality-type constraints. These conditions are based on a certain implicit function theorem. [ABSTRACT FROM AUTHOR]

In this article, we present a hybrid Bayesian optimization (BO) framework to solve constrained optimization problems by adopting a state-of-the-art acquisition function from the unconstrained BO literature, the well-known lower confidence bound acquisition function and propose a novel variant that analyzes the feasible and infeasible regions which ensure the theoretical convergence guarantee. The proposed variant is compared with the existing state-of-the-art approaches in the constrained BO literature via implementing these approaches on six different problems, including black-box, classical engineering, and hyperparameter tuning problems. Further, we demonstrate the effectiveness of our approach through graphical and statistical testing. [ABSTRACT FROM AUTHOR]

In Yao et al. [Yao CL, Wang SQ, Tammer C. Construction of vector-valued weak separation functions with applications to conjugate duality in vector optimization; 2024. Submitted.], based on the idea of image space analysis and abstract convexity, we proposed a uniform framework of conjugate duality for the constrained vector optimization problems. This paper aims to apply this framework to linear vector optimizations. With the aid of a special collection of separation functions, a set-valued dual problem, which was also derived by Heyde, Löhne, Tammer in [Heyde F, Löhne A, Tammer C. The attainment of the solution of the dual program in vertices for vectorial linear programs. In: Barichard V, Ehrgott M, Gandibleux X, T'Kindt V, editors. Multiobjective programming and goal programming. 2009. p. 13–24. (Lecture Notes in Economics and Mathematical Systems; 618).; Heyde F, Löhne A, Tammer C. Set-valued duality theory for multiple objective linear programs and application to mathematical finance. Math Meth Oper Res. 2009;69:159–179.], is obtained by this approach. Within the uniform framework, we provide a new way to construct this dual model, and to investigate the duality theory of it. In this method, the strong duality is established by the separation of sets in the image space and the generalized saddle points. [ABSTRACT FROM AUTHOR]

We consider the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm, also known as the first-order Lagrangian method, for constrained optimization problems involving a smooth strongly convex cost and smooth convex constraints. We prove that, for every given compact set of initial conditions, there always exists a sufficiently small stepsize guaranteeing exponential stability of the optimal primal-dual solution of the problem with a domain of attraction including the initialization set. Inspired by the analysis of nonlinear oscillators, the stability proof is based on a non-quadratic Lyapunov function including a nonlinear cross term. [ABSTRACT FROM AUTHOR]

Optimization problems involving minimization of a rank-one convex function over constraints modeling restrictions on the support of the decision variables emerge in various machine learning applications. These problems are often modeled with indicator variables for identifying the support of the continuous variables. In this paper we investigate compact extended formulations for such problems through perspective reformulation techniques. In contrast to the majority of previous work that relies on support function arguments and disjunctive programming techniques to provide convex hull results, we propose a constructive approach that exploits a hidden conic structure induced by perspective functions. To this end, we first establish a convex hull result for a general conic mixed-binary set in which each conic constraint involves a linear function of independent continuous variables and a set of binary variables. We then demonstrate that extended representations of sets associated with epigraphs of rank-one convex functions over constraints modeling indicator relations naturally admit such a conic representation. This enables us to systematically give perspective formulations for the convex hull descriptions of these sets with nonlinear separable or non-separable objective functions, sign constraints on continuous variables, and combinatorial constraints on indicator variables. We illustrate the efficacy of our results on sparse nonnegative logistic regression problems. [ABSTRACT FROM AUTHOR]

This paper presents an improved Model Predictive Control (MPC) for path tracking of a nonholonomic mobile robot with a differential drive. Nonlinear dynamics and nonholonomic constraints make the optimisation problem of MPC for the robot challenging. Nonlinear dynamics of the robots are expressed by a Linear Parameter Varying (LPV), and a Recurrent Neural Network (RNN) solves the constrained optimisation problem, providing optimal velocities. Moreover, an interpolation-based approach has been introduced to augment the region of attraction. The algorithm ensures stability in the presence of bounded disturbances through the inclusion of free control moves in the control law. The controller efficiency has been evaluated in two scenarios in a hospital setting. The simulation results illustrate that the proposed method performs better than nonlinear MPC and standard LPV-based MPC in terms of computational cost, disturbance rejection, and region of attraction. [ABSTRACT FROM AUTHOR]

This paper focuses on the applicability of Zermelo's equation within the context of 3D commercial aircraft trajectory optimization problems. The associated optimal control problem includes two singular controls, specifically aerodynamic path angle and throttle setting, and one regular control, specifically heading angle. Using Pontryagin's maximum principle and the direct adjoining method, we show that the optimal heading angle is defined by Zermelo's equation. The significance of the presented analysis is that Zermelo's equation holds for 3D commercial aircraft flights, even in the presence of standard state-inequality constraints and a more general objective function. With the help of Zermelo's equation, the control problem is initially analyzed for a 3D time-optimal climb-phase scenario, which is solved by an indirect approach. Through the analysis of the switching function, we demonstrate the dependency of the optimal aerodynamic path angle on the optimal heading angle. Next, by tackling a 3D time-fuel-optimal free-routing flight, solved by a direct approach, we show that Zermelo's equation can help reduce the overall dimension of the associated nonlinear programming. To successfully handle the initial guess in both indirect and direct problems, it is proposed a diminutive nonlinear programming technique as a fast and robust initializer. This simple-yet-effective initializer provides sufficient information about the optimal controls and state dynamics required for initializing a direct optimization, as well as the optimal switching times and co-states required for initializing an indirect optimization. • Demonstrating the applicability of Zermelo's equation to constrained optimization of 3D aircraft flights. • Solving 3D time-optimal problem in climb phase with Zermelo's identity using an Indirect method. • Solving 3D time-fuel-optimal free-routing problem with Zermelo's identity using a new Direct transcription method. • Brief discussion on aNLP for initialization of both Indirect and Direct methods. [ABSTRACT FROM AUTHOR]

• A novel human-based algorithm: the flavoring search algorithm. • Flavoring search algorithm corresponds to the real-world flavoring process. • Flavoring search algorithm proposes a unique flavor factor. • A Markov model of the flavoring search algorithm is developed. • Flavoring search algorithm is applied to engineering problems and robot path planning. In this paper, a human-based meta-heuristic algorithm, the Flavoring Search Algorithm, is proposed and mathematically modeled with the aim of providing an alternative optimization method for solving practical engineering problems. Flavoring Search Algorithm is inspired by the human behavior of flavoring in everyday life, including basic flavoring, formal flavoring, and auxiliary flavoring. By introducing a unique taste factor, it not only succeeded in making the Flavoring Search Algorithm corresponds to the real flavoring process but also balanced the exploration and exploitation of the algorithm. With the help of the taste factors, Flavoring Search Algorithm performs basic flavoring (initial flavoring and random flavoring) in the exploration phase and formal flavoring and auxiliary flavoring in the exploitation phase. In addition, theoretical analysis and experiments have led to the conclusion that the taste factor can be used as an effective and practical new threshold conversion mechanism for meta-heuristic algorithms. This study also establishes a Markov model to rigorously analyze the Flavoring Search Algorithm as a globally convergent algorithm from a mathematical point of view. Through experimental and analytical comparisons with other excellent optimizers on 30 test functions, as well as on 3 real-world engineering design problems and 1 path planning problem. The results show that the Flavoring Search Algorithm generally outperforms the tested competitors in solving benchmark functions and engineering problems, validating the utility of the proposed optimizer in solving challenging real-world problems. [ABSTRACT FROM AUTHOR]

Edge computing has emerged as a prominent trend in the field of information technology, offering flexible and robust resources for the industrial Internet. How to migrate container accurately is crucial for edge computing in the industrial Internet, as it plays a vital role in enhancing service response speed and safeguarding uninterrupted continuity of production operations. In this paper, we explore the problem of container migration in edge computing within the industrial Internet, aiming to reduce latency and enhance reliability. We establish a two-objective optimization model to comprehensively capture the container migration problem and formulate it as a constrained optimization model. The formulated model provides a systematic framework that effectively balances the trade-off between reducing latency and enhancing reliability. To tackle the migration strategy derived from the optimization model, we propose a migration algorithm based on the improved binary whale optimization algorithm. Our migration algorithm incorporates the adaptive probability and adaptive position weight within the hunting and searching operations, effectively enhancing the search efficiency during the solving process. The experimental results demonstrate the effectiveness of the established model in reducing the objective value, while the proposed migration algorithm surpasses existing algorithms by achieving an average reduction of at least 15.59% in the objective value. [ABSTRACT FROM AUTHOR]

Direct Multisearch (DMS) is a well-established class of methods for multiobjective derivative-free optimization, where constraints are addressed by an extreme barrier approach, only evaluating feasible points. In this work, we propose the replacement of this extreme barrier approach by a filter strategy, combined with an inexact feasibility restoration step, to address constraints in the DMS framework. The filter approach treats feasibility as an additional component of the objective function that needs to be minimized. The inexact restoration step attempts to generate new feasible points, contributing to prioritize this feasibility, a requirement for the good performance of any filter approach. Theoretical results are provided, analysing the different types of sequences of points generated by the new algorithm, and numerical experiments on a set of nonlinearly constrained biobjective problems are reported, stating the good algorithmic performance of the proposed approach. [ABSTRACT FROM AUTHOR]

A machine learning (ML) guided approach is presented for the accelerated optimization of chemical vapor deposition (CVD) synthesis of 2D materials toward the highest quality, starting from low‐quality or unsuccessful synthesis conditions. Using 26 sets of these synthesis conditions as the initial training dataset, our method systematically guides experimental synthesis towards optoelectronic‐grade monolayer MoS2 flakes. A‐exciton linewidth (σA) as narrow as 38 meV could be achieved in 2D MoS2 flakes after only an additional 35 trials (reflecting 15% of the full factorial design dataset for training purposes). In practical terms, this reflects a decrease of the possible experimental time to optimize the parameters from up to one year to about two months. This remarkable efficiency was achieved by formulating a constrained sequencing optimization problem solved via a combination of constraint learning and Bayesian Optimization with the narrowness of σA as the single target metric. By employing graph‐based semi‐supervised learning with data acquired through a multi‐criteria sampling method, the constraint model effectively delineates and refines the feasible design space for monolayer flake production. Additionally, the Gaussian Process regression effectively captures the relationships between synthesis parameters and outcomes, offering high predictive capability along with a measure of prediction uncertainty. This method is scalable to a higher number of synthesis parameters and target metrics and is transferrable to other materials and types of reactors. This study envisions that this method will be fundamental for CVD and similar techniques in the future. [ABSTRACT FROM AUTHOR]

This paper proposes a multi‐objective evolutionary algorithm based on bilayered decomposition (MOEA/BLD) for solving constrained multi‐objective optimization problems. MOEA/D is an effective method for solving unconstrained multi‐objective optimization problems. It decomposes the objective space using weight vectors and simultaneously searches for solutions for the subproblems. However, real‐world applications impose many constraints, and these constraints must be handled appropriately when searching for good feasible solutions. The proposed MOEA/BLD treats such constraints as an additional objective function. Furthermore, in addition to the conventional weight vector, an augmented weight vector is introduced that decomposes the objective space and constraint violation space hierarchically. In the first stage, the objective space is decomposed by conventional weight vectors. In the next stage, the bi‐objective space consisting of the scalarizing function and constraint violation is decomposed by augmented weight vectors. The augmented weights are adjusted so that they decrease linearly in the search process as the search gradually moves from infeasible regions to feasible regions. The proposed algorithm is compared to several state‐of‐the‐art constrained MOEA/Ds using multi‐ and many‐objective problems. The results show that the proposed method outperforms existing methods, in terms of search performance, under various conditions. © 2024 Institute of Electrical Engineers of Japan and Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

We consider convex optimization problems with a possibly nonsmooth objective function in the form of a mathematical expectation. The proposed framework (AN-SPS) employs Sample Average Approximations (SAA) to approximate the objective function, which is either unavailable or too costly to compute. The sample size is chosen in an adaptive manner, which eventually pushes the SAA error to zero almost surely (a.s.). The search direction is based on a scaled subgradient and a spectral coefficient, both related to the SAA function. The step size is obtained via a nonmonotone line search over a predefined interval, which yields a theoretically sound and practically efficient algorithm. The method retains feasibility by projecting the resulting points onto a feasible set. The a.s. convergence of AN-SPS method is proved without the assumption of a bounded feasible set or bounded iterates. Preliminary numerical results on Hinge loss problems reveal the advantages of the proposed adaptive scheme. In addition, a study of different nonmonotone line search strategies in combination with different spectral coefficients within AN-SPS framework is also conducted, yielding some hints for future work. [ABSTRACT FROM AUTHOR]

Several constrained optimization problems have been adequately solved over the years thanks to the advances in the area of metaheuristics. Nevertheless, the question as to which search logic performs better on constrained optimization often arises. In this paper, we present Dual Search Optimization (DSO), a co-evolutionary algorithm that includes an adaptive penalty function to handle constrained problems. Compared to other self-adaptive metaheuristics, one of the main advantages of DSO is that it is able auto-construct its own perturbation logics, i.e., the ways solutions are modified to create new ones during the optimization process. This is accomplished by co-evolving the solutions (encoded as vectors of integer/real values) and perturbation strategies (encoded as Genetic Programming trees), in order to adapt the search to the problem. In addition to that, the adaptive penalty function allows the algorithm to handle constraints very effectively, yet with a minor additional algorithmic overhead. We compare DSO with several algorithms from the state-of-the-art on two sets of problems, namely: (1) seven well-known constrained engineering design problems and (2) the CEC 2017 benchmark for constrained optimization. Our results show that DSO can achieve state-of-the-art performances, being capable to automatically adjust its behavior to the problem at hand. [ABSTRACT FROM AUTHOR]

Global constrained optimization problems are very complex for engineering applications. To solve complicated and constrained optimization problems with fast convergence and accurate computations, a new quantum artificial bee colony algorithm using Sin chaos and Cauchy factor (SCQABC) is proposed. The algorithm introduces a quantum bit to initialize the population, which is then updated by the quantum rotation gate to enhance the convergence of the artificial bee colony algorithm (ABC). Sin chaos is introduced to process the individual positions, which improves the randomness and ergodicity of initializing individuals and results in a more diverse initial population. To overcome the upper limits of visiting target individual positions, Cauchy factor is used to mutate individuals for solving falling into local optimum problems. To evaluate the performance of the SCQABC, 20 classical benchmark functions and CEC-2017 are used. The practical engineering problems are also used to verify the practicability of SCQABC algorithm. Moreover, the experimental results will be compared with other well-known and progressive algorithms. According to the results, the SCQABC improves by 64.93% compared with the ABC and also has corresponding improvement compared with other algorithms. Its successful application to the robot gripper problem highlights its effectiveness in solving constrained optimization problems. [ABSTRACT FROM AUTHOR]

The key problem to solving constrained multi-objective optimization problems (CMOPs) is how to achieve a balance between objectives and constraints. Unfortunately, most existing methods for CMOPs still cannot achieve the above balance. To this end, this paper proposes an adaptive constraint relaxation-based evolutionary algorithm (ACREA) for CMOPs. ACREA adaptively relaxes the constraints according to the iteration information of population, whose purpose is to induce infeasible solutions to transform into feasible ones and thus improve the ability to explore the unknown regions. Completely ignoring constraints can cause the population to waste significant resources searching for infeasible solutions, while excessively satisfying constraints can trap the population in local optima. Therefore, balancing constraints and objectives is a crucial approach to improving algorithm performance. By appropriately relaxing the constraints, it induces infeasible solutions to be transformed into feasible ones, thus obtaining more information from infeasible solutions. At the same time, it also establishes an archive for the storage and update of solutions. In the archive update process, a diversity-based ranking is proposed to improve the convergence speed of the algorithm. In the selection process of the mating pool, common density selection metrics are incorporated to enable the algorithm to obtain higher-quality solutions. The experimental results show that the proposed ACREA algorithm not only achieved the best Inverse Generation Distance (IGD) value in 54.6% of the 44 benchmark test problems and the best Hyper Volume (HV) value in 50% of them, but also obtained the best results in seven out of nine real-world problems. Clearly, CP-TSEA outperforms its competitors. [ABSTRACT FROM AUTHOR]

In this study, a data-driven model predictive control (MPC) method is proposed for the optimal control of a doubly-fed variable-speed pumped storage unit. This method combines modern control theory with the dynamic characteristics of the pumped storage unit to establish an accurate dynamic model based on actual operating data. In each control cycle, the MPC uses the system model to predict future system behavior and determines the optimal control input sequence by solving the constrained optimization problem, thereby effectively dealing with the nonlinearity, time-varying characteristics, and multivariable coupling problems of the system. When compared with a traditional PID control, this method significantly improves control accuracy, response speed, and system stability. The simulation results show that the proposed MPC method exhibits better steady-state error, overshoot, adjustment time, and control energy under various operating conditions, demonstrating its advantages in complex multivariable systems. This study provides an innovative solution for the efficient control of doubly-fed variable-speed pumped storage units and lays a solid foundation for the efficient utilization of new energy sources. [ABSTRACT FROM AUTHOR]

The frequency solutions of finite elements may significantly deteriorate as the mesh aspect ratios become large, which implies a severe element side-length discrepancy. In this work, an aspect ratio dependent lumped mass (ARLM) formulation is proposed for serendipity elements, i.e., the two-dimensional eight-node and three dimensional twenty-node quadratic elements for linear problems. In particular, a generalized parametric lumped mass matrix template taking into account the mesh aspect ratios is introduced to examine the frequency accuracy of serendipity elements. This generalized lumped mass matrix template completely meets the mass conservation and non-negativity requirements. Subsequently, analytical frequency error estimates are developed for serendipity elements, which clearly illustrate the relationship between the frequency accuracy and element aspect ratios. Accordingly, optimal mass parameters are obtained as the functions of element aspect ratios through solving a constrained optimization problem for frequency accuracy. It turns out that the resulting aspect ratio dependent lumped mass matrices yield much more accurate frequency solutions, in comparison to the diagonal scaling lumped mass (HRZ) matrices and the mid-node lumped mass (MNLM) matrices without consideration of the element aspect ratios, especially for finite element discretizations with severe element side-length discrepancy. The superior accuracy and robustness of the proposed ARLM over HRZ and MNLM are consistently demonstrated by numerical examples. [ABSTRACT FROM AUTHOR]

Networks are inherently uncertain and require scenario-based approaches to handle variability. In stochastic and time-dependent networks, optimal solutions cannot always be found using deterministic algorithms. Furthermore, Stochastic Time Dependent Shortest Path problems are known to be NP-hard. Emerging Quantum Computing Methods are providing new ways to address these problems. In this paper, the STDSP problem is formulated as a Quadratic Constrained Binary Optimization Problem. We show that in the case of independent link costs, the size of the problem increases exponentially. Finally, we find that using the quantum solver provides a linear computational experience with respect to the size of the problem. The proposed solution has implications for stochastic networks across different contexts including communications, traffic, industrial operations, electricity, water, broader supply chains, and epidemiology. [ABSTRACT FROM AUTHOR]

A powerful and efficient program for restoring the electrical distribution system by effectively utilizing the maximum capabilities within the system, including soft open points, distributed generation resources, and network configuration changes, can significantly reduce both the quantity and duration of lost loads caused by permanent faults. In this research study, we address the issue of distribution network restoration with a focus on soft open points (SOPs) and intentional islanding using distributed generations. This problem is formulated as a constrained optimization problem in order to determine the optimal distribution network configuration, quality of intentional islanding through DGs, control function of SOPs, and amount of load shedding. The objective is to minimize lost load while minimizing switching operations and preferably minimal islanding. Given that this problem involves multiple complexities such as combinatorial nature, mixed-integer variables, non-linearity, non-convexity along with numerous variables and constraints; we employ an evolutionary method known as simulated annealing (SA) algorithm to solve it without any simplifications or assumptions about convexity. To enhance efficiency during implementation of SA algorithm, Kruskal’s algorithm is utilized for generating radial solutions which restricts search space to feasible solutions resulting in quicker attainment of high-quality optimal solutions. Finally, the outcomes of implementing the suggested approach on the 69-bus IEEE distribution system are presented and examined. It is demonstrated that by leveraging the potential of soft open points in load transfer control and network voltage regulation, along with utilizing intentional islanding capability provided by distributed generation resources, the restoration capability of the distribution system can be greatly enhanced. [ABSTRACT FROM AUTHOR]

This work was conducted first to devise an explicit equation for the ultimate strength of reinforced concrete dapped-end beams failing in diagonal tension caused by re-entrant corner cracks and second to gain insight into its mechanical behavior. To these ends, we introduce force equilibrium equations that explicitly account for the relevant internal force-resisting components: hanger reinforcement; dowel action of longitudinal reinforcement; concrete compression zone; aggregate interlock; and other reinforcement-related terms. These equations are solved within the framework of a constrained optimization problem. The solution process enables us to quantify the ultimate strength and the contributions of all force transfer actions. Strength prediction validity was confirmed through comparisons with experimentally obtained strength data from 50 specimens collected from the available literature. Our findings indicate the prediction accuracy as superior to that of a strut-and-tie model and design provisions of the Precast/Prestressed Concrete Institute. For practical purposes, a minimalist version of the equilibrium equation is derived to estimate the ultimate strength of diagonal tension failure based on rational simplifications of the force transfer mechanisms. [ABSTRACT FROM AUTHOR]

An efficient allocation of limited resources in low-income settings offers the opportunity to improve population-health outcomes given the available health system capacity. Efforts to achieve this are often framed through the lens of "health benefits packages" (HBPs), which seek to establish which services the public healthcare system should include in its provision. Analytic approaches widely used to weigh evidence in support of different interventions and inform the broader HBP deliberative process however have limitations. In this work, we propose the individual-based Thanzi La Onse (TLO) model as a uniquely-tailored tool to assist in the evaluation of Malawi-specific HBPs while addressing these limitations. By mechanistically modelling—and calibrating to extensive, country-specific data—the incidence of disease, health-seeking behaviour, and the capacity of the healthcare system to meet the demand for care under realistic constraints on human resources for health available, we were able to simulate the health gains achievable under a number of plausible HBP strategies for the country. We found that the HBP emerging from a linear constrained optimisation analysis (LCOA) achieved the largest health gain—∼8% reduction in disability adjusted life years (DALYs) between 2023 and 2042 compared to the benchmark scenario—by concentrating resources on high-impact treatments. This HBP however incurred a relative excess in DALYs in the first few years of its implementation. Other feasible approaches to prioritisation were assessed, including service prioritisation based on patient characteristics, rather than service type. Unlike the LCOA-based HBP, this approach achieved consistent health gains relative to the benchmark scenario on a year- to-year basis, and a 5% reduction in DALYs over the whole period, which suggests an approach based upon patient characteristics might prove beneficial in the future. Author summary: All publicly funded healthcare systems face difficult decisions about how limited resources should be allocated to achieve the greatest possible return in health. These decisions are particularly pressing in lower-income countries (LICs) like Malawi, where resources are extremely limited and their inefficient allocation results in larger morbidity and mortality. In this work, we introduce a new analytical tool to inform such decisions based on an "all diseases, whole healthcare system" simulation specifically tailored to Malawi, the Thanzi La Onse (TLO) model. The TLO model is able to forecast the health burden that should be expected from different resource-allocation strategies in Malawi specifically, allowing policy-makers to explore a wide range of policy options in a safe and theoretical fashion. In this analysis, we compare the forecasted health burden from a set of common resource-prioritisation strategies, and draw some general conclusions as to what makes certain strategies more or less effective in reducing the health burden incurred. [ABSTRACT FROM AUTHOR]

Ammonia is a promising carbon‐free energy vector. Small‐scale renewable power‐to‐ammonia (P2A) is particularly suited for isolated agricultural areas where ammonia can be used as fuel and fertilizer. This work compares two approaches to simulate and optimize the steady‐state behavior of a novel small‐scale P2A process: Aspen Plus® and MOSAIC®. Aspen Plus® is a commercial flow sheeting software whereas MOSAIC® is a freeware where equations and thermochemical properties need to be specified by hand. It can be shown that the results of MOSAIC® and Aspen Plus® are qualitatively comparable, but not identical. This suggests that the model in MOSAIC® can be improved further, starting with the implementation of a more accurate numeric reactor kinetics and equation of state. [ABSTRACT FROM AUTHOR]

In many industrial applications, data-driven models are more and more commonly employed as an alternative to classical analytical descriptions or simulations. In particular, such models are often used to predict the outcome of an industrial process with respect to specific quality characteristics from both observed process parameters and control variables. A major step in proceeding from purely predictive to prescriptive analytics, i.e., towards leveraging data-driven models for process optimization, consists of, for given process parameters, determining control variable values such that the output quality improves according to the process model. This task naturally leads to a constrained optimization problem for data-driven prediction algorithms. In many cases, however, the best available models suffer from a lack of regularity: methods such as gradient boosting or random forests are generally non-differentiable and might even exhibit discontinuities. The optimization of these models would therefore require the use of derivative-free techniques. Here, we discuss the use of alternative, independently trained differentiable machine learning models as a surrogate during the optimization procedure. While these alternatives are generally less accurate representations of the actual process, the possibility of employing derivative-based optimization methods provides major advantages in terms of computational performance. Using classical benchmarks as well as a real-world dataset obtained from an industrial environment, we demonstrate that these advantages can outweigh the additional model error, especially in real-time applications. [ABSTRACT FROM AUTHOR]

Imitation learning enables synthesis of controllers for systems with complex objectives and uncertain plant models. However, ensuring an imitation learned controller is stable requires copious amounts of data and/or a known plant model. In this paper, we explore an input–output (IO) stability approach to imitation learning, which achieves stability with sparse data sets while only requiring coarse knowledge of the energy characteristics of the plant. A constrained optimization problem is developed, in which the controller learns to mimic expert data while maintaining stabilizing energy characteristics induced by the plant. While the learning objective is nonconvex, iterative convex overbounding (ICO) and projected gradient descent (PGD) are explored as methods to learn the controller. In numerical examples, it is shown that with little knowledge of the plant model and a small data set, the dissipativity constrained learned controller achieves closed loop stability and successfully mimics the behavior of the expert controller, while other methods often fail to maintain stability and achieve good performance. [ABSTRACT FROM AUTHOR]

Motivation Understanding causal effects is a fundamental goal of science and underpins our ability to make accurate predictions in unseen settings and conditions. While direct experimentation is the gold standard for measuring and validating causal effects, the field of causal graph theory offers a tantalizing alternative: extracting causal insights from observational data. Theoretical analysis has shown that this is indeed possible, given a large dataset and if certain conditions are met. However, biological datasets, frequently, do not meet such requirements but evaluation of causal discovery algorithms is typically performed on synthetic datasets, which they meet all requirements. Thus, real-life datasets are needed, in which the causal truth is reasonably known. In this work we first construct such a large-scale real-life dataset and then we perform on it a comprehensive benchmarking of various causal discovery methods. Results We find that the PC algorithm is particularly accurate at estimating causal structure, including the causal direction which is critical for biological applicability. However, PC does only produces cause-effect directionality, but not estimates of causal effects. We propose PC-NOTEARS (PCnt), a hybrid solution, which includes the PC output as an additional constraint inside the NOTEARS optimization. This approach combines PC algorithm's strengths in graph structure prediction with the NOTEARS continuous optimization to estimate causal effects accurately. PCnt achieved best aggregate performance across all structural and effect size metrics. Availability and implementation https://github.com/zhu-yh1/PC-NOTEARS. [ABSTRACT FROM AUTHOR]

The cause-specific hazard Cox model is widely used in analyzing competing risks survival data, and the partial likelihood method is a standard approach when survival times contain only right censoring. In practice, however, interval-censored survival times often arise, and this means the partial likelihood method is not directly applicable. Two common remedies in practice are (i) to replace each censoring interval with a single value, such as the middle point; or (ii) to redefine the event of interest, such as the time to diagnosis instead of the time to recurrence of a disease. However, the mid-point approach can cause biased parameter estimates. In this article, we develop a penalized likelihood approach to fit semi-parametric cause-specific hazard Cox models, and this method is general enough to allow left, right, and interval censoring times. Penalty functions are used to regularize the baseline hazard estimates and also to make these estimates less affected by the number and location of knots used for the estimates. We will provide asymptotic properties for the estimated parameters. A simulation study is designed to compare our method with the mid-point partial likelihood approach. We apply our method to the Aspirin in Reducing Events in the Elderly (ASPREE) study, illustrating an application of our proposed method. [ABSTRACT FROM AUTHOR]

This study analyzes the conditional gradient method for constrained multiobjective optimization problems, also known as the Frank–Wolfe method. We assume that the objectives are continuously differentiable, and the constraint set is convex and compact. We employ an average-type nonmonotone line search, which takes the average of the recent objective function values. The asymptotic convergence properties without convexity assumptions on the objective functions are established. We prove that every limit point of the sequence of iterates that is obtained by the proposed method is a Pareto critical point. An iteration-complexity bound is provided regardless of the convexity assumption on the objective functions. The effectiveness of the suggested approach is demonstrated by applying it to several benchmark test problems. In addition, the efficiency of the proposed algorithm in generating approximations of the entire Pareto front is compared to the existing Hager–Zhang conjugate gradient method, the steepest descent method, the monotone conditional gradient method, and a nonmonotone conditional gradient method. In finding empirical comparison, we utilize two commonly used performance matrices—inverted generational distance and hypervolume indicators. [ABSTRACT FROM AUTHOR]

The study considers issues of elaborating and validating a technique of autonomous vehicle motion planning based on sequential trajectory and speed optimization. This method includes components such as representing sought-for functions by finite elements (FE), vehicle kinematic model, sequential quadratic programming for nonlinear constrained optimization, and Gaussian N-point quadrature integration. The primary novelty consists of using the inverse approach for obtaining vehicle trajectory and speed. The curvature and speed are represented by integrated polynomials to reduce the number of unknowns. For this, piecewise functions with two and three degrees of freedom (DOF) are implemented through FE nodal parameters. The technique ensures higher differentiability compared to the needed in the geometric and kinematic equations. Thus, the generated reference curves are characterized by simple and unambiguous forms. The latter fits best the control accuracy and efficiency during the motion tracking phase. Another advantage is replacing the nodal linear equality constraints with integral nonlinear ones. This ensures the non-violation of boundary limits within each FE and not only in nodes. The optimization technique implies that the spatial and time variables must be found separately and staged. The trajectory search is accomplished in the restricted allowable zone composed by superposing an area inside the external and internal boundaries, based on keeping safe distances, excluding areas for moving obstacles. Thus, this study compares two models that use two and three nodal DOF on optimization quality, stability, and rapidity in real-time applications. The simulation example shows numerous graph results of geometric and kinematic parameters with smoothed curves up to the highest derivatives. Finally, the conclusions are made on the efficiency and quality of prognosis, outlining the similarities and differences between the two applied models. [ABSTRACT FROM AUTHOR]

This paper presents two novel bio-inspired particle swarm optimisation (PSO) variants, namely biased eavesdropping PSO (BEPSO) and altruistic heterogeneous PSO (AHPSO). These algorithms are inspired by types of group behaviour found in nature that have not previously been exploited in search algorithms. The primary search behaviour of the BEPSO algorithm is inspired by eavesdropping behaviour observed in nature coupled with a cognitive bias mechanism that enables particles to make decisions on cooperation. The second algorithm, AHPSO, conceptualises particles in the swarm as energy-driven agents with bio-inspired altruistic behaviour, which allows for the formation of lending–borrowing relationships. The mechanisms underlying these algorithms provide new approaches to maintaining swarm diversity, which contributes to the prevention of premature convergence. The new algorithms were tested on the 30, 50 and 100-dimensional CEC'13, CEC'14 and CEC'17 test suites and various constrained real-world optimisation problems, as well as against 13 well-known PSO variants, the CEC competition winner, differential evolution algorithm L-SHADE and the recent bio-inspired I-CPA metaheuristic. The experimental results show that both the BEPSO and AHPSO algorithms provide very competitive performance on the unconstrained test suites and the constrained real-world problems. On the CEC13 test suite, across all dimensions, both BEPSO and AHPSO performed statistically significantly better than 10 of the 15 comparator algorithms, while none of the remaining 5 algorithms performed significantly better than either BEPSO or AHPSO. On the CEC17 test suite, on the 50D and 100D problems, both BEPSO and AHPSO performed statistically significantly better than 11 of the 15 comparator algorithms, while none of the remaining 4 algorithms performed significantly better than either BEPSO or AHPSO. On the constrained problem set, in terms of mean rank across 30 runs on all problems, BEPSO was first, and AHPSO was third. [ABSTRACT FROM AUTHOR]

Applied research conditions often make it impossible to point-identify causal estimands without untenable assumptions. Partial identification—bounds on the range of possible solutions—is a principled alternative, but the difficulty of deriving bounds in idiosyncratic settings has restricted its application. We present a general, automated numerical approach to causal inference in discrete settings. We show causal questions with discrete data reduce to polynomial programming problems, then present an algorithm to automatically bound causal effects using efficient dual relaxation and spatial branch-and-bound techniques. The user declares an estimand, states assumptions, and provides data—however incomplete or mismeasured. The algorithm then searches over admissible data-generating processes and outputs the most precise possible range consistent with available information—that is, sharp bounds—including a point-identified solution if one exists. Because this search can be computationally intensive, our procedure reports and continually refines non-sharp ranges guaranteed to contain the truth at all times, even when the algorithm is not run to completion. Moreover, it offers an ε-sharpness guarantee, characterizing the worst-case looseness of the incomplete bounds. These techniques are implemented in our Python package, autobounds. Analytically validated simulations show the method accommodates classic obstacles—including confounding, selection, measurement error, noncompliance, and nonresponse. for this article are available online. [ABSTRACT FROM AUTHOR]

Various metaheuristic algorithms inspired by nature have been designed to deal with a variety of practical optimization problems. As an excellent metaheuristic algorithm, the improved particle swarm optimization algorithm based on grouping (IPSO) has strong global search capabilities. However, it lacks a strong local search ability and the ability to solve constrained discrete optimization problems. This paper focuses on improving these two aspects of the IPSO algorithm. Based on IPSO, we propose an improved particle swarm optimization algorithm based on variable neighborhood search (VN-IPSO) and design a 0-1 integer programming solution with constraints. In the experiment, the performance of the VN-IPSO algorithm is fully tested and analyzed using 23 classic benchmark functions (continuous optimization), 6 knapsack problems (discrete optimization), and 10 CEC2017 composite functions (complex functions). The results show that the VN-IPSO algorithm wins 18 first places in the classic benchmark function test set, including 6 first places in the solutions for seven unimodal test functions, indicating a good local search ability. In solving the six knapsack problems, it wins four first places, demonstrating the effectiveness of the 0-1 integer programming constraint solution and the excellent solution ability of VN-IPSO in discrete optimization problems. In the test of 10 composite functions, VN-IPSO wins first place four times and ranks the first in the comprehensive ranking, demonstrating its excellent solving ability for complex functions. [ABSTRACT FROM AUTHOR]

This work introduces a new Riemannian optimization method for registering open parameterized surfaces with a constrained global optimization approach. The proposed formulation leads to a rigorous theoretic foundation and guarantees the existence and the uniqueness of a global solution. We also propose a new Bayesian clustering approach where local distributions of surfaces are modeled with spherical Gaussian processes. The maximization of the posterior density is performed with Hamiltonian dynamics which provide a natural and computationally efficient spherical Hamiltonian Monte Carlo sampling. Experimental results demonstrate the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

This contribution discusses the influence of different barrier update strategies on the performance and robustness of an interior point algorithm for single-crystal plasticity at small strains. To this end, single-crystal plasticity is first briefly presented in the framework of a primal-dual interior point algorithm to outline the general algorithmic structure. The manner in which the barrier parameter is modified within the interior point method, steering the penalization of constraints, plays a crucial role for the robustness and efficiency of the overall algorithm. In this paper, we compare and analyze different strategies in the framework of crystal plasticity. In a thorough analysis of a numerical example covering a broad range of settings in monocrystals, we investigate robust hyperparameter ranges and identify the most efficient and robust barrier parameter update strategies. [ABSTRACT FROM AUTHOR]

The herein proposed Python package pflacco provides a set of numerical features to characterize single-objective continuous and constrained optimization problems. Thereby, pflacco addresses two major challenges in the area of optimization. Firstly, it provides the means to develop an understanding of a given problem instance, which is crucial for designing, selecting, or configuring optimization algorithms in general. Secondly, these numerical features can be utilized in the research streams of automated algorithm selection and configuration. While the majority of these landscape features are already available in the R package flacco, our Python implementation offers these tools to an even wider audience and thereby promotes research interests and novel avenues in the area of optimization. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of computing an arbitrary generalized singular value of a Grassman or real matrix pair and a triplet of associated generalized singular vectors. Based on the QR factorization, the problem is reformulated as two novel trace maximization problems, each of which has double variables with unitary constraints or orthogonal constraints. Theoretically, we show that the arbitrarily prescribed extreme generalized singular values and associated triplets of generalized singular vectors can be determined by the global solutions of the constrained trace optimization problems. Then we propose a geometric inexact Newton–conjugate gradient (Newton-CG) method for solving their equivalent trace minimization problems over the Riemannian manifold of all fixed-rank partial isometries. The proposed method can extract not only the prescribed extreme generalized singular values but also associated triplets of generalized singular vectors. Under some mild assumptions, we establish the global and quadratic convergence of the proposed method. Finally, numerical experiments on both synthetic and real data sets show the effectiveness and high accuracy of our method. [ABSTRACT FROM AUTHOR]

One of the fundamental results of ergodic optimization asserts that for any dynamical system on a compact metric space with the specification property and for a generic continuous function f every invariant probability measure that maximizes the space average of f must have zero entropy. We establish the analogical result in the context of constrained ergodic optimization, which is introduced by [Garibaldi and Lopes, Functions for relative maximization, Dyn. Syst. 22(4) (2007), pp. 511-528]. [ABSTRACT FROM AUTHOR]

Short-step methods are an important class of algorithms for solving convex constrained optimization problems. In this short paper, we show that under very mild assumptions on the self-concordant barrier and the width of the ℓ 2 -neighbourhood, any short-step interior-point method is not strongly polynomial-time. [ABSTRACT FROM AUTHOR]

Linear Mixed Effects (LME) models are powerful statistical tools that have been employed in many different real-world applications such as retail data analytics, marketing measurement, and medical research. Statistical inference is often conducted via maximum likelihood estimation with Normality assumptions on the random effects. Nevertheless, for many applications in the retail industry, it is often necessary to consider non-Normal distributions on the random effects when considering the unknown parameters' business interpretations. Motivated by this need, a linear mixed effects model with possibly non-Normal distribution is studied in this research. We propose a general estimating framework based on a saddlepoint approximation (SA) of the probability density function of the dependent variable, which leads to constrained nonlinear optimization problems. The classical LME model with Normality assumption can then be viewed as a special case under the proposed general SA framework. Compared with the existing approach, the proposed method enhances the real-world interpretability of the estimates with satisfactory model fits. [ABSTRACT FROM AUTHOR]

Constrained optimization problems (COPs) are essential in many real-world applications. Existing methods often rely on a fixed coordinate system to explore the solution space of COPs, limiting their adaptability to complex and varying landscapes, particularly when constraints are involved. Solving COPs using evolutionary algorithms remains challenging due to the need to balance objective optimization and constraint satisfaction. To overcome these limitations, this paper proposes an Adaptive Coordinate System for Constrained Differential Evolution (ACSCDE). ACSCDE introduces two specialized coordinate systems: one focuses on guiding the search to the objective space, while the other directs the search toward feasible solutions. These coordinate systems are built using an archive-based covariance matrix that captures the characteristics of the fitness landscape and constraints. An adaptive selection process dynamically chooses the most suitable coordinate system based on feedback from the evolutionary process. Additionally, the original coordinate system is retained to enhance population diversity, and a tailored mutation strategy is applied to each system. The proposed method was tested on benchmark suites CEC2010 and CEC2017, designed to challenge state-of-the-art algorithms. The results demonstrate that ACSCDE achieves competitive performance, outperforming advanced techniques in complex constrained optimization scenarios. These findings highlight ACSCDE as a promising approach for improving the performance of evolutionary algorithms in constrained optimization tasks. [ABSTRACT FROM AUTHOR]

In this paper we study the nonconvex constrained composition optimization, in which the objective contains a composition of two expected-value functions whose accurate information is normally expensive to calculate. We propose a STochastic nEsted Primal-dual (STEP) method for such problems. In each iteration, with an auxiliary variable introduced to track the inner layer function values we compute stochastic gradients of the nested function using a subsampling strategy. To alleviate difficulties caused by possibly nonconvex constraints, we construct a stochastic approximation to the linearized augmented Lagrangian function to update the primal variable, which further motivates to update the dual variable in a weighted-average way. Moreover, to better understand the asymptotic dynamics of the update schemes we consider a deterministic continuous-time system from the perspective of ordinary differential equation (ODE). We analyze the Karush-Kuhn-Tucker measure at the output by the STEP method with constant parameters and establish its iteration and sample complexities to find an \epsilon-stationary point, ensuring that expected stationarity, feasibility as well as complementary slackness are below accuracy \epsilon. To leverage the benefit of the (near) initial feasibility in the STEP method, we propose a two-stage framework incorporating a feasibility-seeking phase, aiming to locate a nearly feasible initial point. Moreover, to enhance the adaptivity of the STEP algorithm, we propose an adaptive variant by adaptively adjusting its parameters, along with a complexity analysis. Numerical results on a risk-averse portfolio optimization problem and an orthogonal nonnegative matrix decomposition reveal the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

Beluga whale optimization (BWO) has received widespread attention in scientific and engineering domains. However, BWO suffers from limited adaptability, weak anti-stagnation, and poor exploration capability. Consequently, this study proposes an enhanced variant of BWO called multi-strategy improved beluga whale optimization (MIBWO). First, an improved ICMIC chaotic map is introduced to enhance exploration capability and optimization accuracy. Then, a dynamic parameter nonlinear adjustment strategy is integrated to achieve a better balance between exploration and exploitation. Finally, opposition learning based on the lens imaging principle is designed to strengthen anti-stagnation capability. An ablation experiment is performed to evaluate the impact of each strategy on the optimization capability of BWO. The experimental results demonstrate the significant enhancement in the performance of BWO owing to the used strategies. To further validate the performance of MIBWO, it is benchmarked against six state-of-the-art optimization algorithms using functions from CEC2005, CEC2014, and CEC2022. Statistical tests, including Friedman rank test and Wilcoxon rank-sum test, are performed. The experimental results show the superiority of MIBWO. Finally, MIBWO is applied to optimize 2D and 3D node coverage in wireless sensor networks and solve six constrained engineering problems. The experimental results indicate that MIBWO outperforms other competitors for practical engineering applications in terms of solution quality and convergence speed. [ABSTRACT FROM AUTHOR]

The sine cosine algorithm (SCA) is a metaheuristic algorithm that employs the characteristics of sine and cosine trigonometric functions. SCA's deficiencies include a tendency to get trapped in local optima, exploration–exploitation imbalance, and poor accuracy, which limit its effectiveness in solving complex optimization problems. To address these limitations, a multi-trial vector-based sine cosine algorithm (MTV-SCA) is proposed in this study. In MTV-SCA, a sufficient number of search strategies incorporating three control parameters are adapted through a multi-trial vector (MTV) approach to achieve specific objectives during the search process. The major contribution of this study is employing four distinct search strategies, each adapted to preserve the equilibrium between exploration and exploitation and avoid premature convergence during optimization. The strategies utilize different sinusoidal and cosinusoidal parameters to improve the algorithm's performance. The effectiveness of MTV-SCA was evaluated using benchmark functions of CEC 2018 and compared to state-of-the-art, well-established, CEC 2017 winner algorithms and recent optimization algorithms. The results demonstrate that the MTV-SCA outperforms the traditional SCA and other optimization algorithms in terms of convergence speed, accuracy, and the capability to avoid premature convergence. Moreover, the Friedman and Wilcoxon signed-rank tests were employed to statistically analyze the experimental results, validating that the MTV-SCA significantly surpasses other comparative algorithms. The real-world applicability of this algorithm is also demonstrated by optimizing six non-convex constrained optimization problems in engineering design. The experimental results indicate that MTV-SCA can effectively handle complex optimization challenges. [ABSTRACT FROM AUTHOR]

Recent years have seen the development of multiple in silico lung models, notably with the aim of improving patient care for pulmonary diseases. These models vary in complexity and typically only consider the implementation of pleural pressure, a depression that keeps the lungs inflated. Gravity, often considered negligible compared to pleural pressure, has been largely overlooked, also due to the complexity of formulating physiological boundary conditions to counterbalance it. However, gravity is known to affect pulmonary functions, such as ventilation. In this study, we incorporated gravity into a recent lung poromechanical model. To do so, in addition to the gravitational body force, we proposed novel boundary conditions consisting in a heterogeneous pleural pressure field constrained to counterbalance gravity to reach global equilibrium of applied forces. We assessed the impact of gravity on the global and local behavior of the model, including the pressure–volume response and porosity field. Our findings reveal that gravity, despite being small, influences lung response. Specifically, the inclusion of gravity in our model led to the emergence of heterogeneities in deformation and stress distribution, compatible with in vivo imaging data. This could provide valuable insights for predicting the progression of certain pulmonary diseases by correlating areas subjected to higher deformation and stresses with disease evolution patterns. [ABSTRACT FROM AUTHOR]

To address the real-world constrained engineering optimization problem (CEOP) and the breast cancer classification task using a high-performance heuristic approach, a novel Chaos balanced butterfly optimizer, named Chaos-BBO, was proposed with chaos regulation strategies for the smell dynamic parameter C 1 and balance dynamic parameter C 2 . The basic BBO algorithm was inspired by the smell and light perception of the special butterfly. Notably, this article collected twelve continuum chaotic mappings with one-dimensional, which has some differences from the common ten chaos mappings. we collected twelve continuum chaotic mapping functions to expand their application scope in the swarm intelligent (SI) algorithm, and their chaotic properties were also depicted in detail. Twenty-three CEC and nine CEC2022 benchmark functions were applied to evaluate the performance of the designed Chaos-BBO, which was compared to FA, GWO algorithm, BOA, HHO algorithm, SMA, JS algorithm, AO algorithm, AHA, and HBA expert for the basic BBO algorithm. Then, Friedman rank and Wilcoxon rank-sum (WRS) tests were utilized to analyze the statistical properties and rankings of the comparison methods. Finally, the proposed Chaos-BBO was utilized to address eight CEOPs and the breast cancer classification task. The results of the numerical optimization and application tasks demonstrated the superiority of the designed Chaos-BBO approach. [ABSTRACT FROM AUTHOR]

Railway alignment development in a study area with densely-distributed obstacles, in which regions favorable for alignments are isolated (termed an isolated island effect, i.e., IIE), is a computation-intensive and time-consuming task. To enhance search efficiency and solution quality, an environmental suitability analysis is conducted to identify alignment-favorable regions (AFRs), focusing the subsequent alignment search on these areas. Firstly, a density-based clustering algorithm (DBSCAN) and a specific criterion are customized to distinguish AFR distribution patterns: continuously-distributed AFRs, obstructed effects, and IIEs. Secondly, a study area characterized by IIEs is represented with a semantic topological map (STM), integrating between-island and within-island paths. Specifically, between-island paths are derived through a multi-directional scanning strategy, while within-island paths are optimized using a Floyd-Warshall algorithm. To this end, the intricate alignment optimization problem is simplified into a shortest path problem, tackled with conventional shortest path algorithms (of which Dijkstra's algorithm is adopted in this work). Lastly, the proposed method is applied to a real case in a mountainous region with karst landforms. Numerical results indicate its superior performance in both construction costs and environmental suitability compared to human designers and a prior alignment optimization method. [ABSTRACT FROM AUTHOR]

Supply chain efficiency is a major challenge in today's business environment, where efficient resource allocation and coordination of activities are essential for competitive advantage. Traditional efficiency strategies often struggle for resources for the complex and dynamic network. In response, bio-inspired metaheuristic algorithms have emerged as powerful tools to solve these optimization problems. Referring to the random search nature of metaheuristic algorithms and emphasizing that no metaheuristic algorithm is the best optimizer for all optimization applications, the No Free Lunch (NFL) theorem encourages researchers to design newer algorithms to be able to provide more effective solutions to optimization problems. Motivated by the NFL theorem, the innovation and novelty of this paper is in designing a new meta-heuristic algorithm called Bobcat Optimization Algorithm (BOA) that imitates the natural behavior of bobcats in the wild. The basic inspiration of BOA is derived from the hunting strategy of bobcats during the attack towards the prey and the chase process between them. The theory of BOA is stated and then mathematically modeled in two phases (i) exploration based on the simulation of the bobcat's position change while moving towards the prey and (ii) exploitation based on simulating the bobcat's position change during the chase process to catch the prey. The performance of BOA is evaluated in optimization to handle the CEC 2017 test suite for problem dimensions equal to 10, 30, 50, and 100, as well as to address CEC 2020. The optimization results show that BOA has a high ability in exploration, exploitation, and balance them during the search process in order to achieve a suitable solution for optimization problems. The results obtained from BOA are compared with the performance of twelve well-known metaheuristic algorithms. The findings show that BOA has been successful in handling the CEC 2017 test suite in 89.65, 79.31, 93.10, and 89.65% of the functions for the problem dimension equal to 10, 30, 50, and 100, respectively. Also, the findings show that in order to handle the CEC 2020 test suite, BOA has been successful in 100% of the functions of this test suite. The statistical analysis confirms that BOA has a significant statistical superiority in the competition with the compared algorithms. Also, in order to analyze the efficiency of BOA in dealing with real world applications, twenty-two constrained optimization problems from CEC 2011 test suite and four engineering design problems have been selected. The findings show that BOA has been successful in 90.90% of CEC2011 test suite optimization problems and in 100% of engineering design problems. In addition, the efficiency of BOA to handle SCM applications has been challenged to solve ten case studies in the field of sustainable lot size optimization. The findings show that BOA has successfully provided superior performance in 100% of the case studies compared to competitor algorithms. [ABSTRACT FROM AUTHOR]