MATRIX METHOD FOR DETERMINING THE ACCESSIBILITY OF THE NODES OF A TRANSPORT NETWORK

MATRIZIENTHEORETISCHE VERFAHREN ZUR BESTIMMUNG DER ZUGGAENGKUCGJEU ZUGGAENGLICHKEIT VON KNOTENPUNKTEN EINES VERKEHRSNETZES

Any transportation network may be represented by a graph consisting of nodes (vertices) and links (edges) between adjacent nodes. Several matrices are introduced for describing such a graph and by that the corresponding transportation network. In particular they provide a means of measuring the accessibility of the nodes. The paper discusses the different matrices applied to transportation systems and argues in favor of the so called valued shortest path-matrix which results from raising the valued distance-matrix to a certain power. Finally, this matrix method is applied to the railroad network of the Netherlands and leads to a most accessible node representing an optimal location for the Netherlands Railway's lines.

• Corporate Authors:

  Royal Dutch Geographical Society

  63 Mauritskade
  Amsterdam,   Netherlands 
• Authors:
  • Schickhoff, I
• Publication Date: 1977

Language

• German

Media Info

• Pagination: p. 152-167
• Serial:
  • TIJDSCHRIFT VOOR ECONOMISCHE EN SOCIALE GEOGRAFIE
  • Volume: 68
  • Issue Number: 3
  • Publisher: OFFICE NATIONAL DES CHEMINS DE FER DU MAROC.

Subject/Index Terms

• TRT Terms: Computer graphics; Network analysis (Planning)
• Identifier Terms: Nederlandse Spoorwegen
• Uncontrolled Terms: Interactive graphics
• Subject Areas: Data and Information Technology; Railroads;

Filing Info

• Accession Number: 00163740
• Record Type: Publication
• Source Agency: International Union of Railways
• Files: TRIS
• Created Date: Oct 29 1977 12:00AM