A Random Traffic Assignment Model for Networks Based on Discrete Dynamic Bayesian Algorithms

In this paper, a stochastic traffic assignment model for networks is proposed for the study of discrete dynamic Bayesian algorithms. In this paper, we study a feasible method and theoretical system for implementing traffic engineering in networks based on Bayesian algorithm theory. We study the implementation of traffic assignment engineering in conjunction with the network stochastic model: first, we study the Bayesian algorithm theoretical model of control layer stripping in the network based on the discrete dynamic Bayesian algorithm theory and analyze the resource-sharing mechanism in different queuing rules; second, we study the extraction and evaluation theory of traffic assignment for the global view obtained by the control layer of the network and establish the Bayesian algorithm analysis model based on the traffic assignment; subsequently, the routing of bandwidth guarantee and delay guarantee in the network is studied based on Bayesian algorithm model and Bayesian algorithm network random traffic allocation theory. In this paper, a Bayesian algorithm estimation model based on Bayesian algorithm theory is constructed based on network random observed traffic assignment as input data. The model assumes that the roadway traffic distribution follows the network random principle, and based on this assumption, the likelihood function of the roadway online traffic under the network random condition is derived; the prior distribution of the roadway traffic is derived based on the maximum entropy principle; the posterior distribution of the roadway traffic is solved by combining the likelihood function and the prior distribution. The corresponding algorithm is designed for the model with roadway traffic as input, and the reliability of the algorithm is verified in the arithmetic example.

A Systematic Review on Harmony Search Algorithm: Theory, Literature, and Applications

Harmony search algorithm is the recently developed metaheuristic in the last decade. It mimics the behavior of a musician producing a perfect harmony. It has been used to solve the wide variety of real-life optimization problems due to its easy implementation over other metaheuristics. It has an ability to provide the balance between exploration and exploitation during search. In this paper, a systematic review on harmony search algorithm (HSA) is presented. The natural inspiration and conceptual framework of HSA are discussed. The control parameters of HSA are described with their mathematical foundation. The improvement and hybridization in HSA with other metaheuristics are discussed in detail. The applicability of HSA in different problem domains is studied. The future research directions of HSA are also investigated.

Mathematics of the future

Mathematics has entered a crisis of complexity. The main reason is the use of immutable concepts according to the law of identity of Aristotle's logic. The evidence has become super-long, unverifiable. Overcoming the crisis is possible in the transition from immutable concepts to "mobile" ones, in the generalization of the law of identity. In modern mathematics, there are prerequisites for such a transition – in qualitative theory, probability theory, algorithm theory, and foundations. The future of mathematics lies in the development of categories as transformative concepts.