A novel bio-inspired algorithm, namely, Dingo Optimization Algorithm (DOA), is proposed for solving optimization problems. The DOA mimics the social behavior of the Australian dingo dog. The algorithm is inspired by the hunting strategies of dingoes which are attacking by persecution, grouping tactics, and scavenging behavior. In order to increment the overall efficiency and performance of this method, three search strategies associated with four rules were formulated in the DOA. These strategies and rules provide a fine balance between intensification (exploitation) and diversification (exploration) over the search space. The proposed method is verified using several benchmark problems commonly used in the optimization field, classical design engineering problems, and optimal tuning of a Proportional-Integral-Derivative (PID) controller are also presented. Furthermore, the DOA’s performance is tested against five popular evolutionary algorithms. The results have shown that the DOA is highly competitive with other metaheuristics, beating them at the majority of the test functions.

This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

This paper presents a new method based on Estimation of Distribution Algorithms (EDAs) to detect parabolic shapes in synthetic and medical images. The method computes a virtual parabola using three random boundary pixels to calculate the constant values of the generic parabola equation. The resulting parabola is evaluated by matching it with the parabolic shape in the input image by using the Hadamard product as fitness function. This proposed method is evaluated in terms of computational time and compared with two implementations of the generalized Hough transform and RANSAC method for parabola detection. Experimental results show that the proposed method outperforms the comparative methods in terms of execution time about93.61%on synthetic images and89%on retinal fundus and human plantar arch images. In addition, experimental results have also shown that the proposed method can be highly suitable for different medical applications.

The Pavement Condition Index (PCI) is a prevalent metric for assessing the condition of rigid pavements. The PCI calculation involves evaluating 19 types of damage. This study aims to analyze how different types of damage impact the PCI calculation and the impact of the performance of prediction models of PCI by reducing the number of evaluated damages. The Municipality of León, Gto., Mexico, provided a dataset of 5271 records. We evaluated five different decision-tree models to predict the PCI value. The Extra Trees model, which exhibited the best performance, was used to assess the feature importance of each type of damage, revealing their relative impacts on PCI predictions. To explore the potential for reducing the complexity of the PCI evaluation, we applied Sequential Forward Search and Brute Force Search techniques to analyze the performance of models with various feature combinations. Our findings indicate no significant statistical difference in terms of Mean Absolute Error (MAE) and the coefficient of determination (R²) between models trained with 13 features compared to those trained with all 17 features. For instance, a model using only eight damages achieved an MAE of 4.35 and an R² of 0.89, comparable to the 3.56 MAE and 0.92 R² obtained with a model using all 17 features. These results suggest that omitting some damages from the PCI calculation has a minimal impact on prediction accuracy but can substantially reduce the evaluation’s time and cost. In addition, knowing the most significant damages opens up the possibility of automating the evaluation of PCI using artificial intelligence.

Creating robust and explainable statistical learning models is essential in credit risk management. For this purpose, equally spaced or frequent discretization is the de facto choice when building predictive models. The methods above have limitations, given that when the discretization procedure is constrained, the underlying patterns are lost. This study introduces an innovative approach by combining traditional discretization techniques with clustering-based discretization, specificallykmeans and Gaussian mixture models. The study proposes two combinations: Discrete Competitive Combination (DCC) and Discrete Exhaustive Combination (DEC). Discrete Competitive Combination selects features based on the discretization method that performs better on each feature, whereas Discrete Exhaustive Combination includes every discretization method to complement the information not captured by each technique. The proposed combinations were tested on 11 different credit risk datasets by fitting a logistic regression model using the weight of evidence transformation over the training partition and contrasted over the validation partition. The experimental findings showed that both combinations similarly outperform individual methods for the logistic regression without compromising the computational efficiency. More importantly, the proposed method is a feasible and competitive alternative to conventional methods without reducing explainability.