this study is devoted to the formulation of the network design problem of one-way streets and the application of simulated annealing (sa) algorithm to solve this problem for a large real network. it discusses some points of views on one-way street networks, the objective function used for design, the way in which design constraints may be considered, and the traffic problems concerning one-way ...

background to get more precise responses when gathering information about sensitive topics such as drug use, it is important to use the most optimal method. objectives this study was carried out to address the impact of three interview methods (street-based, household, and telephone interviews) on response pattern to sensitive and non-sensitive questions in terms of participation, disclosure an...

This study is devoted to the formulation of the network design problem of one-way streets and the application of simulated annealing (SA) algorithm to solve this problem for a large real network. It discusses some points of views on one-way street networks, the objective function used for design, the way in which design constraints may be considered, and the traffic problems concerning one-way ...

We consider the problem of walking a robot in an unknown polygon called “street”, starting from a point s to reach a target t . The robot is assumed to have minimal sensing capability in a way that cannot infer any geometric properties of the environment, such as its coordinates, angles or distances; but it is equipped with a sensor that can only detect the discontinuities in the depth informat...

This paper proposes a comparison between rectilinear and radio-concentric networks. Indeed, those networks are often observed in urban areas, in several cities all over the world. One of the interesting properties of such networks is described by the straightness measure from graph theory, which assesses how much moving from one node to another along the network links departs from the network-i...

Given a signal net N = s; 1; ;n to be the set of nodes, with s the source and the remaining nodes sinks, an MRDPT (minimum-cost rectilinear Steiner distance-preserving tree) has the property that the length of every source to sink path is equal to the rectilinear distance between the source and sink. The minimum-cost rectilinear Steiner distance-preserving tree minimizes the total wire length w...

Negative binomial regression models were used to assess the effect of street and street network characteristics on total crashes, severe injury crashes, and fatal crashes. Data from over 230,000 crashes taking place over 11 years in 24 California cities was analyzed at the U.S. Census Block Group level of geography. In our analysis we controlled for variables such as vehicle volumes, income lev...

This paper proposes a novel generalisation model for selecting characteristic streets in an urban street network. This model retains the central structure of a street network. It relies on a structural representation of a street network using graph principles where vertices represent named streets and links represent street intersections. Based on this representation, so-called connectivity gra...