Modelling Commercial & Freight Transport

Transcription

1 Modelling Commercial & Freight ransport Prof. Dr.-Ing. Markus Friedrich Universität Stuttgart Institut für Straßen-und Verkehrswesen Lehrstuhl für Verkehrsplanung und Verkehrsleittechnik Seidenstraße Stuttgart el. +49 (0)

2 Content Introduction Network Modelling Demand Modelling Assignment

3 Content Introduction Network Modelling Demand Modelling Assignment

4 Definitions Commercial ransport trips which are generated by persons during their jobs Freight ransport trips performed for goods transport or the preparation of goods transport

5 Problems in Demand Modelling compared to passenger transport smaller number of decision units in freight transport a single decision unit may have direct impact on demand more complex interactions between the actors more complicated to model the decision process different types of transport items (urgent single parcel to non-urgent bulk shipment) specific goods classes

6 Problems in Assignment Modelling compared to passenger transport location of hubs/terminal is important o-d matrix needs to be transferred into a route-leg matrix network o-d matrix route-leg matrix Z Z Z Z Z Z Z Z Z Z Z Z

7 Differences Long Haul & Regional ransport long haul regional matrix by goods-class by o-d matrix by goods-class by o-d mode choice choice set of uni- and intermodal routes from multimodal network tour choice choice set of unimodal tours from road network D D O D O D D matrix by vehicle unit by mode by route-leg matrix by vehicle unit by route-leg assignment assignment

8 Content Introduction Network Modelling Demand Modelling Assignment

9 ransport Systems & Modi multimodal: analysis of several transport systems ransport System = vehicle + network + type of operation transport supply Sys 1 (van) Sys 2 (truck) Sys i ( ) Sys i+1 (rail) Sys i+2 (ship) ransportsystem Mode 1 (van) Mode 2 (truck) Mode 3 (rail&road) Mode 4 (rail) Mode m ( ) Mode Mode = set of transport systems for one journey or shipment transport demand unimodal: uses just one type of operation from O to D intermodal: uses several types of operation from O to D

10 Network Model: Nodes, Links, erminals Sys Sys time time cost cost car car truck truck rail rail transfer time time cost cost truck-rail rail-rail rail-rail transfer time time cost cost truck-truck Sys Sys time time cost cost car car truck truck rail rail

11 Example National Network Model source: SPIN (Scanning the Potential for INtermodal ransport, 2003)

12 Example Urban Network Model ransport Systems Demand Segments

13 Example Urban Network Model urning Penalties

14 Content Introduction Network Modelling Demand Modelling Assignment

15 Demand Model for Regional Commercial raffic Model WIVER by Sonntag Model VISEVA by Lohse 2002 Model characteristics 3 stages (production, evaluation, distribution) no mode choice (trip end approach) inherent tour building constraints segmentation of demand by industry sector and vehicle class separation of (global) behavioural data and (local) structural data

16 our Based Demand Model VISEVA c Consignee 2 Consignee 3 Consignee 1 Consignee n-2 Consignee n-1 trip 1 s Sender trip n e trip of tour s e c starting trip ending trip connecting trip number of trips in tour: number of visited consignees: n-1 n

17 rip Evaluation c Consignee 2 Consignee 3 o d Consignee n-2 Consignee 1 Consignee n-1 trip 1 s Sender trip n e trip of tour relationship between sender and consignee s e c o d starting trip ending trip connecting trip relationship sender origin of a connecting trip relationship destination of a connecting trip - sender starting trip from i to j: connecting trip from i to j with home zone e: ending trip from i to j: ev s ij ij o c d ije ei ij je e ij = ev ev = ev ev ev ev = ev ij

18 rip Generation: Sender Volume Produced sender trip volume VP i by the senders of zone i = number of consignees visited by all senders of zone I at their destination zone depends on the average number of tours and the average number of consignees visited per tour VP i = ( npi 1) t pi XPpi p XP pi t pi n pi Value of production unit p in zone i ours per production unit p Number of trips within one tour C 1 C 2 C employees 0,1 drivers/employees 80 trips 2,0 tours/driver (5,0 trips/tour -1) C n-1 trip 1 Sender trip n

19 rip Generation: Starting rips Number of trips VS i starting at zone i is equal to the number of tours starting at this zone. It corresponds to the number of trips / tours ending at this zone: VSi = t pi XPpi p XP pi t pi n pi Value of production unit p in zone i ours per production unit p Number of trips within one tour C 1 C 2 C employees 0,1 drivers/employees 20 trips 2,0 tours/driver C n-1 trip 1 Sender trip n

