Binary Tree Vehicle Rou1ng Algorithm: Method and Applica1ons. Peter S. Lindquist Qifeng WANG University of Toledo CFIRE GISAG Center

Transcription

1 Binary Tree Vehicle Rou1ng Algorithm: Method and Applica1ons Peter S. Lindquist Qifeng WANG University of Toledo CFIRE GISAG Center

2 Contents Objec1ve of the Project Project DescripEon and MoEvaEon Similar Project and So0ware New Route Planning SoIware Package: PathWorld New Algorithms for PathWorld Binary Tree Spanning Method for Shortest Path VRP (Large Data set) Algorithm Simula6on Architecture & Func1onali1es of PathWorld Design Environment Data Set FuncEonaliEes of PathWorld : Phase I 3 Working Scenarios of PathWorld : How to Make PathWorld Faster? Future Works Web- Based ApplicaEon 3 Phase of Evolu6on

3 ObjecEve of the Project Project DescripEon and MoEvaEon Similar Project and SoIware New Route Planning SoIware Package: PathWorld

4 Project DescripEon and MoEvaEon Vehicle roueng in super huge data set Not only provide the algorithm but provide ways to manipulate data User Interface that can make a user friendly soiware Develop a strategy to compare the new algorithm/soiware with the exiseng ones Data sets seleceon EvaluaEon system

5 Similar Project and SoIware Google Earth Fast and easy to use Huge data set including all the major USA highways Cross border funceon not included No Eme- sensieve VRP including Pre- calculaeng all the major routes TransCAD Make your own data set, small data set works but sell Eme waseng. No indicaeon whether the shortest path is found

6 Similar Project and SoIware ArcGIS Built the network file then roueng The speed of roueng itself is acceptable but pre- processing is Eme waseng No indicaeon whether the shortest path is found LogisEcs companies like UPS, FedEx Supply chain management Hierarchal delivery system

7 Recent SituaEon for the Industry Different data set Different moevaeon (customized soiware) Due to the nature of each algorithm, no comparison between different algorithms (Daniel Delling, 2009) Real shortest path or near- opemal? Pure mathemaecal opemizaeon Time waseng or Eme efficient (Algorithm)?

8 New Route Planning Software Package: PathWorld Cross border vehicle roueng between USA and Canada Time sensieve roueng New algorithm (Different scenarios) which is real efficient which a laptop can run it Super huge data set in including every USA and Canada roads (ORNL) MulEple desenaeon roueng

9 New Algorithms for PathWorld Binary Tree Spanning Method for Shortest Path VRP (Large Data set) Algorithm SimulaEon

10 Explore the Data ConnecEvity matrix Coordinates ArEficial Network

11 Data Structure of the Binary Tree

12 Expanding and Shrinking of the Binary Tree K=1 K=2 Expanding K=1 K=2 K=3 K=6 K=7 Shrinking K=6 K=7

13 No Control on DirecEons 86 to 28 takes 217 seconds, the red circles takes too much compueng Eme. How to shrink the connecevity in order to navigate to the right direceon. Use the direceon as a constraints. Half 2 Half 1 Slope control must be added into the way of select next point, if the slope between next point and desenaeon is not in the same half, delete the next point.

14 Matrix Shrinking by DirecEon Control Matrix Shrinking by DirecEon Control Use matrix shrinking can save a large compueng Eme and guarantee the right direceon. Only the red points will be processed during the path finding, a new Distance_ConnecEvity matrix will be generated. Sub tree will be constructed

15 If DIS>15, Cost= DIS*2.5; Else DIS<15, Cost= DIS*3.5; Else DIS==0, Cost=0; CreaEng the Cost FronEer The cost can be provided by another matrix. Shortest path Cost & Distance tradeoff for all paths, user can select what they want.

16 SimulaEon ArEficial network including 2,500 points Real shortest path is returned by BTSM BTSM is faster then Dijstra s

17 Architecture & FuncEonaliEes of PathWorld Design Environment Data Set FuncEonaliEes of PathWorld 3 Working Scenarios of PathWorld : How to Make PathWorld Faster?

18 Design Environment Tools- Matlab Why Matlab? TransportaEon network is all about matrix Powerfully capability in matrix calculaeng Easy to debug Robust interface with other languages Write funceons in Matlab and call the funceon by VB.NET, Python, Java (data calculaeon done by Matlab, UI and visualizaeon by other languages)

19 Data Set Data from ORNL More than 120,000 Links

20 Data Set Data from ORNL More than 80,000 nodes

21 FuncEonaliEes of PathWorld : Phase I 1: Single O/D pair vehicle roueng in the U.S.A, 2: Single O/D pair vehicle roueng in Canada, 3: TSP roueng between a single origin and muleple desenaeons, and 4: Cross border vehicle roueng between the U.S.A. and Canada. (SDSS)

22 3 Working Scenarios of PathWorld : How to Make PathWorld Faster? Inter- State Vehicle RouEng Intra- State VR Long- Haul Mode Network ParEEon Pre- CalculaEon 7 8 9

23 Paring Node ID with ZIP ZIP Link different layers Pairing ZIP and UT Nodes Access and egress point Highway ZIP

24 Demo of PathWorld

25 Demo of PathWorld

26 Demo of PathWorld

27 Future Works Future Works Web- Based ApplicaEon 3 Phase of EvoluEon

28 Phase 2- Intermodal HW Layer The main roueng layer US ZIP MariEme Rail Last mile delivery Virtual link Main route

29 Phase 2- SDSS /Data CollecEon Phase Find the break down point Volume Distance Last mile Pickup/Delivery highway(zip code level) will be very short which means the main roueng will not be on HW Only 2 modal will be selected during the transportaeon (Highway+ MarEme/Rail) Weight staeon won t be used

30 3 Phases of evolueon How to make decision of modal change/seleceon? Due to the shortage of data we need to make user acevity analysis. Phase 2 (SDSS phase) SDSS, user will determine what modal to choose and which modal to use. Data colleceon phase (Total volume/total distance/dummy variables). Phase 3 (Modeling phase) Use discrete choice model to modeling the choice for the user. The sample size The model will be integrated into the UI, user don t need to make the choice

31 Q & A Thanks! Qifeng WANG Peter S. Lindquist University of Toledo Contact: peter.lindquist@utoledo.edu Qi- Feng.Wang@rockets.utoledo.edu

32 Highway Nodes: Total No: 80,662 Object_ID: 1-80,662 UT_NODEID: 100, ,520 (81520) Lat Long Q & A Highway(115,861): NLANE: the number of lanes 00,000, ,005,400 Miles: The length of the highway, 0 is included in the dataset TR_TT_NITE/ TR_TT_DAY/ PA_TT_NITE/ PA_TT_DAY (ALL SAME) FR_UTNODE & TO_UTNODE