Estimation and determination of shortest path length in a road network with obstacles

1995 ◽  
Vol 83 (1) ◽  
pp. 105-116 ◽  
Author(s):  
Nicolas Dubois ◽  
Frédéric Semet
2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Douglas Guilbeault ◽  
Damon Centola

AbstractThe standard measure of distance in social networks – average shortest path length – assumes a model of “simple” contagion, in which people only need exposure to influence from one peer to adopt the contagion. However, many social phenomena are “complex” contagions, for which people need exposure to multiple peers before they adopt. Here, we show that the classical measure of path length fails to define network connectedness and node centrality for complex contagions. Centrality measures and seeding strategies based on the classical definition of path length frequently misidentify the network features that are most effective for spreading complex contagions. To address these issues, we derive measures of complex path length and complex centrality, which significantly improve the capacity to identify the network structures and central individuals best suited for spreading complex contagions. We validate our theory using empirical data on the spread of a microfinance program in 43 rural Indian villages.


2011 ◽  
Vol 2011 ◽  
pp. 1-8 ◽  
Author(s):  
M. Marchetti ◽  
M. Moutton ◽  
S. Ludwig ◽  
L. Ibos ◽  
V. Feuillet ◽  
...  

Thermal mapping has been implemented since the late eighties to establish the susceptibility of road networks to ice occurrence with measurements from a radiometer and some atmospheric parameters. They are usually done before dawn during wintertime when the road energy is dissipated. The objective of this study was to establish if an infrared camera could improve the determination of ice road susceptibility, to build a new winter risk index, to improve the measurements rate, and to analyze its consistency with seasons and infrastructures environment. Data analysis obtained from the conventional approved radiometer sensing technique and the infrared camera has shown great similarities. A comparison was made with promising perspectives. The measurement rate to analyse a given road network could be increased by a factor two.


2020 ◽  
Vol 9 (2) ◽  
pp. 132-161 ◽  
Author(s):  
Ranjan Kumar ◽  
Sripati Jha ◽  
Ramayan Singh

The authors present a new algorithm for solving the shortest path problem (SPP) in a mixed fuzzy environment. With this algorithm, the authors can solve the problems with different sets of fuzzy numbers e.g., normal, trapezoidal, triangular, and LR-flat fuzzy membership functions. Moreover, the authors can solve the fuzzy shortest path problem (FSPP) with two different membership functions such as normal and a fuzzy membership function under real-life situations. The transformation of the fuzzy linear programming (FLP) model into a crisp linear programming model by using a score function is also investigated. Furthermore, the shortcomings of some existing methods are discussed and compared with the algorithm. The objective of the proposed method is to find the fuzzy shortest path (FSP) for the given network; however, this is also capable of predicting the fuzzy shortest path length (FSPL) and crisp shortest path length (CSPL). Finally, some numerical experiments are given to show the effectiveness and robustness of the new model. Numerical results show that this method is superior to the existing methods.


2014 ◽  
Vol 4 (4) ◽  
pp. 36-54 ◽  
Author(s):  
António Leitão ◽  
Adriano Vinhas ◽  
Penousal Machado ◽  
Francisco Câmara Pereira

Inverse Combinatorial Optimization has become a relevant research subject over the past decades. In graph theory, the Inverse Shortest Path Length problem becomes relevant when people don't have access to the real cost of the arcs and want to infer their value so that the system has a specific outcome, such as one or more shortest paths between nodes. Several approaches have been proposed to tackle this problem, relying on different methods, and several applications have been suggested. This study explores an innovative evolutionary approach relying on a genetic algorithm. Two scenarios and corresponding representations are presented and experiments are conducted to test how they react to different graph characteristics and parameters. Their behaviour and differences are thoroughly discussed. The outcome supports that evolutionary algorithms may be a viable venue to tackle Inverse Shortest Path problems.


Sign in / Sign up

Export Citation Format

Share Document