In order to monitor a large fraction of IP flows in an IP network concurrently, a set of flow monitors are needed to be deployed at multiple locations ...
This paper investigated the problem of optimal deployment of flow monitors in large IP networks. A new algorithm GSA, which is a composition of genetic.
This work formulate ODFM as a non-linear programming problem, and proposes a genetic simulated annealing (GSA) algorithm which combines the standard genetic ...
Zhang et al. [50] proposed a genetic algorithm hybridized with simulated annealing to find appropriate traffic count posts to monitor network's traffic flow.
People also ask
What is the simulated annealing algorithm optimal?
Is genetic algorithm better than simulated annealing?
How does the simulated annealing algorithm work?
What is the formula for simulated annealing?
Dec 14, 2018 · We propose a hybrid genetic simulated annealing (HGSA) algorithm for flow shop scheduling problems. In the HGSA algorithm, in order to obtain high-quality ...
Missing: Deployment Monitors.
This research aims to improve the utilization efficiency of parking facilities in residential areas. The real-time and fixed-time shared parking spot ...
Genetic Simulated Annealing Algorithm for Optimal Deployment of Flow Monitors................................. 398. Jin Zhang, Xiaohui Zhang, and Jiangxin Wu.
This paper studies how to optimally place traffic monitors and sample stochastic traffic flows, so that the probability of a packet being sampled is ...
Sep 5, 2022 · The genetic algorithm (GA) approach was applied by many researchers for the purpose of optimal sensor placement. Guo et al. [1] suggested an ...
Apr 1, 2024 · A hybrid Genetic Algorithm and Simulated Annealing method (GA-SAA) are used in the research to strategically find the optimal locations for PEVCS.