Copyright © 1998-2007, Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including.

Slides:



Advertisements
Similar presentations
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Advertisements

Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.
Chapter 11 To accompany Quantitative Analysis for Management, Eleventh Edition, Global Edition by Render, Stair, and Hanna Power Point slides created by.
6-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Transportation, Transshipment, and Assignment Problems Chapter 6.
GEOG 80 Transport Geography Professor: Dr. Jean-Paul Rodrigue Hofstra University, Department of Global Studies & Geography Topic 1 – Transportation and.
Vehicle Routing & Scheduling Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
CONNECTIVITY “The connectivity of a network may be defined as the degree of completeness of the links between nodes” (Robinson and Bamford, 1978).
Freight Transportation Economic Regulation Transportation Logistics Spring 2009.
1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.
Chapter 9 – Transport Planning and Policies
THE GEOGRAPHY OF TRANSPORT SYSTEMS THIRD EDITION Copyright © , Jean-Paul Rodrigue, Dept. of Global Studies & Geography, Hofstra University, Hempstead,
Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Topic 2 – Spatial Representation
Modes and Networks Transportation Logistics Spring 2008.
GEOG 60 – Introduction to Geographic Information Systems Professor: Dr. Jean-Paul Rodrigue Topic 3 – Geographical Data Structures A – Geographic Data Models.
Chapter 9 Graph algorithms Lec 21 Dec 1, Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Lec 28: Ch3.(T&LD): Traffic Analysis – Traffic assignment Learn how to assign generated and distributed trips to the street system approaching the site.
Freight Transportation Regulation
Map Analysis with Networks Francisco Olivera, Ph.D., P.E. Department of Civil Engineering Texas A&M University Some of the figures included in this presentation.
Network Flow Models Chapter 7.
Chapter 9: Graphs Basic Concepts
Network and Dynamic Segmentation Chapter 16. Introduction A network consists of connected linear features. Dynamic segmentation is a data model that is.
Delivery, Forwarding and
THE GEOGRAPHY OF TRANSPORT SYSTEMS THIRD EDITION Copyright © , Jean-Paul Rodrigue, Dept. of Global Studies & Geography, Hofstra University, Hempstead,
Regional Economics George Horváth Department of Environmental Economics
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
7-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
Shortest Route, Minimal Spanning Tree and Maximal Flow Models
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Chapter 9 – Graphs A graph G=(V,E) – vertices and edges
How to Build Network? ISAT 625 Network Problems Build highways to connect cities Build highways to connect cities Build network to connect computers.
CSC 336 Data Communications and Networking Lecture 7d: Interconnecting LAN Dr. Cheer-Sun Yang Spring 2001.
Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including.
Graph Theory Topics to be covered:
Introduction In ArcGIS, there are three basic data structures:
Networks.
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
Spring 2007Graphs1 ORD DFW SFO LAX
Fundamental Data Structures and Algorithms (Spring ’05) Recitation Notes: Graphs Slides prepared by Uri Dekel, Based on recitation.
Data Structures & Algorithms Graphs
University of Wisconsin-Milwaukee Geographic Information Science Geography 625 Intermediate Geographic Information Science Instructor: Changshan Wu Department.
Discrete Mathematical Structures: Theory and Applications
Vector Data Model Chapter 3.
Lecture 16: Graph Theory III Discrete Mathematical Structures: Theory and Applications.
System Control and Regulation CEE 587 Prof. Anne Goodchild May 18, 2011.
Copyright © Curt Hill Graphs Definitions and Implementations.
Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.
The Geography of Transport Systems Chapter 1 – Transportation and Geography Photos Copyright © , Jean-Paul Rodrigue, Dept. of Economics & Geography,
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
Graph Revisited Fei Chen CSCI2100B Data Structures Tutorial 12 1.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
GIS Project1 Physical Structure of GDB Geodatabase Feature datasets Object classes, subtypes Features classes, subtypes Relationship classes Geometric.
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
Exercises in Transport Geography
Basic Concepts Graphs For more notes and topics visit:
Alameda Corridor CEE 587 March 30, 2011
Physical Structure of GDB
Chapter 9 – Transport Planning and Policies
Routing and Logistics with TransCAD
Network Theory.
Methods in Transport Geography
Graphs All tree structures are hierarchical. This means that each node can only have one parent node. Trees can be used to store data which has a definite.
Introduction to Transportation Engineering
Chapter 9: Graphs Basic Concepts
Network Models 7-1.
Copyright ©2012 by Pearson Education, Inc. All rights reserved
Chapter 9: Graphs Basic Concepts
Chapter 9 Graph algorithms
GRAPHS.
Presentation transcript:

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. THE GEOGRAPHY OF TRANSPORT SYSTEMS Chapter 2 – Transportation Systems and Networks METHODS Copyright © , Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University, Hempstead, NY, USA. You may use the figures within for educational purposes only. No modification or redistribution permitted. For more information:

