Local Optimal Value Research Articles

An improved Coati Optimization Algorithm with multiple strategies for engineering design optimization problems

Aiming at the problems of insufficient ability of artificial COA in the late optimization search period, loss of population diversity, easy to fall into local extreme value, resulting in slow convergence and lack of exploration ability; In this paper, an improved COA algorithm based on chaotic sequence, nonlinear inertia weight, adaptive T-distribution variation strategy and alert updating strategy is proposed to enhance the performance of COA (shorted as TNTWCOA). The algorithm introduces chaotic sequence mechanism to initialize the position. The position distribution of the initial solution is more uniform, the high quality initial solution is generated, the population richness is increased, and the problem of poor quality and uneven initial solution of the Coati Optimization Algorithm is solved. In exploration phase, the nonlinear inertial weight factor is introduced to coordinate the local optimization ability and global search ability of the algorithm. In the exploitation phase, adaptive T-distribution variation is introduced to increase the diversity of individual population under low fitness value and improve the ability of the algorithm to jump out of the local optimal value. At the same time, the alert update mechanism is proposed to improve the alert ability of COA algorithm, so that it can search within the optional range. When Coati is aware of the danger, Coati on the edge of the population will quickly move to the safe area to obtain a better position, while Coati in the middle of the population will randomly move to get closer to other Coatis. IEEE CEC2017 with 29 classic test functions were used to evaluate the convergence speed, convergence accuracy and other indicators of TNTWCOA algorithm. Meanwhile, TNTWCOA was used to verify 4 engineering design optimization problems, such as pressure vessel optimization design and welding beam design. The results of IEEE CEC2017 and engineering design Optimization problems are compared with Improved Coati Optimization Algorithm (ICOA), Coati Optimization Algorithm (COA), Golden Jackal Optimization Algorithm (GJO), Osprey Optimization Algorithm (OOA), Sand Cat Swarm Optimization Algorithm (SCSO), Subtraction-Average-Based Optimizer (SABO). The experimental results show that the improved TNTWCOA algorithm significantly improves the convergence speed and optimization accuracy, and has good robustness. Three‑bar truss design problem, The Gear Train Design Problem, Speed reducer design problem shows a strong solution advantage. The superior optimization ability and engineering practicability of TNTWCOA algorithm are verified.

Adaptive Factor Fuzzy Controller for Keeping Multi-UAV Formation While Avoiding Dynamic Obstacles

The development of unmanned aerial vehicle (UAV) formation systems has brought significant advantages across various fields. However, formation change and obstacle avoidance control have long been fundamental challenges in formation flight research, with the majority of studies concentrating primarily on quadrotor formations. This paper introduces a novel approach, proposing a new method for designing a formation adaptive factor fuzzy controller (AFFC) and an artificial potential field (APF) method based on an enhanced repulsive potential function. These methods aim to ensure the smooth completion of fixed-wing formation flight tasks in three-dimensional (3D) dynamic environments. Compared to the traditional fuzzy controller (FC), this approach introduces a fuzzy adaptive factor and establishes fuzzy rules to address parameter-tuning uncertainties. Simultaneously, improvements to the obstacle avoidance algorithm mitigate the issue of local optimal values. Finally, multiple simulation experiments were conducted. The findings show that the suggested method outperforms the proportional–integral–derivative (PID) control and fuzzy control methods in achieving formation transformation tasks, resolving formation obstacle avoidance challenges, enabling formation reconstruction, and enhancing formation safety and robustness.

A novel multi-strategy ameliorated quasi-oppositional chaotic tunicate swarm algorithm for global optimization and constrained engineering applications

