Andere Kunden interessierten sich auch für
![The Shortest-Path Problem]( "The Shortest-Path Problem")
The Shortest-Path Problem48,14 €![Some new theorems of Markov Models from the originating Chain measure]( "Some new theorems of Markov Models from the originating Chain measure")
Some new theorems of Markov Models from the originating Chain measure39,99 €![Mathematical Models and Metaheuristics for the Flow Shop Scheduling]( "Mathematical Models and Metaheuristics for the Flow Shop Scheduling")
Mathematical Models and Metaheuristics for the Flow Shop Scheduling26,99 €![Markov Chain Based Algorithms for the Hamiltonian Cycle Problem]( "Markov Chain Based Algorithms for the Hamiltonian Cycle Problem")
Markov Chain Based Algorithms for the Hamiltonian Cycle Problem70,99 €![Supply chain inventory modelling for different payment options]( "Supply chain inventory modelling for different payment options")
Supply chain inventory modelling for different payment options58,99 €![An Introduction to Cyclic Path Covers in Graphs]( "An Introduction to Cyclic Path Covers in Graphs")
An Introduction to Cyclic Path Covers in Graphs51,99 €![NEW AUM BLOCK COLORING TECHNIQUE FOR CORONA PRODUCT OF GRAPHS Vol.I]( "NEW AUM BLOCK COLORING TECHNIQUE FOR CORONA PRODUCT OF GRAPHS Vol.I")
NEW AUM BLOCK COLORING TECHNIQUE FOR CORONA PRODUCT OF GRAPHS Vol.I24,99 €
The Markov stochastic process is used to model lots of optimization problems, especially in the network optimization problems. In the routing optimization problems there could be either continuous or discrete parameters in the networks. Suppose the length of an arc is defined as the time that takes to transmit flow between the pair linked nodes of the arc; then, in this situation the cost parameters of the network are continuous variables and it may be modeled by a continuous time Markov chain (CTMC) stochastic process. In other situation consider the topology of the network that shows the location of the nodes and their related linked arcs; so, a connecting path from a given source node to a given destination node may be modeled by a discrete time Markov chain (DTMC) stochastic process. Then, some stochastic routing models in the networks with an established Markov stochastic process are discussed. So, a new criterion will be presented for the probabilistic evaluation of the message transmission between two given nodes by time T, which is applicable for large size networks. Then, a genetic algorithm is performed to find the best established connection.