Proposed Optimization Algorithm Research Articles

Optimizing fountain codes for DNA data storage

Fountain codes, originally developed for reliable multicasting in communication networks, are effectively applied in various data transmission and storage systems. Their recent use in DNA data storage systems has unique challenges, since the DNA storage channel deviates from the traditional Gaussian white noise erasure model considered in communication networks and has several restrictions as well as special properties. Thus, optimizing fountain codes to address these challenges promises to improve their overall usability in DNA data storage systems. In this article, we present several methods for optimizing fountain codes for DNA data storage. Apart from generally applicable optimizations for fountain codes, we propose optimization algorithms to create tailored distribution functions of fountain codes, which is novel in the context of DNA data storage. We evaluate the proposed methods in terms of various metrics related to the DNA storage channel. Our evaluation shows that optimizing fountain codes for DNA data storage can significantly enhance the reliability and capacity of DNA data storage systems. The developed methods represent a step forward in harnessing the full potential of fountain codes for DNA-based data storage applications. The new coding schemes and all developed methods are available under a free and open-source software license.

Performance Analysis for Reconfigurable Intelligent Surface-aided Communication Systems with Energy Harvesting under Imperfect Nakagami-m Channel Information

Reconfigurable intelligent surface (RIS) can serve as a passive relay to maintain communication between a transceiver in severe scenarios of no direct link between them. In addition, harvesting energy from radio frequency (RF) signals can meliorate significantly energy efficiency. In this research, we propose RIS-aided communication systems with energy harvesting (RISwEH) which combine both RIS and RF energy harvesting to improve energy efficiency as well as communication reliability. To evaluate realistically and quickly the performance of the RISwEH, we propose the explicit formulas of the system throughput and the outage probability under the realistic scenario of Nakagami-m fading and imperfect channel state information (CSI). Moreover, we propose an optimization algorithm relied upon a Golden section search to attain the optimum value of the time splitting factor of energy harvester to obtain the best system performance. Various results corroborate the theoretical derivations, confirm the efficacy of the proposed optimization algorithm, and illustrate the influence of innumerable system settings on the system performance. Particularly, the imperfect CSI deteriorates considerably the system performance. Nonetheless, the performance of the RISwEH can be enhanced by accreting the quantity of the elements of the RIS as well as with the lower fading severity. Furthermore, the time splitting factor also impacts dramatically the outage performance of the RISwEH and its optimal value mitigates significantly the outage probability.

Proximal Policy Optimization-Based Power Grid Structure Optimization for Reliable Splitting

When systems experience a severe fault, splitting, as the final line of defense to ensure the stability of the power system, holds immense significance. The precise selection of splitting sections has become the current focal point of research. Addressing the challenges of a large search space and unclear splitting sections, this paper introduces a grid structure optimization algorithm based on electrical coupling degree. Firstly, employing the theory of slow coherency, a generalized characteristic analysis of the system is conducted, leading to an initial division of coherency groups. Subsequently, an electrical coupling degree index, taking into account the inertia of generators, is proposed. This index can reflect the clarity of grid splitting. Furthermore, a two-layer optimization model for grid structure is constructed, utilizing the Proximal Policy Optimization (PPO) algorithm to optimize the grid structure. This process reduces the size of the splitting space and mitigates the difficulty of acquiring splitting sections. Finally, simulation validation is performed using the IEEE-118-bus system to demonstrate the effectiveness of the proposed optimization algorithm.

A deep Q-learning approach to optimize ordering and dynamic pricing decisions in the presence of strategic customers

In this paper, we present an optimization method to analyze the simultaneous decisions on dynamic pricing and ordering quantities for seasonal products, by a retailer in monopolistic condition. Customers are assumed to be strategic and may postpone their purchase to get a lower price in future. The problem has been investigated in the context of multiple substitute products. We have developed a model based on deep neural networks to estimate customers’ demand. The problem is complex and cannot be solved using classical optimization methods. Therefore, we have developed a reinforcement learning algorithm called deep Q-learning algorithm (DQL) to solve the problem. The proposed algorithm is a combination of a Q-learning algorithm and two deep neural networks for the primary and discount sales periods, which uses the neural network to estimate the Q-values in a large space of states and actions. The performances of the demand model and the proposed optimization algorithm have been tested using a real-world dataset taken from the clothing industry. The results of our experiments demonstrate that the proposed demand model performs better than a fully connected neural network-based model and a latent class model tested in this paper. Furthermore, the performance of the DQL algorithm is significantly superior to those of two simulated annealing and genetic algorithms. In addition, the results of a comparison between the DQL algorithm and another reinforcement learning algorithm called State-Action-Reward-State-Action (SARSA) indicate that the proposed algorithm results in higher revenues and takes less time to converge. Consequently, the proposed algorithm has a high potential for solving such a large scale integrated pricing and ordering optimization problem.