Over the last few decades, a number of prominent meta-heuristic algorithms have been put forth to address complex optimization problems. However, there is a critical need to enhance these existing meta-heuristics by employing a variety of evolutionary techniques to tackle the emerging challenges in engineering applications. As a result, this study attempts to boost the efficiency of the recently introduced bio-inspired algorithm, the Tunicate Swarm Algorithm (TSA), which is motivated by the foraging and swarming behaviour of bioluminescent tunicates residing in the deep sea. Like other algorithms, the TSA has certain limitations, including getting trapped in the local optimal values and a lack of exploration ability, resulting in premature convergence when dealing with highly challenging optimization problems. To overcome these shortcomings, a novel multi-strategy ameliorated TSA, termed the Quasi-Oppositional Chaotic TSA (QOCTSA), has been proposed as an enhanced variant of TSA. This enhanced method contributes the simultaneous incorporation of the Quasi-Oppositional Based Learning (QOBL) and Chaotic Local Search (CLS) mechanisms to effectively balance exploration and exploitation. The implementation of QOBL improves convergence accuracy and exploration rate, while the inclusion of a CLS strategy with ten chaotic maps improves exploitation by enhancing local search ability around the most prospective regions. Thus, the QOCTSA significantly enhances convergence accuracy while maintaining TSA diversification. The experimentations are conducted on a set of thirty-three diverse functions: CEC2005 and CEC2019 test functions, as well as several real-world engineering problems. The statistical and graphical outcomes indicate that QOCTSA is superior to TSA and exhibits a faster rate of convergence. Furthermore, the statistical tests, specifically the Wilcoxon rank-sum test and t-test, reveal that the QOCTSA method outperforms the other competing algorithms in the domain of real-world engineering design problems.

Soil Salinity Inversion in Yellow River Delta by Regularized Extreme Learning Machine Based on ICOA

Soil salinization has seriously affected agricultural production and ecological balance in the Yellow River Delta region. Rapid and accurate monitoring of soil salinity has become an urgent need. Traditional machine learning models tend to fall into local optimal values during the learning process, which reduces their accuracy. This paper introduces Circle map to enhance the crayfish optimization algorithm (COA), which is then integrated with the regularized extreme learning machine (RELM) model, aiming to improve the accuracy of soil salinity content (SSC) inversion in the Yellow River Delta region. We employed Landsat5 TM remote sensing images and measured salinity data to develop spectral indices, such as the band index, salinity index, vegetation index, and comprehensive index, selecting the optimal modeling variable group through Pearson correlation analysis and variable projection importance analysis. The back propagation neural network (BPNN), RELM, and improved crayfish optimization algorithm–regularized extreme learning machine (ICOA-RELM) models were constructed using measured data and selected variable groups for SSC inversion. The results indicate that the ICOA-RELM model enhances the R2 value by an average of about 0.1 compared to other models, particularly those using groups of variables filtered by variable projection importance analysis as input variables, which showed the best inversion effect (test set R2 value of 0.75, MAE of 0.198, RMSE of 0.249). The SSC inversion results indicate a higher salinization degree in the coastal regions of the Yellow River Delta and a lower degree in the inland areas, with moderate saline soil and severe saline soil comprising 48.69% of the total area. These results are consistent with the actual sampling results, which verify the practicability of the model. This paper’s methods and findings introduce an innovative and practical tool for monitoring and managing salinized soils in the Yellow River Delta, offering significant theoretical and practical benefits.

Selection maintains a nonadaptive floral polyphenism.

Adaptive phenotypic plasticity evolves in response to the contrasting selection pressures that arise when organisms face environmental heterogeneity. Despite its importance for understanding how organisms successfully cope with environmental change, adaptive plasticity is often assumed but rarely demonstrated. We study here the adaptive nature of the extreme seasonal within-individual floral polyphenism exhibited by the crucifer Moricandia arvensis, a Mediterranean species that produces two different types of flowers depending on the season of the year. During spring, this species has large, cross-shaped, lilac flowers, while during summer, it develops small, rounded, white flowers. Although floral polyphenism was associated with increased plant fitness, selection moved floral traits away from their local optimum values during the harsh summer. This result strongly suggests that floral polyphenism is not adaptive in M. arvensis. The main factor selecting against floral polyphenism was pollinators, as they select for the same floral morph in all environments. Despite not being adaptive, floral polyphenism occurs throughout the entire distribution range of M. arvensis and has probably been present since the origin of the species. To solve this paradox, we explored the factors causing floral polyphenism, finding that floral polyphenism was triggered by summer flowering. Summer flowering was beneficial because it led to extra seed production and was favored by adaptive plasticity in leaf functional traits. Taken together, our study reveals a complex scenario in which nonadaptive floral polyphenism has been indirectly maintained over M. arvensis evolutionary history by selection operating to favor summer flowering. Our study provides thus strong evidence that nonadaptive plasticity may evolve as a byproduct of colonizing stressful environments.

Efficient knowledge model for whale optimization algorithm to solve large-scale problems

