A Computational Study Of Routing Algorithms For Realistic Transportation Networks


Download A Computational Study Of Routing Algorithms For Realistic Transportation Networks PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get A Computational Study Of Routing Algorithms For Realistic Transportation Networks book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.

Download

A Computational Study of Routing Algorithms for Realistic Transportation Networks


A Computational Study of Routing Algorithms for Realistic Transportation Networks

Author:

language: en

Publisher:

Release Date: 1998


DOWNLOAD





The authors carry out an experimental analysis of a number of shortest path (routing) algorithms investigated in the context of the TRANSIMS (Transportation Analysis and Simulation System) project. The main focus of the paper is to study how various heuristic and exact solutions, associated data structures affected the computational performance of the software developed especially for realistic transportation networks. For this purpose the authors have used Dallas Fort-Worth road network with very high degree of resolution. The following general results are obtained: (1) they discuss and experimentally analyze various one-one shortest path algorithms, which include classical exact algorithms studied in the literature as well as heuristic solutions that are designed to take into account the geometric structure of the input instances; (2) they describe a number of extensions to the basic shortest path algorithm. These extensions were primarily motivated by practical problems arising in TRANSIMS and ITS (Intelligent Transportation Systems) related technologies. Extensions discussed include--(i) time dependent networks, (ii) multi-modal networks, (iii) networks with public transportation and associated schedules. Computational results are provided to empirically compare the efficiency of various algorithms. The studies indicate that a modified Dijkstra's algorithm is computationally fast and an excellent candidate for use in various transportation planning applications as well as ITS related technologies.

Computational Science - ICCS 2002


Computational Science - ICCS 2002

Author: Peter M.A. Sloot

language: en

Publisher: Springer

Release Date: 2003-08-01


DOWNLOAD





Computational Science is the scienti?c discipline that aims at the development and understanding of new computational methods and techniques to model and simulate complex systems. The area of application includes natural systems – such as biology, envir- mental and geo-sciences, physics, and chemistry – and synthetic systems such as electronics and ?nancial and economic systems. The discipline is a bridge b- ween ‘classical’ computer science – logic, complexity, architecture, algorithms – mathematics, and the use of computers in the aforementioned areas. The relevance for society stems from the numerous challenges that exist in the various science and engineering disciplines, which can be tackled by advances made in this ?eld. For instance new models and methods to study environmental issues like the quality of air, water, and soil, and weather and climate predictions through simulations, as well as the simulation-supported development of cars, airplanes, and medical and transport systems etc. Paraphrasing R. Kenway (R.D. Kenway, Contemporary Physics. 1994): ‘There is an important message to scientists, politicians, and industrialists: in the future science, the best industrial design and manufacture, the greatest medical progress, and the most accurate environmental monitoring and forecasting will be done by countries that most rapidly exploit the full potential ofcomputational science’. Nowadays we have access to high-end computer architectures and a large range of computing environments, mainly as a consequence of the enormous s- mulus from the various international programs on advanced computing, e.g.

SOFSEM 2007: Theory and Practice of Computer Science


SOFSEM 2007: Theory and Practice of Computer Science

Author: Jan van Leeuwen

language: en

Publisher: Springer

Release Date: 2007-07-13


DOWNLOAD





This book constitutes the refereed proceedings of the 33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007, held in Harrachov, Czech Republic in January 2007. The 69 revised full papers, presented together with 11 invited contributions were carefully reviewed and selected from 283 submissions. The papers were organized in four topical tracks.