Satellite image recognition using ensemble neural networks and difference gradient positive-negative momentum

The modern machine learning theory finds application in many areas of human activity. One of the most dispersed tasks is pattern recognition on satellite images. It is difficult for a person to recognize a large number of images in a short time. It made the researchers develop the automation process, such as neural network engagement. The loss function minimization and ensemble learning raise the pattern recognition accuracy. We propose the robust difference gradient positive-negative momentum optimization algorithm that achieves the global minimum of the loss function with higher accuracy and fewer iterations than known analogs. Such an optimization algorithm contains the generalized average moving estimation approach and more effective learning rate control by additional parameters. The proposed optimizer has the regret-bound rate estimation, belonging to OT, and converges to the global minimum. However, the main problems in optimization theory are vanishing and blowing gradient values, where the standard gradient-based algorithms fail to achieve the required objective function value. The vanishing and blowing gradient problems meet in Rastrigin and Rosebrock test functions, where the proposed optimization algorithm attains the global extreme in the shortest number of iterations and has a more stable convergence process than state-of-the-art methods. Afterward, there are trained deep convolutional neural networks with different optimizers on satellite images from the University of California merced dataset containing 21 object classes, where the proposed algorithm gives the highest accuracy. There is a suggested ensemble-learning model consisting of 4 networks with different optimizers. The prediction results receive weight coefficients distributed according to the majority voting and ensemble neural network retrains with the higher pattern recognition accuracy. The suggested ensemble-learning model with the developed optimizer raised the accuracy by 1 %–4 % percentage points.

Education robot object detection with a brain-inspired approach integrating Faster R-CNN, YOLOv3, and semi-supervised learning.

The development of education robots has brought tremendous potential and opportunities to the field of education. These intelligent machines can interact with students in classrooms and learning environments, providing personalized educational support. To enable education robots to fulfill their roles, they require accurate object detection capabilities to perceive and understand the surrounding environment of students, identify targets, and interact with them. Object detection in complex environments remains challenging, as classrooms or learning scenarios involve various objects, backgrounds, and lighting conditions. Improving the accuracy and efficiency of object detection is crucial for the development of education robots. This paper introduces the progress of an education robot's object detection based on a brain-inspired heuristic method, which integrates Faster R-CNN, YOLOv3, and semi-supervised learning. By combining the strengths of these three techniques, we can improve the accuracy and efficiency of object detection in education robot systems. In this work, we integrate two popular object detection algorithms: Faster R-CNN and YOLOv3. We conduct a series of experiments on the task of education robot object detection. The experimental results demonstrate that our proposed optimization algorithm significantly outperforms individual algorithms in terms of accuracy and real-time performance. Moreover, through semi-supervised learning, we achieve better performance with fewer labeled samples. This will provide education robots with more accurate perception capabilities, enabling better interaction with students and delivering personalized educational experiences. It will drive the development of the field of education robots, offering innovative and personalized solutions for education.

Football team training algorithm: A novel sport-inspired meta-heuristic optimization algorithm for global optimization

A more efficient optimization algorithm has always been the pursuit of researchers, but the performance of the current optimization algorithm in some complex test functions is not always satisfactory. In order to solve this problem, a new meta-heuristic optimization algorithm—Football Team Training Algorithm (FTTA) is proposed according to the training method of the football team, which simulates the three stages of the training session: Collective Training, Group Training and Individual Extra Training. By the test on two groups of test functions, CEC2005 and CEC2020, the proposed optimization algorithm (FTTA) achieves the best results, which far exceeds the traditional Grey Wolf Optimization (GWO), Whale Optimization Algorithm (WOA) algorithms and so on. In the engineering application, a new hybrid wind speed prediction system is proposed based on FTTA. The FTTA is used to optimize variational mode decomposition (VMD) to improve the effect of data denoising. At the same time, based on unconstrained weighting algorithm, FTTA and combination prediction model build a new hybrid prediction strategy. Through the experiments on four groups of wind speed data in Dalian, the accuracy, stability, advancement, and CPU running speed of the system are verified. It is obvious that the practical application ability of the system is much better than previous methods, which can effectively improve the utilization efficiency of renewable energy.