In the process of digital transformation and development in various industries, there are more and more large-scale optimization problems. Currently, swarm intelligence optimization algorithms are the best method to solve such problems. However, previous experimental research has found that there is still room for improvement in the performance of using existing swarm intelligence optimization algorithms to solve such problems. To obtain the high-precision optimal value of whale optimization algorithm (WOA) for solving large-scale optimization problems, the optimization problem knowledge model is studied to guide the iterative process of WOA algorithm, and a novel whale optimization algorithm based on knowledge model guidance (KMGWOA) is proposed. First, a population update strategy based on multiple elite individuals is proposed to reduce the impact of the local optimal values, and the knowledge model to guide population update is constructed by combining the proposed population update strategy with the population update strategy based on global optimal individual. Second, a collaborative reverse learning knowledge model with multiple elite and poor individuals in the solution space is proposed to prevent long-term non-ideal region search. The above two knowledge models guide the iterative process of WOA algorithm in solving large-scale optimization problems. The performance of the KMGWOA algorithm guided by the proposed knowledge models is tested through the well-known classical test functions. The results demonstrate that the proposed KMGWOA algorithm not only has good search ability for the theoretical optimal value, but also achieves higher accuracy in obtaining the optimal value when it is difficult to obtain the theoretical optimal value. Moreover, KMGWOA algorithm has fast convergence speed and high effective iteration percentage.

Resilient distributed optimization for cyber–physical systems under adversarial environments: An event-based method

This work presents a resilient distributed optimization algorithm based on the event-triggering mechanism for cyber–physical systems (CPSs) to optimize an average of convex cost functions corresponding to multiple agents under adversarial environments. Two attack scenarios, including the f-total (each agent is affected by at most f malicious agents in the whole network) and the f-local (each agent is affected by at most f malicious agents in its in-neighbor set) attacks are considered. Subsequently, the convergence conditions under these two attack scenarios are provided, respectively, both of which guarantee that the state values of benign agents converge to a bounded error range. The optimality conditions are also presented by theoretical analysis, which guarantee that the state values of benign agents converge to a safety interval constructed by local optimal values under certain graph conditions, despite the misbehavior of malicious agents. In addition, four numerical examples are presented to show the effectiveness and superiority of the event-triggering resilient distributed optimization (RDO-E) algorithm. Compared to existing resilient algorithms, the proposed method achieves resilient distributed optimization with higher accuracy and less demanding communication overheads. Finally, by applying the proposed method to the multi-microgrid system, a resilient economic dispatch problem (REDP) is successfully solved, which validates the practical viability of the RDO-E algorithm.

A Production Prediction Model of Tight Gas Well Optimized with a Back Propagation (BP) Neural Network Based on the Sparrow Search Algorithm

The production of tight gas wells decreases rapidly, and the traditional method is difficult to accurately predict the production of tight gas wells. At present, intelligent algorithms based on big data have been applied in oil and gas well production prediction, but there are still some technical problems. For example, the traditional error back propagation neural network (BP) still has the problem of finding the local optimal value, resulting in low prediction accuracy. In order to solve this problem, this paper establishes the output prediction method of BP neural network optimized with the sparrow search algorithm (SSA), and optimizes the hyperparameters of BP network such as activation function, training function, hidden layer, and node number based on examples, and constructs a high-precision SSA-BP neural network model. Data from 20 tight gas wells, the SSA-BP neural network model, Hongyuan model, and Arps model are predicted and compared. The results indicate that when the proportion of the predicted data is 20%, the SSA-BP model predicts an average absolute mean percentage error of 20.16%. When the proportion of forecast data is 10% of the total data, the SSA-BP algorithm has high accuracy and high stability. When the proportion of predicted data is 10%, the mean absolute average percentage error is 3.97%, which provides a new method for tight gas well productivity prediction.

Model Parameters Identification and Backstepping Control of Lower Limb Exoskeleton Based on Enhanced Whale Algorithm

Exoskeletons generally require accurate dynamic models to design the model-based controller conveniently under the human-robot interaction condition. However, due to unknown model parameters such as the mass, moment of inertia and mechanical size, the dynamic model of exoskeletons is difficult to construct. Hence, an enhanced whale optimization algorithm (EWOA) is proposed to identify the exoskeleton model parameters. Meanwhile, the periodic excitation trajectories are designed by finite Fourier series to input the desired position demand of exoskeletons with mechanical physical constraints. Then a backstepping controller based on the identified model is adopted to improve the human-robot wearable comfortable performance under cooperative motion. Finally, the proposed Model parameters identification and control are verified by a two-DOF exoskeletons platform. The knee joint motion achieves a steady-state response after 0.5 s. Meanwhile, the position error of hip joint response is less than 0.03 rad after 0.9 s. In addition, the steady-state human-robot interaction torque of the two joints is constrained within 15 N·m\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\ ext{N}\\cdot\ ext{m}}$$\\end{document}. This research proposes a whale optimization algorithm to optimize the excitation trajectory and identify model parameters. Furthermore, an enhanced mutation strategy is adopted to avoid whale evolution's unsatisfactory local optimal value.

