The main function of computer network routing is to realize the data connection of Internet ports and provide information transmission function for different networks. In recent years, with the continuous development ...
详细信息
The main function of computer network routing is to realize the data connection of Internet ports and provide information transmission function for different networks. In recent years, with the continuous development of multimedia technology, related data services are also constantly strengthened, and computer network applications have become an indispensable part of people's lives. The increase in the number of computer network users and large-scale network coverage also brings higher requirements and challenges to the development of computer networks in China. Rough set theory is an effective tool to solve the system decision-making problem with uncertain and incomplete information;so in this paper, we will be able to apply this theory to build the decision reasoning system of computer routing optimization and optimization algorithm. Based on rough set theory, this paper studies the optimization of computer network routing and the application of optimization algorithms. While optimizing the computer network routing, it can further improve the effective utilization of computer network resources and improve the service quality of computer network for users. In this paper, taking network routing and sample types as the starting point, the optimization of computer network routing and its optimization algorithm are proposed for how to strengthen the service function of computer network routing and further improve the stability and completeness of computer network information transmission.
The pressure on marine renewable resources has rapidly increased over past decades. The resulting scarcity has led to a variety of different control and surveillance instruments. The dynamics of fish stocks are an imp...
详细信息
ISBN:
(纸本)9780769536828
The pressure on marine renewable resources has rapidly increased over past decades. The resulting scarcity has led to a variety of different control and surveillance instruments. The dynamics of fish stocks are an important consideration in determining appropriate fishery management policy. Equally crucial are the dynamics of fishing effort. A variety of growth curves have been applied to model both unpredated, intraspecific population dynamics and more general biological growth. Fishing effort dynamics are determined by the difference in profits and opportunity costs. Several management alternatives are evaluated at equilibrium. Performance variables such as equilibrium catch, social profits, consumer surplus, social benefits, direct fishery employment and income of individual crew are used in the evaluation.
Jaya is a new metaheuristic that in recent years, has been applied to numerous intractable optimization problems. The important difference between Jaya and other optimization algorithms is that Jaya does not require t...
详细信息
ISBN:
(纸本)9781538691885
Jaya is a new metaheuristic that in recent years, has been applied to numerous intractable optimization problems. The important difference between Jaya and other optimization algorithms is that Jaya does not require the tuning of its parameters (a process needed in the other algorithms to escape unwanted convergence). Another different is the efficiency of Jaya in always choosing the best solution. In this paper, a review of the recent application of Jaya algorithm in the field of optimization problem was reviewed.
Underwater wireless sensor networks nodes deployment optimization problem is studied and underwater wireless sensor nodes deployment determines its capability and lifetime. If no underwater wireless sensor node is ava...
详细信息
ISBN:
(数字)9783030050900
ISBN:
(纸本)9783030050900;9783030050894
Underwater wireless sensor networks nodes deployment optimization problem is studied and underwater wireless sensor nodes deployment determines its capability and lifetime. If no underwater wireless sensor node is available in the monitoring area of underwater wireless sensor networks due to used up energy or any other reasons, the monitoring area where is not detected by any underwater wireless sensor node forms coverage holes. In order to improve the coverage of the underwater wireless sensor networks and prolong the lifetime of the underwater wireless sensor networks, based on the perception model, establish nodes detection model, combining with the data fusion. Because the underwater wireless sensor networks nodes coverage holes appear when the initial randomly deployment, a nodes deployment algorithm based on perception model of underwater wireless sensor networks is designed in this article. The simulation results show that this algorithm can effectively reduce the number of deployment underwater wireless sensor networks nodes, improve the efficiency of underwater wireless sensor networks coverage, reduce the underwater wireless sensor networks nodes energy consumption, prolong the lifetime of the underwater wireless sensor networks.
It is now important to prepare spectrum auction for the 5th Generation Mobile Networks that will start operation in 2020. This paper proposes a novel approach for the optimization for the 5G spectrum. Our ultimate tar...
详细信息
ISBN:
(纸本)9781538676356
It is now important to prepare spectrum auction for the 5th Generation Mobile Networks that will start operation in 2020. This paper proposes a novel approach for the optimization for the 5G spectrum. Our ultimate target is to determine the various variables of 5G to optimize the revenue of the spectrum auction by the optimization algorithms. For the optimization, we develop advanced Simulated Annealing algorithm and Genetic algorithm. We use the costs and benefits of telecommunication companies as a constraint to achieve the goal of revenue maximization. Finally, this paper shows the optimal results by chart. This study is the first of its kind thus far.
This method is explained and demonstrated how to calculate obstacle limit takeoff weight. According regulation requirement, under an engine failure conditions, it needs to consider the takeoff flight path different se...
详细信息
ISBN:
(纸本)9783038350064
This method is explained and demonstrated how to calculate obstacle limit takeoff weight. According regulation requirement, under an engine failure conditions, it needs to consider the takeoff flight path different segments which can clear all obstacles([1]). In this paper, take-off gross flight path and net flight path are analyzed, and taking an aircraft for example, obstacle limit takeoff weight are calculated, Simulation results show the feasibility of optimization algorithm.
It is not perfect in view of the fact that the information guidance system of parking spaces in large and medium-sized parking lots at present, it is difficult to find a empty parking spaces in parking lots. One of th...
详细信息
ISBN:
(纸本)9781665404457
It is not perfect in view of the fact that the information guidance system of parking spaces in large and medium-sized parking lots at present, it is difficult to find a empty parking spaces in parking lots. One of the problems is large amount of calculation in traditional Dijkstra algorithm. In this paper, the improved Dijkstra algorithm is presented and optimized to find the best parking path with the purpose of looking for the nearest free parking space based on the layout model in parking lot parking guidance. The experiments show that it can find the optimal parking space and the optimal parking path by the improved Dijkstra algorithm, and improve the parking efficiency.
After the analysis of the theory of optical thin film optimization design, it is proposed that multi-objective optimization with mixed discrete variable is the essential mathematical model, which can reflect the physi...
详细信息
ISBN:
(纸本)9780819480859
After the analysis of the theory of optical thin film optimization design, it is proposed that multi-objective optimization with mixed discrete variable is the essential mathematical model, which can reflect the physical essence of optical thin film design. The optimization algorithm for single objective problem that have been widely used in the fields of optical thin film is only a simplification. Based on this new consideration, and combined with the status of multi-objective optimization research, an immune optimization algorithm for multi-objective optimization problem is adopted to design optical thin film. According to the results of experiments, the idea of applying multi-objective optimization approach to design optical thin film can be achieved in theory and have a bright future.
In the recent years, many heuristic optimization algorithms have been developed. A majority of these heuristic algorithms have been derived from the behavior of biological or physical systems in nature. In this paper,...
详细信息
ISBN:
(纸本)9781479963874
In the recent years, many heuristic optimization algorithms have been developed. A majority of these heuristic algorithms have been derived from the behavior of biological or physical systems in nature. In this paper, we propose a new optimization algorithm based on competitive behavior of animal groups. In the proposed algorithm, the whole population is divided into a number of groups. In each group, the best searching agent spreads its children in its owned territory. Any group which is not able to find rich resources will be eliminated form competition. The competition gradually results in an increase in population of wealthy group which gives a fast convergence to proposed optimization algorithm. In the following, after a detailed explanation of the algorithm and pseudo code, we compare it to other existing algorithms, including genetics and particle swarm optimizations. Applying the proposed algorithm on various benchmark cost functions, shows faster and superior results compared to other optimization algorithms.
In this paper, an artificial glowworm swarm optimization algorithm for solving 0-1 knapsack problem is proposed, and the detailed realization of the algorithm is illustrated. According to intelligent algorithm for kna...
详细信息
ISBN:
(纸本)9780878492237
In this paper, an artificial glowworm swarm optimization algorithm for solving 0-1 knapsack problem is proposed, and the detailed realization of the algorithm is illustrated. According to intelligent algorithm for knapsack problem, the question of sensitive parameter's choice is avoided under the greed idea. Simulation results show that the artificial glowworm swarm optimization algorithm for solving 0-1 knapsack problems is feasible and effective.
暂无评论