Shearer parameter optimization and low energy consumption mining based on 3D point cloud characterization of coal wall

AbstractTo achieve efficient and low energy consumption mining under different cutting depths of a shearer, a multiparameter coupling optimization method for the shearer based on three‐dimensional (3D) characterization of the coal wall was proposed. First, a seven‐axis absolute articulated arm measuring machine was used to obtain 3D point cloud data of the coal wall, and then the 3D of the coal wall surface was reconstructed by using segmentation, filtering, and stitching processing, thereby obtaining the average thickness of different coal wall areas. Second, through the quadratic rotation regression orthogonal combination experiment, the optimal combination of drum speed, traction speed, and cutting depth was obtained, further obtaining the order of primary and secondary influences, and the regression model. Moreover, a particle swarm optimization algorithm was used to obtain the optimal drum speed and finally, the laboratory and field test experiments were conducted to verify the effectiveness of the proposed optimization algorithm in reducing the cutting energy consumption of shearer. The experiment results show that the given optimization algorithm can adaptively optimize the traction speed and drum speed based on the corresponding cutting depth, which significantly reduces the cutting specific energy consumption of the shearer. Thus, it provided an important technical means for the shearer to achieve low energy consumption and efficient mining.

Frequency Regulation of Microgrid with Renewable Sources Using Intelligent Adaptive Virtual Inertia Control Approach

Frequency control of small inertia microgrids (MGs) with amalgamation of renewable energies like wind and solar is a difficult job. Virtual inertia control (VIC) scheme is the concept of enhancing the MGs inertia employing storage elements. In the present study, an optimized fuzzy adaptive virtual inertia control strategy has been proposed for adaptive allocation of virtual inertia constant. To tune the suggested controllers, an improved golden jackal optimization (i-GJO) is projected in which priority is given to the better jackal’s during the search process, and also sine cosine adopted scaling factor is used to modify the jackal’s position throughout search process. The effectiveness of i-GJO method is evaluated by comparing the results with golden jackal optimization (GJO) and other similar recently proposed optimization algorithms. Then, proportional-integral-derivative controllers are tuned in VIC environment with fixed virtual inertia constant (KVT ) using proposed i-GJO technique, and the superiority of i-GJO over genetic algorithm, particle swarm optimization, and GJO is demonstrated. Finally, fuzzy based controller with constant KVT as well as fuzzy adaptive KVT has been designed using the proposed i-GJO technique. The sensitivity of the controller is also examined under irregular load changes and various rates of RES amalgamation.

Service Satisfaction-Oriented Task Offloading and UAV Scheduling in UAV-Enabled MEC Networks

With the development of computation-intensive applications, unmanned aerial vehicle (UAV)-enabled multi-access edge computing (MEC) provides task offloading service for the users with or without terrestrial infrastructure support. Meanwhile, the next generation of UAVs communication systems are expected to be user-centric. Therefore, more attention should be paid to users’ satisfaction with the offered service. In this paper, we study the service satisfaction-oriented task offloading and UAV scheduling problem for UAV-enabled MEC networks, where the task priorities are considered based on the delay requirements of users’ tasks and the remaining energy status of users. Specifically, we firstly divide the users into different groups via the K-means-based grouping algorithm. Then, we develop a novel user satisfaction model by jointly considering the task processing delay and energy saving, based on which a total user satisfaction maximization problem is formulated to jointly optimize the task offloading decisions and UAV scheduling strategy. To solve the formulated problem, we decompose it into two sub-problems, i.e., the UAV scheduling sub-problem and the task offloading sub-problem. To solve the first sub-problem, we develop a genetic algorithm (GA)-based UAV scheduling algorithm through dealing with multiple balanced assignment problems. To address the second sub-problem, a GA-based task offloading algorithm is developed. Then, we propose a joint task offloading and UAV scheduling optimization algorithm to solve the original optimization problem. Finally, simulation results demonstrate that the proposed optimization algorithm not only converges fast, but also improves the total users’ satisfaction greatly. The total users’ satisfaction improved by the proposed scheme is up to 16.9% in the case of 170 users.