Application of dynamic event-triggered hybrid gravitational search algorithm in pipeline leakage detection

In this paper, a hybrid gravitational search algorithm (GSA) based on the dynamic event-triggered mechanism, which is called DHGSA, is proposed to alleviate the slow exploitation problem of the GSA that may result in premature convergence and falling into local optimization. First, the DHGSA is divided into the exploration stage and the exploitation stage through the introduction of the population diversity. Then, the memory and social information exchange abilities of the particle swarm optimization algorithm are added in the DHGSA’s exploration stage, which can accelerate the convergence speed of the GSA. Next, the dynamic event-triggered mechanism (DETM) is added in the exploitation stage of the DHGSA, and a “celestial banishment strategy” is proposed, which improves the exploitation ability of the GSA and makes it have the ability to avoid falling into local optimal value. The derived results indicate that, compared with several other well-known search algorithms, the DHGSA has better performance on convergence speed, optimization accuracy and stability. Finally, the DHGSA is employed to optimize the parameters of the variational mode decomposition (VMD) algorithm for the oil and gas pipeline signal decomposition. The signal-to-noise ratio (SNR) of the three types of pipeline signals after denoising reaches 8.8406 dB, 9.0869 dB and 5.6880 dB, respectively. It is proved that the leakage signals can be denoised effectively in the research of the oil and gas pipeline signal processing.

A new approach for seepage parameter inversion of earth–rockfill dams based on an improved sparrow search algorithm

This paper introduces a novel seepage parameter inversion method for earth–rockfill dams. The method utilizes pore water pressure data and employs a radial basis function (RBF) neural network as a surrogate model, which is optimized with the improved chaos sparrow search algorithm (ICSSA) using a hybrid strategy. The improved surrogate model (ICSSA–RBF) establishes a nonlinear relationship between the seepage parameter and pore water pressure. Unlike the original algorithm, the algorithm proposed in this paper can avoid three principal problems: the optimization search falling into a local optimal value, the population diversity decreasing during the iteration process, and the RBF neural network being prone to overfitting. The ICSSA, which is proficient in recognizing an objective function's significant values, is also chosen for identifying the parameters. To validate the effectiveness of the proposed approach, four classical test functions, a numerical model, and an actual engineering project are considered for the comparative analysis. The study outcomes reveal that ICSSA–RBF exhibits an exceptional level of prediction accuracy, with a mean relative error of less than 5‰. The findings also affirm the potential of the proposed approach in parameter identification and its superiority in facilitating the evaluation of seepage parameters in earth–rockfill dams.

A multi-strategy improved snake optimizer and its application to SVM parameter selection

<p>Support vector machine (SVM) is an effective classification tool and maturely used in various fields. However, its performance is very sensitive to parameters. As a newly proposed swarm intelligence algorithm, snake optimizer algorithm (SO) can help to solve the parameter selection problem. Nevertheless, SO has the shortcomings of weak population initialization, slow convergence speed in the early stage, and being easy to fall into local optimization. To address these problems, an improved snake optimizer algorithm (ISO) was proposed. The mirror opposition-based learning mechanism (MOBL) improved the population quality to enhance the optimization speed. The novel evolutionary population dynamics model (NEPD) was beneficial for searching accurately. The differential evolution strategy (DES) helped to reduce the probability of falling into local optimal value. The experimental results of classical benchmark functions and CEC2022 showed that ISO had higher optimization precision and faster convergence rate. In addition, it was also applied to the parameter selection of SVM to demonstrate the effectiveness of the proposed ISO.</p>

Reverse design and optimization of digital terahertz bandpass filters

