scholarly journals REVIEW ON SHORTEST ROUTE PROBLEM IN URBAN NETWORK SYSTEM

Author(s):  
K. M. Roopa ◽  
Vishwanath M. C. ◽  
Srinivasu V. K. ◽  
V. G. Umesh
1960 ◽  
Vol 8 (2) ◽  
pp. 224-230 ◽  
Author(s):  
Maurice Pollack ◽  
Walter Wiebenson
Keyword(s):  

Author(s):  
Getachew K. Befekadu

In this chapter, we present a mathematical framework that provides a new insight for understanding the spread of traffic congestions in an urban network system. In particular, we consider a dynamical model, based on the well-known susceptible-infected-recovered (SIR) model from mathematical epidemiology, with small random perturbations, that describes the process of traffic congestion propagation and dissipation in an urban network system. Here, we provide the asymptotic probability estimate based on the Freidlin-Wentzell theory of large deviations for certain rare events that are difficult to observe in the simulation of urban traffic network dynamics. Moreover, the framework provides a computational algorithm for constructing efficient importance sampling estimators for rare event simulations of certain events associated with the spread of traffic congestions in the dynamics of the traffic network.


2011 ◽  
Vol 2 (3) ◽  
pp. 1-15 ◽  
Author(s):  
Pawel Paduch ◽  
Krzysztof Sapiecha

This paper presents a new algorithm for solving the generalized watchman problem. It is the problem of mobile robot operators that must find the shortest route for the robot to see the whole area with many obstructions. The algorithm adapts the well-known ant algorithm to the new problem. An experiment where the algorithm is applied to an area containing more than 10 obstructions is described. It proves that efficiency and accuracy of the algorithm are high.


Author(s):  
Pawel Paduch ◽  
Krzysztof Sapiecha

This paper presents a new algorithm for solving the generalized watchman problem. It is the problem of mobile robot operators that must find the shortest route for the robot to see the whole area with many obstructions. The algorithm adapts the well-known ant algorithm to the new problem. An experiment where the algorithm is applied to an area containing more than 10 obstructions is described. It proves that efficiency and accuracy of the algorithm are high.


Sign in / Sign up

Export Citation Format

Share Document