Optimization on the symplectic Stiefel manifold: SR decomposition-based retraction and applications

Numerous problems in optics, quantum physics, stability analysis, and control of dynamical systems can be brought to an optimization problem with matrix variable subjected to the symplecticity constraint. As this constraint nicely forms a so-called symplectic Stiefel manifold, Riemannian optimization is preferred, because one can borrow ideas from unconstrained optimization methods after preparing necessary geometric tools. Retraction is arguably the most important one which decides the way iterates are updated given a search direction. Two retractions have been constructed so far: one relies on the Cayley transform and the other is designed using quasi-geodesic curves. In this paper, we propose a new retraction which is based on an SR matrix decomposition. We prove that its domain contains the open unit ball which is essential in proving the global convergence of the associated gradient-based optimization algorithm. Moreover, we consider three applications—symplectic target matrix problem, symplectic eigenvalue computation, and symplectic model reduction of Hamiltonian systems—with various examples. The extensive numerical comparisons reveal the strengths of the proposed optimization algorithm.

Deep learning based classification of COVID-19 severity using hierarchical deep maxout model

COVID-19 is a huge pandemic disease and is gradually growing into our daily lives. It has affected us all in different ways, which the World Health Organization classified as a pandemic in 2020. A number of deep learning methods have been developed to identify COVID-19 in chest X-rays, but very few techniques are used to estimate the severity of COVID-19. Additionally, it is very complex to effectively train the data, resulting in slower convergence and time complexities. Therefore, to overcome these drawbacks, this study proposes a unique model to classify the severity of Covid-19 using a deep learning method. The pre-processing step includes image enhancement and noise reduction using the Amended Bilateral Filter (ABF). The relevant features are then extracted using an ensemble-based deep learning model, which includes the DenseNet-201, ResNet-152 and VGG-19 models, which are integrated via an ensemble average approach. The most optimal features are selected using the Modified Archer Fish Optimization Algorithm (Mod-AFO). The proposed optimization algorithm exhibits high convergence and reduced model complexity. COVID-19 severity classification can be effectively categorized using a Multihead attention-assisted hierarchical deep-maxout network model (Multi-HDM). The proposed classification model is comparatively faster in severity estimation and high in performance. Using Python, the proposed model performances are analyzed and compared with the existing models to demonstrate the superiority of the proposed model. The proposed model achieved 98.2% accuracy, 98.5% sensitivity, 96.4% specificity and 96.4% precision in COVID-19 severity estimation using the COVID-19 Chest X-ray images and Lung masks dataset.

Accurate parameter identification of proton exchange membrane fuel cell models using different metaheuristic optimization algorithms

Recently, Numerous metaheuristic techniques have been utilized for the expedient identification of Proton Exchange Membrane Fuel Cells ‎ (PEMFCs) models. The reported techniques can inspect fickle in a wide search space for finding optimal solutions at the appropriate time. In this paper, recent optimization techniques are intended to better identify the unknown parameters of various PEMFCs. Three neoteric metaheuristic techniques of the Gazelle optimization algorithm (GOA), Prairie Dog Optimization Algorithm (PDO), and Reptile Search Algorithm (RSA) have been applied and evaluated. The proposed optimization algorithms have been validated for identifying the parameters of three PEMFCs‎: BCS 500 W PEMFC, SR-12 500 W PEMFC, and 250 W PEMFC stack‎. The sum of the squared errors (SSE) between the estimated voltage and the corresponding measured data was formulated as the objective function (OF). MATLAB/Simulink has been employed to validate the proposed optimization methods. The results showed that the three optimization techniques can solve the Fuel Cell ‎(FC) parameters identification optimization problem. Moreover, there are insignificant distinctions between the three applied methods with regard to their optimal value of the objective function. The finest technique considering the average value of the objective function is GOA for BCS 500 W-PEM with 0.0115, while the worst algorithm is PDO with 0.0112. Additionally, the statistical results prove that the three algorithms have 100%, 99.99%, and 100% tracking efficiencies for GOA, PDO, and RSA, respectively, according to 30 individual launches of BCS 500 W-PEM. The results have been evaluated via those of published articles. The I/V curves achieved employing GOA, PDO, and RSA methods provided a good agreement with the corresponding measured ones with the superiority of the GOA relating to the convergence speed, tracking efficiency, statistical metrics, and estimation accuracy.

