Shortest route algorithm with movement prohibitions

Said M. Easa

Transportation Research Part B: Methodological, 1985, vol. 19, issue 3, 197-208

Abstract: This paper presents an algorithm with movement prohibitions which eliminates some problems encountered in network representation used for traffic assignment models, and further allows the representation of the network to be simplified. The paper first presents an appraisal of some proposed methods and reviews the basic concept of existing shortest-route algorithms. The problem of obtaining shortest routes in networks with movement prohibitions is formulated and an algorithm presented. The computational procedure is illustrated by means of a numerical example. The computational efficiency of the algorithm is tested and the test results show that the algorithm is very efficient.

Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(85)90003-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:19:y:1985:i:3:p:197-208

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().