dc.creator | Ziliaskopoulos, A. K. | en |
dc.creator | Mandanas, F. D. | en |
dc.creator | Mahmassani, H. S. | en |
dc.date.accessioned | 2015-11-23T10:55:04Z | |
dc.date.available | 2015-11-23T10:55:04Z | |
dc.date.issued | 2009 | |
dc.identifier | 10.1016/j.ejor.2008.08.018 | |
dc.identifier.issn | 0377-2217 | |
dc.identifier.uri | http://hdl.handle.net/11615/34915 | |
dc.description.abstract | Label setting techniques are all based on Dijkstra's condition of always scanning the node with the minimum label, which guarantees that each node will be scanned exactly once; while this condition is sufficient it is not necessary. In this paper, we discuss less restrictive conditions that allow the scanning of a node that does not have the minimum label, yet still maintaining sufficiency in scanning each node exactly once; various potential shortest path schemes are discussed, based on these conditions. Two approaches, a label setting and a flexible hybrid one are designed and implemented. The performance of the algorithms is assessed both theoretically and computationally. For comparative analysis purposes, three additional shortest path algorithms - the commonly cited in the literature - are coded and tested. The results indicate that the approaches that rely on the less restrictive optimality conditions perform substantially better for a wide range of network topologies. (C) 2008 Elsevier B.V. All rights reserved. | en |
dc.source | European Journal of Operational Research | en |
dc.source.uri | <Go to ISI>://WOS:000265341200008 | |
dc.subject | Routing | en |
dc.subject | Transportation | en |
dc.subject | Shortest path | en |
dc.subject | ALGORITHMS | en |
dc.subject | Management | en |
dc.subject | Operations Research & Management Science | en |
dc.title | An extension of labeling techniques for finding shortest path trees | en |
dc.type | journalArticle | en |