THE GEOGRAPHY OF TRANSPORT SYSTEMS Method 1 Graph Theory: Definition and Properties

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Graph Representation of a Real Network Real Network Graph Representation

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Basic Graph Representation of a Transport Network Vertex (Node) Edge (Link) Buckle

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Planar and Non-Planar Graphs PlanarNon-Planar AB

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Connections and Paths Link Connection 123 B 123 C Path (1 to 3) A

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Length of a Link, Connection or Path km 5 km 6 km 7 km 4 km 2 km 3 km

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Cycles and Circuits Circuit Cycle

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Connectivity in a Graph A B

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Complementary Graph GXY

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Root Node Root

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Tree Graph Root

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Articulation Node A B (Connected) C (Unconnected) Removed

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Isthmus Connection Isthmus

THE GEOGRAPHY OF TRANSPORT SYSTEMS Method 2 Graph Theory: Indexes and Measures

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Diameter of a Graph Shimbel Distance v Diameter = 4

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Diameter of a Graph A d = 2 B d = 3 C d = 4 D d = 3

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Number of Cycles evpu A 3520 B 5511 C 5412 D 6712 AB C D

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Order of a Node Order (o) A B C D Perfect hub Perfect spoke

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Pi Index and the Shape of Transportation Networks d Highly developed (High Pi) Least developed (Low Pi)

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Eta Index L(G)eEta A 80 km516.0 B 80 km711.4 A B

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Theta Index Q(G)vTheta A 3,500 t B 3,500 t A B

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Iota Index A L(G)W(G)Iota A B B Order (o)

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Beta Index AB C D evBeta A B C D

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Alpha Index A B C D u ( e-v+p ) 2v-5 Alpha A B C D 331.0

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Gamma Index AB CD e3(v-2) Gamma A B C D 991.0

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Under construction

THE GEOGRAPHY OF TRANSPORT SYSTEMS Method 3 Network Data Models

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. The ArcView Shapefile Model a b c d Main file (*.shp) Index file (*.shx) dBase table (*.dbf) a b c d id geomshp_len type Predefined fields surface asphalt concrete asphalt gravel asphalt... width lanes name I95 Route 4 Pinewood Ridge Main... custom fields

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Topology of a Network Data Model Topology Node Bi-directional Link Directional Link

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Cartography of a Network Data Model Cartography 74 Maple Blvd. East Ave. Oakway West Ave. Highway Main Street Street Central Park City Hall Campus One-way Traffic light

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Geocoding in a Network Data Model Geocoding Address East Ave. 188 East Ave Matching link and address range 191

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Routing in a Network Data Model Routing Warehouse Pickup Delivery Route segment Turn penalty Start End

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Relational Database Representation of a Simple Network A B C D E Nodes IDLatLong A B C D E Links IDFromToOne_Way 1ACYes 2BA 3DB 4DCNo 5DE 6CE

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Creation of a Connectivity Matrix with a Link Table Links IDFromToOne_Way 1CAYes 2BA 3DB 4DCNo 5DE 6CE Connectivity Matrix (C) ABCDE A00000 B10000 C10011 D01101 E00110

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Turn Penalties at an Intersection Turn Penalty Table – Node A FromToPenalty A

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Object-Oriented Network Model Transport Network LinkNode ID Length Capacity … ID Capacity Impedance … Inheritance Connection Class Properties A B a

THE GEOGRAPHY OF TRANSPORT SYSTEMS Method 4 Traffic Assignment

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Traffic Assignment Origin Destination Generation Attraction Which path? Cost Time Number of connections

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use i jk i j k Origin / Destination Traffic in a Network Spatial Interactions and Traffic

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Demand Travel time 1 Assignment Transport costs 2 Two Perspectives for Considering Traffic

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. a c b d e f Possible paths between a and f a-b-d-f, a-b-e-f et a-c-e-f a-b-d-f path (possible assignment = 20) a c b d e f a-b-e-f path (possible assignment = 10) a c b d e f a-c-e-f path (possible assignment = 20) Maximal traffic between a and f = 50 units. a c b d e f Maximal Possible Traffic between a and f Heuristic Method for Traffic Maximization

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. a c b d e f Possible paths between a and f by order of cost: 1) a-b-e-f, 2) a-c-e-f and 3) a-b-d-f Assignment on path 1 (a-b-e-f) = 15 units 0 35 Units at minimal cost 35 a c b d e f 15-1 (15) (15) 15-1 (15) Assignment on path 2 (a-c-e-f) = 15 units a c b d e f 15-1 (15) (15) 0-1 (30) 10-2 (30) 10-1 (15) 30 5 Assignment on path 3 (a-b-d-f) = 5 units Minimal cost = 130. Average cost = 3.7 per unit. a c b d e f 10-1 (20) 20-2 (10) 15-2 (10) 0-1 (15) 0-1 (30) 10-2 (30) 10-1 (15) Heuristic Method for Costs Minimization

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Demand Global cost a b c d Marginal cost (a-b) Marginal cost (c-d) Types of Traffic Costs

Copyright © , Dr. Jean-Paul Rodrigue, Dept. of Economics & Geography, Hofstra University. For personal or classroom use ONLY. This material (including graphics) is not public domain and cannot be published, in whole or in part, in ANY form (printed or electronic) and on any media without consent. This includes conference presentations. Permission MUST be requested prior to use. Traffic Q(a,b) Cost g(Q(a,b)) c = 5 Linear cost function Non-linear cost function Traffic Cost Functions