20 rip Generation: Connecting rips Number of connecting trips VC i related to home zone i : VC i = ( npi 2 ) t pi XPpi p XP pi t pi n pi Value of production unit p in zone i ours per production unit p Number of trips within one tour C 1 C 2 C employees 0,1 drivers/employees 60 trips 2,0 tours/driver (5,0 trips/tour -2) C n-1 trip 1 Sender trip n

21 rip Generation: Attraction and Balancing Potential of attracted trips PA j by consignees in zone j PAj = XAsj asj s XA sj a sj Value of attraction unit s in zone j rip attraction rate of s in zone j Number of attracted trips VA j by consignees in zone j results from balancing the attraction potential with the number of generated trips VA j VPi i = PAj j PA j

22 rip Generation: Constraint Production = Attraction Constraint VS + VC = VA i i i i i i Σ Produced rips = Σ Attracted rips

23 rip Distribution rips v ij between zone i and zone j C Si Ci i Sj Cj j C C S v ij = S v ij m + e= 1 v C ije + v ( i, j = 1,...,m ) E ij starting trips connecting trips ending trips

24 rip Distribution: Constraints For trip distribution the following constraints must hold over all zones 1 to m : m j= 1 m i= 1 m j= 1 m i= 1 m v = VS ( i = 1,...,m ) S ij E ij ij i i ij j j m i= 1 j= 1 C ije i v = VS ( j = 1,...,m ) j v = VS + VA ( i = 1,...,m ) v = VS + VA ( j = 1,...,m ) v = VC ( e = 1,...,m ) e starting trips of tours ending trips of tours out-trips in-trips connecting-trips

25 rip Distribution: Solution Generate trip table by determining the factors fo, fh, fd, S i C e E j fo i and fd j considering the constraints v ev fo ( ev fh ) ev fd fo fd m S S C E E ij = ij i + ije e + vij j i j e= 1

26 rip Distribution: Solution Singly Constraint Doubly Constraint

27 Content Introduction Network Modelling Demand Modelling Assignment

28 Route-Legs, Routes, Connection-Legs, Connections 12:00 6:00 8:00 16:00 17:00 O D route-leg: sequence of links with one vehicle connection-leg:route leg with departure time 8:00 route: sequence of route-legs connection: route with departure times 8:00

29 Road Freight Assignment similar characteristics of of passenger & freight vehicles interdependency between passenger & freight vehicles demand matrix contains flows on on the the level of of route-legs use standard highway assignment multi-class assignment user classes distinguish type of of vehicle value of of time

30 Road Freight Assignment - Dynamic Assignment?

31 05:00 06:00 Uhr

32 06:00 07:00 Uhr

33 07:00 08:00 Uhr

34 08:00 09:00 Uhr

35 09:00 10:00 Uhr

36 hank you!

37 Rail Freight Assignment link link based assignment generates routes from link link network line route based assignment generates routes from set set of of route-legs timetable based assignment generates connections from set set of of connection-legs 5:00 6:30 9:20

38 Suggestion for an Intermodal Assignment Characteristics route based uni-modal & intermodal routes including mode choice

39 Intermodal Assignment Pre-processing: input or generate route-legs for all transport systems Search: construct route tree Impedance: calculate generalised costs for all routes including transfer costs Choice: distribute demand onto routes

40 Generation of Route-Legs origin destination origin terminal terminal destination separately for each transport system terminal terminal O D

41 Search: Route ree container of of route-legs RLi: Sys, Line Route, From, o 0 origin RL1 road 1 RL2 rail 1 2 RL2 rail 2 insert route-leg 2, 2, if if 2 at at node travel time time (RL1 (RL1 + RL2) < MIN MIN travel time time (node 2) 2) travel cost cost (RL1 (RL1 + RL2) < MIN MIN travel cost cost (node 2) 2) no. no. transfer (RL1 (RL1 + RL2) < MIN MIN no. no. transfer (node 2) 2) depth

42 Search: Route ree D D D O D width D level 0 level 1 level 2 level 3 level 4 depth

43 Result of Search: Choice Set route 1: unimodal, road only, no vehicle transfer route 2: unimodal, road only, no vehicle transfer route 3: unimodal, road only, one vehicle transfer route 4: intermodal, road & rail, two vehicle transfers route 5:... O D

44 Route Choice P i U = i C : i U j j C j Ui... Utility of Route i e.g. U i = e -b Imp i Ci... Commonality Factor of Route i 0 Ci 1

45 hank you!