Shortest Path Computation: A Comparative Analysis

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.

GISRUK 2002

This is co-authored paper presented at GISRUK 2002, University of Sheffield, Sheffield, UK, 3-5 April 2002

Read online

Read online scribd



Reference

Sherlock, R., Moone, P.,  and Winstanley, A. (2002) Shortest Path Computation: A Comparative Analysis. Paper presented at GISRUK 2002, University of Sheffield, Sheffield, UK, 3-5 April 2002

Posted in my PUBLIC PRESENCE
Tags: , , , , , , , ,

ARTICLES and PAPERS
Graph Theory to the rescue
Graph Theory. In Supply Chain Management? It's probably 10 years ago since last time I looked at Gra[...]
Committed Americans and Trusting Germans
Obviously, selecting the right third-party logistics provider (3PL) for your supply chain is an impo[...]
BOOKS and BOOK CHAPTERS
Book Review: Creative Destruction
Like with so many of my other recent book reviews I came across Nolan and Croson's book, Creative De[...]
Book review: Networks and Algorithms
If you are into network analysis of any kind, this book teaches you the basics. As the name implies,[...]
REPORTS and WHITEPAPERS
Risky cities - want to work there?
If you are doing global business, do you know where you are at risk and what risk that is most perti[...]
Managing supply chain risk
In September and October 2009 the Economist Intelligence Unit surveyed 500 company executives with r[...]