Evaluation of shortest path heuristics

dc.contributor.author	Botha, Rohann
dc.contributor.other	University of Pretoria. Faculty of Engineering, Built Environment and Information Technology. Dept. of Industrial and Systems Engineering
dc.date.accessioned	2009-07-20T11:40:49Z
dc.date.available	2009-07-20T11:40:49Z
dc.date.created	2008-11
dc.date.issued	2009-07-20T11:40:49Z
dc.description	Thesis (B Eng. (Industrial and Systems Engineering))--University of Pretoria, 2008.	en_US
dc.description.abstract	In a time where everything needs to move faster, safer and more frequently the need for a quick accurate shortest path algorithm increases. The purpose of this document is to do research on the shortest path algorithms, do software development on them, test them, comment on all of the algorithms and finally state and motivate which one of the algorithms is thought to be the best shortest path algorithm. This document will by and large be used by the operation research group of the University of Pretoria to determine which shortest path, if any, will be further developed by their programmers for the MATSim project.	en_US
dc.identifier.uri	http://hdl.handle.net/2263/10822
dc.language	en
dc.language.iso	en	en_US
dc.rights	Copyright: University of Pretoria	en_US
dc.subject	Path heuristics	en_US
dc.subject	Traffic network	en_US
dc.subject	MATSim	en_US
dc.subject.lcsh	Algorithms	en
dc.subject.lcsh	Operations research	en
dc.subject.lcsh	Path analysis (Statistics)	en
dc.subject.lcsh	Heuristic programming	en
dc.title	Evaluation of shortest path heuristics
dc.type	Text	en_US