AUTOMATIC ROUTE FINDER FOR NEW VISITORS

Shortest path finding algorithms are necessary in road network of a city or country for tourists and visitors. Automatic Route Finder tool for New Visitors is developed to help them to find or plan the shortest and effective way in order to reach their destination without loss of time. This project proposes a new visitor route model that is based on shortest path algorithms for road networks. Shortest path problems are among the best studied network flow optimization problems, with interesting applications in a range of fields. This study is based on Dijkstra's algorithm as the algorithm finds the most effective way to traverse an entire graph. The user is first need to select the starting location and the ending destination then the shortest path will be highlighted with the total distance between the two locations. If one of the roads in the first shortest path had problems, then the Automatic Route Finder will highlight the new shortest path from the two locations

AUTOMATIC ROUTE FINDER FOR NEW VISITORS

Shortest path finding algorithms are necessary in road network of a city or country for tourists and visitors. Automatic Route Finder tool for New Visitors is developed to help them to find or plan the shortest and effective way in order to reach their destination without loss of time. This project proposes a new visitor route model that is based on shortest path algorithms for road networks. Shortest path problems are among the best studied network flow optimization problems, with interesting applications in a range of fields. This study is based on Dijkstra's algorithm as the algorithm finds the most effective way to traverse an entire graph. The user is first need to select the starting location and the ending destination then the shortest path will be highlighted with the total distance between the two locations. If one of the roads in the first shortest path had problems, then the Automatic Route Finder will highlight the new shortest path from the two locations

Synchronizing vans and cargo bikes in a city distribution network

One of the significant side-effects of growing urbanization is the constantly increasing amount of freight transportation in cities. This is mainly performed by conventional vans and trucks and causes a variety of problems such as road congestion, noise nuisance and pollution. Yet delivering goods to residents is a necessity. Sustainable concepts of city distribution networks are one way of mitigating difficulties of freight services. In this paper we develop a two-echelon city distribution scheme with temporal and spatial synchronization between cargo bikes and vans. The resulting heuristic is based on a greedy randomized adaptive search procedure with path relinking. In our computational experiments we use artificial data as well as real-world data of the city of Vienna. Furthermore we compare three distribution policies. The results show the costs caused by temporal synchronization and can give companies decision-support in planning a sustainable city distribution concept

The development of a mathematical programming technique as a design tool for traffic management

In urban areas, competition for road space at junctions is one of the major causes of congestion and accidents. Routes chosen to avoid conflict at junctions have a mutually beneficial effect which should improve circulation and reduce accidents. A prototype design tool has been developed to provide for traffic management based on such routes. The mathematical model behind the design tool works with a given road network and a given O-D demand matrix to produce feasible routes for all drivers in such a way that the weighted sum of potential conflicts is minimised. The result is a route selection in which all journeys from origin i to destination j follow the same route. The method which works best splits the problem into single commodity problems and solves these repeatedly by the Out-of-Kilter algorithm. Good locally optimal solutions can be produced by this method, even though global optimality cannot be guaranteed. Software for a microcomputer presented here as part of the design tool is capable of solving problems on realistic networks in a reasonable time. This method is embedded in a suite of computer programs which makes the input and output straightforward. Used as a design tool in the early stages of network design it gives a network-wide view of the possibilities for reducing conflict and indicates a coherent set of traffic management measures. The ideal measure would be automatic route guidance, such as the pilot scheme currently being developed for London. Other measures include a set of one-way streets and banned turns. The resulting turning flows could be used as input to the signal optimiser TRANSYT to determine signal settings favouring the routeing pattern. The project was funded by the S. E. R. C. and carried out at Middlesex Polytechnic in collaboration with MVA Systematica

An Impact of Traffic Characteristics on Crash Frequency

With the development of roads, modes of transportation were also developed, and increasing numbers of those modes and routes were needed. This increase brought into focus many problems of the highway system. One of the most important concerns in the highway networks is road safety, which requires various studies to be carried out to reduce crash causalities. One of the factors that affect road safety is the traffic characteristics. This includes average daily traffic, operating speed, traffic density, and heavy vehicles percentage. This study focused on the effect of average daily traffic and heavy vehicles percentage on crash frequency. The old Baghdad – Baquba rural road, a two-lane, two-way road, was chosen for this study. This study used two sets of data (traffic characteristics and crash data). Generalized linear regression models were utilized to develop a model that reflects the effect of the average daily traffic and heavy vehicles percentage on crash frequency. The results showed a positive correlation between average daily traffic and crash frequency and between heavy vehicles percentage and crash frequency

Multi-Paradigm Reasoning for Access to Heterogeneous GIS

Accessing and querying geographical data in a uniform way has become easier in recent years. Emerging standards like WFS turn the web into a geospatial web services enabled place. Mediation architectures like VirGIS overcome syntactical and semantical heterogeneity between several distributed sources. On mobile devices, however, this kind of solution is not suitable, due to limitations, mostly regarding bandwidth, computation power, and available storage space. The aim of this paper is to present a solution for providing powerful reasoning mechanisms accessible from mobile applications and involving data from several heterogeneous sources. By adapting contents to time and location, mobile web information systems can not only increase the value and suitability of the service itself, but can substantially reduce the amount of data delivered to users. Because many problems pertain to infrastructures and transportation in general and to way finding in particular, one cornerstone of the architecture is higher level reasoning on graph networks with the Multi-Paradigm Location Language MPLL. A mediation architecture is used as a “graph provider” in order to transfer the load of computation to the best suited component – graph construction and transformation for example being heavy on resources. Reasoning in general can be conducted either near the “source” or near the end user, depending on the specific use case. The concepts underlying the proposal described in this paper are illustrated by a typical and concrete scenario for web applications