Content deleted Content added
→Analysis Methods: several citations |
History Tag: citing a blog or free web host |
||
Line 3:
A '''transport network''', or '''transportation network''' is a [[spatial network | network or graph]] in geographic space, describing an infrastructure that permits and constrains movement or flow.<ref name="Bart">{{Cite journal|arxiv=1010.0302|last1=Barthelemy|first1=Marc|title=Spatial Networks|journal=Physics Reports|volume=499|issue=1–3|pages=1–101|year=2010|doi=10.1016/j.physrep.2010.11.002|bibcode=2011PhR...499....1B|s2cid=4627021}}</ref>
Examples include but are not limited to [[road network]]s, [[railways]], [[Airway (aviation)|air routes]], [[Pipeline transport|pipelines]], [[Navigable aqueduct|aqueducts]], and [[power lines]]. The digital representation of these networks, and the methods for their analysis, is a core part of [[spatial analysis]], [[geographic information system]]s, [[Public utility|public utilities]], and [[transport engineering]]. Network analysis is an application of the theories and algorithms of [[Graph theory]] and is a form of [[proximity analysis]].
==History==
The applicability of [[graph theory]] to geographic phenomena was recognized as an early date. In fact, many of the early problems and theories undertaken by graph theorists were inspired by geographic situations, such as the [[Seven Bridges of Königsberg]] problem, which was one of the original foundations of graph theory when it was solved by [[Leonhard Euler]] in 1736.<ref>Euler, Leonhard (1736). "Solutio problematis ad geometriam situs pertinentis". ''Comment. Acad. Sci. U. Petrop'' 8, 128–40.</ref>
In the 1970s, the connection was reestablished by the early developers of [[geographic information system]]s, who employed it in the topological data structures of polygons (which is not of relevance here), and the analysis of transport networks. Early works, such as Tinkler (1977), focused mainly on simple schematic networks, likely due to the lack of significant volumes of linear data and the computational complexity of many of the algorithms.<ref>{{cite journal |last1=Tinkler |first1=K.J. |title=An Introduction to Graph Theoretical Methods in Geography |journal=CATMOG |date=1977 |issue=14 |url=https://alexsingleton.files.wordpress.com/2014/09/14-graph-theoretical-methods-in-geography.pdf}}</ref> The full implementation of network analysis algorithms in GIS software did not appear until the 1990s,<ref>Ahuja R K, Magnanti T L, Orlin J B (1993) ''Network flows: Theory, algorithms and applications''. Prentice Hall, Englewood Cliffs, NJ, USA</ref><ref>Daskin M S (1995) ''Network and discrete ___location — models, algorithms and applications''. Wiley, NJ, USA</ref> but rather advanced tools are generally available today.
==Network Data==
| |||