Aptenodytes Forsteri Optimization: Algorithm and applications

Aptenodytes forsteri optimization algorithm for low-carbon logistics network under demand uncertainty

As China's "double carbon" goal continues to advance, logistics as a key area of carbon emissions and low-carbon logistics center site selection are key links in the process. However, existing studies on logistics center location often ignore the impact of demand uncertainty, which leads to a waste of resources in the planning and construction processes. We take logistics cost and carbon emission as the objectives, and the multi-objective site selection model established based on stochastic programming theory takes demand uncertainty as a stochastic constraint. We transform the stochastic constraint model into a 0-1 mixed integer multi-objective planning model by utilizing the idea of equivalence transformation. The Aptenodytes Forsteri Optimization (AFO) algorithm is combined with the Ideal Point Method to solve the model, and the algorithm is compared with the Particle Swarm Optimization (PSO), Differential Evolutionary (DE), Tabu Search (TS), Sparrow Search (SS) algorithms, and the exact solver Linear Interactive and General Optimizer (LINGO). The examples verify the validity of the models and algorithms, with an average reduction of 6.2% and 3.6% in logistics costs and carbon emissions in the case of demand determination, and at the confidence level of 0.9 under demand uncertainty, both logistics costs and carbon emissions are decreased to varying degrees. This study provides a new research idea for the low-carbon logistics location problem under demand uncertainty, which helps to promote the transformation of the logistics industry to low-carbon and high-efficiency.

Optimized deep learning architecture for brain tumor classification using improved Hunger Games Search Algorithm

One of the worst diseases is a brain tumor, which is defined by abnormal development of synapses in the brain. Early detection of brain tumors is essential for improving prognosis, and classifying tumors is a vital step in the disease's treatment. Different classification strategies using deep learning have been presented for the diagnosis of brain tumors. However, several challenges exist, such as the need for a competent specialist in classifying brain cancers by deep learning models and the problem of building the most precise deep learning model for categorizing brain tumors. We propose an evolved and highly efficient model based on deep learning and improved metaheuristic algorithms to address these challenges. Specifically, we develop an optimized residual learning architecture for classifying multiple brain tumors and propose an improved variant of the Hunger Games Search algorithm (I-HGS) based on combining two enhancing strategies: Local Escaping Operator (LEO) and Brownian motion. These two strategies balance solution diversity and convergence speed, boosting the optimization performance and staying away from the local optima. First, we have evaluated the I-HGS algorithm on the IEEE Congress on Evolutionary Computation held in 2020 (CEC'2020) test functions, demonstrating that I-HGS outperformed the basic HGS and other popular algorithms regarding statistical convergence, and various measures. The suggested model is then applied to the optimization of the hyperparameters of the Residual Network 50 (ResNet50) model (I-HGS-ResNet50) for brain cancer identification, proving its overall efficacy. We utilize several publicly available, gold-standard datasets of brain MRI images. The proposed I-HGS-ResNet50 model is compared with other existing studies as well as with other deep learning architectures, including Visual Geometry Group 16-layer (VGG16), MobileNet, and Densely Connected Convolutional Network 201 (DenseNet201). The experiments demonstrated that the proposed I-HGS-ResNet50 model surpasses the previous studies and other well-known deep learning models. I-HGS-ResNet50 acquired an accuracy of 99.89%, 99.72%, and 99.88% for the three datasets. These results efficiently prove the potential of the proposed I-HGS-ResNet50 model for accurate brain tumor classification.

A modified reptile search algorithm for global optimization and image segmentation: Case study brain MRI images

In this paper, we proposed an enhanced reptile search algorithm (RSA) for global optimization and selected optimal thresholding values for multilevel image segmentation. RSA is a recent metaheuristic optimization algorithm depending on the hunting behavior of crocodiles. RSA is inclined to inadequate diversity, local optima, and unbalanced exploitation abilities as other metaheuristic algorithms. The RUNge Kutta optimizer (RUN) is a novel metaheuristic algorithm that has demonstrated effectiveness in solving real-world optimization problems. The enhanced solution quality (ESQ) in RUN utilizes the thus-far best solution to promote the quality of solutions, improve the convergence speed, and effectively balance the exploration and exploitation steps. Also, the Scale factor (SF) has a randomized adaptation nature, which helps RUN in further improving the exploration and exploitation steps. This parameter ensures a smooth transition from exploration to exploitation. In order to mitigate the drawbacks of the RSA algorithm, this paper proposed a modified RSA (mRSA), which combines the RSA algorithm with the RUN. The ESQ mechanism and the scale factor boost the original RSA's performance, enhance convergence speed, bypass local optimum, and enhance the balance between exploitation and exploration. The validity of mRSA was verified using two experimental sequences. First, we applied mRSA to CEC'2020 benchmark functions of various types and dimensions, showing that mRSA has more robust search capabilities than the original RSA and popular counterpart algorithms concerning statistical, convergence, and diversity measurements. The second experiment evaluated mRSA for a real-world application to solve magnetic resonance imaging (MRI) brain image segmentation. Overall experimental results confirm that the mRSA has a strong optimization ability. Also, mRSA method is a more successful multilevel thresholding segmentation and outperforms comparison methods according to different performance measures.

Fractional-Order Boosted Jellyfish Search Optimizer with Gaussian Mutation for Income Forecast of Rural Resident

The disposable income of residents can reflect the living standard of people in the area. For government departments, it is necessary to master the trend of rural resident income to formulate corresponding policies benefiting farmers. Thus, this paper proposes a grey model with an improved jellyfish search optimizer to predict the rural resident income in Shaanxi Province. Firstly, by applying fractional-order modified strategy and Gaussian mutation mechanism to the original algorithm, the proposed algorithm shows better performance in solving accuracy, stability, and convergence acceleration when compared with different classical methods on cec2017 and cec2019 test functions. Then, based on the fractional time-delayed grey model, a discrete fractional time-delayed grey model with triangular residual correction (TDFTDGM) is proposed by replacing the derivative with a first-order difference and introducing the triangular residual correction functions. Finally, the improved jellyfish search optimizer is used to explore the optimal order of the TDFTDGM model. The all-around performance of the forecast model is incomparable to additional grey models compared on four measure criteria, which means it is a practical approach for long-term prediction with small samples. Moreover, the forecast data of rural resident income in Shaanxi Province from 2021 to 2025 are given for reference.

Nature-inspired optimization algorithms and their significance in multi-thresholding image segmentation: an inclusive review

Multilevel Thresholding (MLT) is considered as a significant and imperative research field in image segmentation that can efficiently resolve difficulties aroused while analyzing the segmented regions of multifaceted images with complicated nonlinear conditions. MLT being a simple exponential combinatorial optimization problem is commonly phrased by means of a sophisticated objective function requirement that can only be addressed by nondeterministic approaches. Consequently, researchers are engaging Nature-Inspired Optimization Algorithms (NIOA) as an alternate methodology that can be widely employed for resolving problems related to MLT. This paper delivers an acquainted review related to novel NIOA shaped lately in last three years (2019-2021) highlighting and exploring the major challenges encountered during the development of image multi-thresholding models based on NIOA.