A Modified Simulated Annealing Algorithm Based on Principle of the Greedy Algorithm for Networks with Mobile Nodes

Pyrih, Yuliia; Kaidan, Mykola; Strykhalyuk, Bohdan; Zhebka, Viktoriia

doi:10.1109/tcset49122.2020.235479

Cited by 2 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where sequence θ t decreases with increasing t. From all constructed routes, the route with the lowest cost is chosen, which is the result of the simulated annealing process. Consider the developed simulated annealing algorithm to improve the routing of information flows in wireless networks (Figure 3) [28,29], which consists of the following steps. Consider the developed simulated annealing algorithm to improve the routing of information flows in wireless networks (Figure 3) [28,29], which consists of the following steps.…”

Section: Simulated Annealingmentioning

confidence: 99%

“…Consider the developed simulated annealing algorithm to improve the routing of information flows in wireless networks (Figure 3) [28,29], which consists of the following steps. Consider the developed simulated annealing algorithm to improve the routing of information flows in wireless networks (Figure 3) [28,29], which consists of the following steps. Algorithm 2.…”

Section: Simulated Annealingmentioning

confidence: 99%

See 1 more Smart Citation

Improving the Efficiency of Information Flow Routing in Wireless Self-Organizing Networks Based on Natural Computing

et al. 2021

View full text Add to dashboard Cite

With the constant growth of requirements to the quality of infocommunication services, special attention is paid to the management of information transfer in wireless self-organizing networks. The clustering algorithm based on the Motley signal propagation model has been improved, resulting in cluster formation based on the criterion of shortest distance and maximum signal power value. It is shown that the use of the improved clustering algorithm compared to its classical version is more efficient for the route search process. Ant and simulated annealing algorithms are presented to perform route search in a wireless sensor network based on the value of the quality of service parameter. A comprehensive routing method based on finding the global extremum of an ordered random search with node addition/removal is proposed by using the presented ant and simulated annealing algorithms. It is shown that the integration of the proposed clustering and routing solutions can reduce the route search duration up to two times.

show abstract

Section: Simulated Annealingmentioning

confidence: 99%

Section: Simulated Annealingmentioning

confidence: 99%

Improving the Efficiency of Information Flow Routing in Wireless Self-Organizing Networks Based on Natural Computing

et al. 2021

View full text Add to dashboard Cite

show abstract

Prediction of Whole Social Electricity Consumption in Jiangsu Province Based on Metabolic FGM (1, 1) Model

Zhang

Cheng

et al. 2022

Mathematics

View full text Add to dashboard Cite

The achievement of the carbon peaking and carbon neutrality targets requires the adjustment of the energy structure, in which the dual-carbon progress of the power industry will directly affect the realization process of the goal. In such terms, an accurate demand forecast is imperative for the government and enterprises’ decision makers to develop an optimal strategy for electric energy planning work in advance. According to the data of the whole social electricity consumption in Jiangsu Province of China from 2015 to 2019, this paper uses the improved particle swarm optimization algorithm to calculate the fractional-order r of the FGM (1, 1) model and establishes a metabolic FGM (1, 1) model to predict the whole social electricity consumption in Jiangsu Province of China from 2020 to 2023. The results show that in the next few years the whole social electricity consumption in Jiangsu Province will show a growth trend, but the growth rate will slow down generally. It can be seen that the prediction accuracy of the metabolic FGM (1, 1) model is higher than that of the GM (1, 1) and FGM (1, 1) models. In addition, the paper analyzes the reasons for the changes in the whole society electricity consumption in Jiangsu Province of China and provides support for government decision making.

show abstract

A Modified Simulated Annealing Algorithm Based on Principle of the Greedy Algorithm for Networks with Mobile Nodes

Cited by 2 publications

References 17 publications

Improving the Efficiency of Information Flow Routing in Wireless Self-Organizing Networks Based on Natural Computing

Improving the Efficiency of Information Flow Routing in Wireless Self-Organizing Networks Based on Natural Computing

Prediction of Whole Social Electricity Consumption in Jiangsu Province Based on Metabolic FGM (1, 1) Model

Contact Info

Product

Resources

About