A novel travel route planning method based on an ant colony optimization algorithm

Abstract As people’s living standards improve, tourism has become an important way for people to spend their time on leisure and entertainment. The growing number of tourists in recent years has given rise to the creation of tourism-related ancillary services. Travelers need to choose a travel route that suits their needs and expectations and do it in a way that does not cause a waste of time, whether it is an emerging self-driving tour or a traditional tour group. Therefore, the optimization of tourist routes is of great significance to the majority of tourists. Given the planning requirements of tourist attractions in the post-epidemic era, an ant colony-based optimization algorithm is proposed to resolve the planning problem of optimal tourist routes. An optimized pheromone update strategy is also proposed based on the basic ant colony optimization algorithm. The optimized ant colony algorithm tries to balance two conflicting concepts, namely, flows into tourist attractions and the carrying capacity of destinations. To analyze the performance of the proposed optimization algorithm, the effects of different optimization algorithms on the route planning of tourist attractions were compared in the experiment, and the acceleration ratio of the optimized ant colony algorithm was tested using the graphics processing unit parallel computing program. The results show that the proposed algorithm provides certain advantages and has certain potential in parallel computing. To sum up, this study provides a better scientific basis for optimal tourist route planning and has a good reference value.

Disturbance Rejection-Based Optimal PID Controllers for New 6ISO AVR Systems

In the literature, different approaches that are employed in designing automatic voltage regulators (AVRs) usually model the AVR as a single-input-single-output system, where the input is the generator reference voltage, and the output is the generator voltage. Alternately, it could be thought of as a double-input, single-output system, with the excitation voltage change serving as the additional input. In this paper, unlike in the existing literature, we designed the AVR system as a sextuple-input single-output (6ISO) system. The inputs in the model include the generator reference voltage, regulator signal change, exciter signal change, amplifier signal change, generator output signal change, and the sensor signal change. We also compared the generator voltage responses for various structural configurations and regulator parameter choices reported in the literature. The effectiveness of numerous controllers is investigated; the proportional, integral and differential (PID) controller, the PID with second-order derivative (PIDD2) controller, and the fractional order PID (FOPID) controller are the most prevalent types of controllers. The findings reveal that the regulator signal change and the generator output signal change significantly impact the generator voltage. Based on these findings, we propose a new approach to design the regulator parameter to enhance the response to generator reference voltage changes. This approach takes into consideration changes in the generator reference voltage as well as the regulator signal. We calculate the regulator settings using a cutting-edge hybrid technique called the Particle Swarm Optimization African Vultures Optimization algorithm (PSO–AVOA). The effectiveness of the regulator design technique and the proposed optimization algorithm are demonstrated.

Battery state of health prediction based on voltage intervals, BP neural network and genetic algorithm

ABSTRACT Accurate prediction of lithium ion (li-ion) battery capacity is of great significance to battery health status management. In this paper, the different discharge time corresponding to the equal voltage interval is taken as the health factor. Three highly correlated health factors are extracted from the battery discharge curve, and the Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) is used to estimate the battery capacity accurately and quickly. Firstly, health factors related highly to battery capacity from the battery cycle life test are extracted, and the selected health factors are analyzed using the Spearman correlation coefficient and Pearson correlation coefficient. Secondly, this paper analyzes the prediction effect of different combinations of selected health factors using BPNN optimized by a genetic algorithm. Then, to verify the superiority of the proposed optimization algorithm, different optimization algorithms are used to adjust and optimize the parameters of BPNN automatically, and the experimental data are used for comparative analysis. Finally, the GA-BP is compared with other common battery capacity prediction methods. The results show that the GA-BP neural network prediction model can accurately and effectively predict the capacity of li-ion battery when using selected health factors.

Object-based crop classification in Hetao irrigation zone by using deep learning and region merging optimization

crop classification is conducive to precision agriculture. Due to the cost of high-resolution image collection, it is uneasy to conduct crop classification in remotely sensed scenes using deep networks, which have become increasingly popular in remote sensing. This work combines geographical-based image analysis (GEOBIA) with deep learning for crop classification in a small area. An image classifier network is designed by using multi-scale CNN and transformer modules. The network input is an image transformed from a segment obtained using multi-resolution segmentation (MRS). An iterative optimization framework is developed to correct the segments with under-segmentation errors (USE). Two scenes of high-resolution images are employed for the experiment. The proposed optimization algorithm leads to superior performance to competitors. By using the proposed classifier network as a baseline, the optimization approach can improve overall accuracy (OA) by 4.33 % and 1.29 % respectively for the first and second dataset.