In this paper, an ingenious reverse design method is applied to the design and optimization of terahertz bandpass filters in order to achieve standardized design of high-performance terahertz functional devices. An equivalent model of subwavelength metasurface mapped to digital space is established. Based on ideal objective functions and constraints, intelligent algorithms begin a bold journey to explore the vast potential structure in the solution space. Through iterative refinement, the algorithm reveals optimal structural patterns, unlocking areas of unparalleled performance. The direct binary search (DBS) algorithm and the binary particle swarm optimization (BPSO) algorithm are compared in optimization process. When using the DBS algorithm to optimize the design area, it takes a long time to poll the logic states of all pixel units point by point, and it is easy to get stuck in the local optimal value. However, BPSO algorithm has stronger global search capabilities, faster convergence speed, and higher accuracy. Through a comprehensive comparison of the device performance optimized by the two algorithms, the solution optimized by BPSO algorithm has better out-of-band suppression performance and a narrower full width at half peak, but slightly lower transmittance at the center frequency. The bandpass filter has a center frequency of 0.51 THz, a bandwidth of 41.5 GHz, and an insertion loss of -0.1071 dB. When considering computational efficiency, DBS algorithm lags behind, the simulation time is 11550 s, while BPSO algorithm only needs 9750 s. Compared with the traditional forward design, the reverse design method can achieve the narrower band, lower insertion loss, better out-of-band suppression and polarization stability. The fine structural changes of the optimal results have a significant influence on spectral performance, demonstrating the superiority and uniqueness of reverse design. This technology contributes to the design and optimization of high-performance and novel functional devices.

Simulation of temperature field and optimization of heat dissipation structure for lithium-ion power battery pack based on multi-objective function optimization

In order to improve the thermal power dissipation of batteries and reduce the maximum temperature difference of batteries, the air conditioning system using battery type was optimized. Using multi-objective optimization method based on orthogonal experiment and multiple rotations, the local optimum values of multi-objective were obtained: the left end height A of entrance area and the height B of air outlet were 9 mm and 28 mm, respectively, with a tolerance value C of 0.4 mm for battery spacing. The simulation results of this optimization model show that the maximum temperature difference of the battery volume is 306.627 K (33.477?C) and 3.815 K (3.815?C), respectively. Compared with the initial model, they are reduced by 9.55% and 25.89%, respectively. Compared with the single factor analysis optimization model, they are reduced by 0.36% and 20.27%, respectively, indicating that the multi-objective optimization results are better. This multi-objective programming solves the problem of different parameters of air conditioning heat dissipation model to some extent, and can provide reference for the optimization design of other models.

Wireless Sensor Network Coverage Optimization for Internet of Things

The objective of this work is to improve the existing Wireless Sensor Network coverage optimization method. The pigeon-inspired optimization algorithm was first evaluated, and its shortcomings were noted. The pigeon-inspired optimization method was then enhanced with the good point set, Yin-Yang optimization algorithm, and opposition-based learning. To test the improved algorithm, five representative standard functions were chosen: sphere function (f1), Rosenbrock function (f2), Levy function (f3), Schwefel function (f4), and Levy function N.13 (f5). The algorithm's speed of convergence may be determined by the first two functions, which are unimodal. The final three functions, which are multimodal, can extract several local optimal values from the local optimum. In comparison with other known algorithms, the improved Yin-Yang PIO algorithm showed the highest optimization accuracy and stability. Three sets of experiments were performed to optimize the WSN coverage with different parameters. The first series of experiments suggest that Yin–Yang PIO has the best optimization effect, with a coverage rate of 99.51% (10.22% higher with PIO and 6.41% higher compared with PSO). The second and third series of experiments show that Yin-Yang PIO significantly increased the WSN coverage ratio, up to 99.9%. The algorithm can be applied to optimize WSN coverage in various environments. Future research can extend the research scope to include other optimization problems in IoT. 

Multi‐objective Firefly algorithm combining logistic mapping and Cauchy mutation

SummaryIn the process of evolution, the multi‐target Firefly algorithm has a single learning strategy and is easy to fall into premature convergence, resulting in poor comprehensive performance of the algorithm. To solve this problem, a multi‐objective firefly algorithm (MOFA‐LM) combining logistic mapping and Cauchy mutation is proposed in this article. To improve the uneven distribution of the initial population, the initial population with good ergodicity is generated by logistic mapping. Aiming at the problem that the population is easy to fall into local optimal, Cauchy mutation can generate relatively large disturbance when fireflies are updating their positions, which makes it easier to jump out of the local optimal value with a wide range of individual optimization, effectively improve the optimization accuracy of the algorithm, overcome the premature convergence of the algorithm and maintain the convergence of the population. In the experimental part, the proposed algorithm is compared with some multi‐objective optimization algorithms in 19 benchmark test functions, and the effectiveness of the strategy added by MOFA‐LM is verified. The results show that MOFA‐LM has obvious advantages over other algorithms in improving population convergence and distribution.

