Yearly Archives: 2002

ArcView Network Analyst Tutorial

4 Replies
Revised on: 2011-03-11

The ArcView Network Analyst (AVNA is extension module for ArcView GIS. This tutorial was developed by Jan Husdal at the University of Utah, Salt Lake City, 2000-2002. It shows how to solve 3 categories of network analysis problems; Find Best Route, Find Closest Facility and Find Service Area, and it comes complete with exercise data for download and a solution. Mind you, this is a tutorial for ArcView, not for ArcGIS.
Continue reading →

Pålitelighet og sårbarhet av transportsystemer

Leave a reply
Revised on: 2011-05-18

Transportsystemer som veg og jernbane danner ryggraden i et moderne samfunn. Påliteligheten og sårbarheten i et transportsystem blir dermed avgjørende faktorer ikke bare i  konkurranse- og markedsøyemed, men også i beredskapssammenheng, for å kunne opprettholde normal samfunnsdrift. Dette er den norske oversettelsen/tilpasningen av The reliability and vulnerability of transportation lifelines, skrevet av Jan Husdal ved University of Utah, Salt Lake City, USA, i 2002. Videreutviklet i 2008: Er rassikring lønnsomt?

Continue reading →

The reliability and vulnerability of transportation lifelines

Leave a reply
Revised on: 2015-11-17

How can we assess how reliable or vulnerable the transportation is, and which parameters can we apply  in measuring reliability and vulnerability? Transportation networks like freeways and interstate highways are the main backbone of modern society. Consequently, the reliability or vulnerability of any transportation network is thus a decisive factor not only in terms of market outreach and competition, but also in terms of continuity, to ensure a 24/7 operation of the community we live in. This research essay takes a closer look at vulnerability and reliability issues in transportation networks.

Continue reading →

JavalancheTM – analyzing hazards to roads

Leave a reply
Revised on: 2011-03-10

Traditionally, in studying the effect of hazards on roads, a hazard map is prepared based on the hazard in question, the contributing factors and then overlaid with a road map. If the road or a buffer around its vicinity intersects hazard areas, these areas constitute a potential threat. In the approach used in this procedure, imagine traveling along the road and looking to either side for hazards. The neighborhood that needs to be examined is dependent on the hazard and its contributing factors. This neighborhood search then produces a hazard map that is directly related to the road.

Continue reading →

Shortest Path Computation: A Comparative Analysis

Leave a reply
Revised on: 2011-07-22

Current research work into establishing a performance efficiency hierarchy between Java, C++ and ArcView is described and experimentation is performed in order to statistically compare shortest path query execution time, response time and implementation issues.

Continue reading →

A spatial framework for modeling hazards to transportation lifelines

Leave a reply
Revised on: 2011-07-22

Transportation networks are exposed to a wide range of  natural hazards and this study has developed a GIS tool for analyzing these hazards. The primary hazards included in this study are avalanches, landslides, flooding, earthquakes, wildfires, and rockfall. Although the primary focus of this research is roads, it is equally applicable to other transportation lifelines, such as railways, canals/waterways, or transmission lines for power, gas or oil. This presentation provides an overview of the spatial framework, current results and limitations, and directions for further research. MFworks was used as a GIS tool, along with a self-developed Java application.

Continue reading →

Book review: Networks and Algorithms

Leave a reply
Revised on: 2015-10-01

If you are into network analysis of any kind, this book teaches you the basics. As the name implies, Networks and Algorithms by Alan Dolan is an introductory book. It tells you the difference between the various forms and types of graphs, trees and networks and shows you step by step calculations on how to solve them by hand (they didn’t have that many computers in 1993). It doesn’t get any better than that, if you want to learn the core science of algorithms.

Continue reading →