Multivariate Time Series Prediction Based on Temporal Change Information Learning Method.

In the multivariate time series prediction tasks, the impact information of all nonpredictive time series on the predictive target series is difficult to be extracted at different time stages. Through the emphasis on optimal-related sequences in the target series, the deep learning model with the attention mechanism achieves a good predictive performance. However, temporal change information in the objective function and optimization algorithm is completely ignored in these models. To this end, a temporal change information learning (CIL) method is proposed in this article. First, mean absolute error (MAE) and mean squared error (MSE) losses are contained in the objective function to evaluate different amplitude errors. Meanwhile, the second-order difference technology is used in the correlation terms of the objective function to adaptively capture the impact of the abrupt and slow change information in each series on the target series. Second, the long short-term memory (LSTM) network with the transformation mechanism is used in the method so that temporal dependence information can be fully extracted (i.e., avoiding the supersaturation region). Third, to effectively obtain the optimal model parameters, the current and historical moment estimation information is adaptively memorized without the introduction of additional hyperparameters, and therefore, the acquisition ability of temporal change information in the error gradient flow is greatly enhanced by the proposed optimization algorithm. Finally, three datasets with different scales are used to verify the advantages of the CIL method in computational overhead and prediction effect.

Improper Gaussian Signaling for IRS Assisted Multiuser SWIPT Systems With Hardware Impairments

In this paper, we focus on intelligent reflecting surface (IRS) assisted multiuser simultaneous wireless information and power transfer (SWIPT) systems with hardware impairments (HWIs), which result from the aggregate effect of in-phase and quadrature-phase imbalance (IQI), power amplifier non-linearity, quantization distortion, phase noise, etc. Improper Gaussian signaling (IGS) is employed to combat the signal distortion incurred by HWIs and the interference from other users. We aim to maximize the minimum achievable information rate among all users by jointly optimizing the active beamforming vectors, passive reflecting coefficients, and power splitting coefficients, subject to the minimum harvested energy requirements of these users and the total power budget at the transmitter. Due to the intricate coupling between the reflecting coefficients and beamforming vectors, we propose a two-level iterative optimization algorithm to solve this non-convex problem. Based on the above, we also study the weighted rate-energy region maximization problem. Numerical results show that the use of IGS significantly outperforms traditional proper Gaussian signaling (PGS) in the considered systems and also affirm the effectiveness of the proposed optimization algorithm.

IDRM: Brain tumor image segmentation with boosted RIME optimization

Timely diagnosis of medical conditions can significantly mitigate the risks they pose to human life. Consequently, there is an urgent demand for an effective auxiliary model that assists physicians in accurately diagnosing medical conditions based on imaging data. While multi-threshold image segmentation models have garnered considerable attention due to their simplicity and ease of implementation, the selection of threshold combinations greatly influences the segmentation performance. Traditional optimization algorithms often require substantial time to address multi-threshold image segmentation problems, and their segmentation accuracy is frequently unsatisfactory. As a result, metaheuristic algorithms have been employed in this domain. However, several algorithms suffer from drawbacks such as premature convergence and inadequate exploration of the solution space when it comes to threshold selection. For instance, the recently proposed optimization algorithm RIME, inspired by the physical phenomenon of rime-ice, falls short in terms of avoiding local optima and fully exploring the solution space. Therefore, this study introduces an enhanced version of RIME, called IDRM, which incorporates an interactive mechanism and Gaussian diffusion strategy. The interactive mechanism facilitates information exchange among agents, enabling them to evolve towards more promising directions and increasing the likelihood of discovering the optimal solution. Additionally, the Gaussian diffusion strategy enhances the agents' local exploration capabilities and expands their search within the solution space, effectively preventing them from becoming trapped in local optima. Experimental results on 30 benchmark test functions demonstrate that IDRM exhibits favorable optimization performance across various optimization functions, showcasing its robustness and convergence properties. Furthermore, the algorithm is applied to select threshold combinations for brain tumor image segmentation, and the results are evaluated using metrics such as Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index Measure (SSIM). The overall findings consistently highlight the exceptional performance of this approach, further validating the effectiveness of IDRM in addressing image segmentation problems.