Research on the Innovative Application of Particle Swarm Algorithm in the Improvement of Management Efficiency of Digital Enterprises

Abstract This paper constructs a model of the particle swarm algorithm, compares and analyzes the performance of the particle swarm algorithm under the two parameters of w and k in detail, and solves the constrained optimization problem by the particle swarm algorithm. On the basis of the local optimal value to find the global optimal value, the particle swarm algorithm is improved with reference to the particle’s motion state and behavior. Based on the particle swarm algorithm, a digital enterprise management system is constructed to plan enterprise management operations and optimize efficiency. Finally, we compare the performance of different algorithms in enterprise management risk prediction, analyze the correlation between the management system and enterprise management efficiency, and compare the management efficiency of different enterprises to explore the effect of the particle swarm algorithm in digital enterprise management. The results show that the predictive classification effect of the particle swarm algorithm model reaches more than 95% correct rate, and the management system of the particle swarm algorithm presents significance at 1% and 5% significance level for enterprise management efficiency, respectively.

Multi-source underwater DOA estimation using PSO-BP neural network based on high-order cumulant optimization

Due to the complex and changeable environment under water, the performance of traditional DOA estimation algorithms based on mathematical model, such as MUSIC, ESPRIT, etc., degrades greatly or even some mistakes can be made because of the mismatch between algorithm model and actual environment model. In addition, the neural network has the ability of generalization and mapping, it can consider the noise, transmission channel inconsistency and other factors of the objective environment. Therefore, this paper utilizes Back Propagation (BP) neural network as the basic framework of underwater DOA estimation. Furthermore, in order to improve the performance of DOA estimation of BP neural network, the following three improvements are proposed. (1) Aiming at the problem that the weight and threshold of traditional BP neural network converge slowly and easily fall into the local optimal value in the iterative process, PSO-BP-NN based on optimized particle swarm optimization (PSO) algorithm is proposed. (2) The Higher-order cumulant of the received signal is utilized to establish the training model. (3) A BP neural network training method for arbitrary number of sources is proposed. Finally, the effectiveness of the proposed algorithm is proved by comparing with the state-of-the-art algorithms and MUSIC algorithm.

Accurate method for correcting the translation position error of ptychography based on quantum particle swarm optimization

In ptychography, the translation position error will cause the periodic grid deviation and tremendously decrease the reconstruction quality. It is crucial to attain the precise translation position of the probe with respect to the object. The current correction methods may fall into a local optimal value, and miss the better results. An accurate method based on the quantum particle swarm optimization is proposed to globally correct the translation position error and add the randomness to avoid trapping in local optimum. In our proposed method, particles in a quantum bound state can appear at any point in the solution space with a certain probability density. In order words, the corrected translation position can be spread over the searching space, which can acquire the possibility of jumping out of the local optimum. Experiments are conducted to verify that our proposed method can be used to enhance the correction accuracy of the translation position error as well as avoid local optimum.

The F/DR-D-10 Algorithm: A Novel Heuristic Strategy to Solve the Minimum Span Frequency Assignment Problem Embedded in Mobile Applications

Wireless communication supports various real-world applications, such as aeronautical navigation, satellite and TV broadcasting, wireless LANs, and mobile communications. The inherent characteristics of the electromagnetic spectrum impose constraints on telecommunication channels and their frequency bandwidths within mobile networks. A persistent challenge in these applications is providing high-demand services to mobile users, where frequency assignment problems, also known as channel assignment problems, assume significance. Researchers have developed several modeling approaches to address different facets of this problem, including the management of interfering radio signals, the assessment of available frequencies, and optimization criteria. In this paper, we present improved algorithms for solving the Minimum Span Frequency Assignment Problem in mobile communication systems using the greedy optimization approach known as F/DR. We solved and evaluated twenty well-known benchmark cases to assess the efficacy of our algorithms. Our findings consistently demonstrate that the modified algorithms outperform the F/DR approach with comparable computational complexity. The proposed algorithm notably achieves the following benchmarks: The modified algorithms consistently produce at least one local optimum better than the traditional algorithm in all benchmark tests. In 95% of the benchmarks evaluated, the probability of discovering a local optimum value (calculated by the modified algorithm) that is better than or equal to the one found by the conventional algorithm exceeds 50%.