Saturn user group meeting epsom october 14 2004
Download
1 / 33

SATURN User Group Meeting: Epsom, October 14 2004 - PowerPoint PPT Presentation


  • 150 Views
  • Uploaded on

SATURN User Group Meeting: Epsom, October 14 2004. Presentation by Dirck van Vliet. SATURN 10.5: NEW FEATURES. Release of Origin-based Assignment Better Simulation-Assignment Convergence Improved understanding and reporting of very poor convergence Improvements in SATME2

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'SATURN User Group Meeting: Epsom, October 14 2004' - bruno


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Saturn user group meeting epsom october 14 2004 l.jpg
SATURN User Group Meeting: Epsom, October 14 2004

  • Presentation by Dirck van Vliet


Saturn 10 5 new features l.jpg
SATURN 10.5: NEW FEATURES

  • Release of Origin-based Assignment

  • Better Simulation-Assignment Convergence

  • Improved understanding and reporting of very poor convergence

  • Improvements in SATME2

  • Specific Program Upgrades


10 4 bugs a l.jpg
10.4 BUGS (A)

  • Matrix cordon crashes (1)

  • Rotational shift in graf.dat (2)

  • Incorrect speeds in DA code 4053 (8)

  • ROSIE refuses to work! (9)

  • The speed-flow elasticity ‘g’ corrected in both 10.4 and 10.5 (15, 42)

  • Programs with missing segments (19,20)


10 4 bugs b l.jpg
10.4 BUGS (B)

  • SATALL command line problems with FRREZE and ICING = T (26)

  • SATALL problems with MASL n (28,29)

  • Various problems under PASSQ when flows enter/leave at the “wrong” ends (33)

  • SATNET – use of lower case ‘c’ (36)

  • SATNET – PASSQ and UPDATE together (39)


10 4 bugs c l.jpg
10.4 BUGS (C)

  • Incorrect entry/exit flows on simulation links with UPBUS = T (36)

  • Potentially major problems with highly congested networks involving MAXQCT and PASSQ (41)

  • SATALL: Problems in delays calculated under PASSQ when the proportions of traffic within shared lanes changes (38)


Origin based assignment oba l.jpg
Origin-Based Assignment (OBA)

  • Full release in 10.5

  • Supplementary fee structure


Origin based solution l.jpg

1

2

2600(.060)

2500(.066)

6200(.040)

3

4

5

6

4500 (.043)

3200 (.023)

2200(.147)

3000(.097)

7

1600(.040)

915 (.055)

800 (.07)

8

9

415 (.020)

485 (.107)

2500 (.057)

12

11

10

16

15(.032)

18

300 (.137)

800(.137)

400(.163)

17

300(.04)

1400(.030)

14

15

19

300(.043)

23

22

11(.122)

389(.042)

311

(.037)

13

24

21

20

900(.177)

489(.118)

Legend

used link

flow(cost)

node

13

Origin-based solution



Practical advantages of oba l.jpg
Practical Advantages of OBA

  • Comparable cpu to Frank-Wolfe.

  • Efficient data storage (RAM)

  • Improved accuracy (especially for small network/matrix changes)

  • Route flows may be analyzed exactly for, e.g., select link analysis

  • Permits “warm starts”


Oba restrictions l.jpg
OBA Restrictions

  • Multiple User Classes (directly)

  • Elastic Assignment (directly)

  • SATPIG

  • Cordon matrices in P1X (but OK in SATCH)


Oba examples l.jpg
OBA Examples

  • Headingley buffer network: Add 1 trip

  • York network: Add 1 lane

  • “Inkton” – Optimize signals


P1x a l.jpg
P1X (A)

  • Link annotation choices sub-divided (3)

  • Maximum transient queues (4)

  • Continued improvements in PMAKE (5)

  • Reduced intensity .bmp files (14)

  • GIS curved links as “arcs” (18)

  • .Dat files updated from SIGOPT or SATOFF = T (20)


P1x b l.jpg
P1X (B)

  • Multiple crossings in SLA (26)

  • UC Flows explicitly listed under link annotation (27)

  • Node line drawings properly scaled (28)

  • Improved choices for bandwidth colours (30)

  • More logical defaults for data from missing links(32)


P1x c l.jpg
P1X (C)

  • Blocking back factors annotated as 1-BBF (41)


P1x convergence menu l.jpg
P1X – Convergence Menu

  • New “top menu” entry

  • Includes new forms of convergence information:

  • Changes to blocking back factors

  • Network summary / comparisons

  • 10 worst converged nodes, flows and delays


Slide17 l.jpg
MX

  • New batch file MXWEIGHT to combine matrices (e.g., within external demand-supply loops)


Satnet l.jpg
SATNET

  • U-turns for buses more realistic (3)

  • New checks/input options under KNOBS (4-7)

  • Blank lines now ignored (mostly) (10)

  • Lane-disciplined roundabouts (to follow)


Satall l.jpg
SATALL

  • AUTOK still there!

  • Better identification of simulation link flows with UPBUS = T (6)

  • Various minor changes in the way simulation cost-flow curves are estimated


Simulation a l.jpg
Simulation (A)

  • Blocking back no longer applies in certain circumstances (4)

  • Random delays may also be applied to “minor” movements (6)

  • Minimum iterations – NITS_M ()

  • Exit/entry flows on sim links are better differentiated with UPBUS = T


Simulation b l.jpg
Simulation (B)

  • Queued delays in over-capacity shared lanes are rigidly controlled by their combined V/C ratio (7)

  • Particularly significant with PASSQ flows (8)

  • Tighter controls of lane sharing (9)

  • “Between-node” simulation convergence monitored separately (11)


Assignment l.jpg
Assignment

  • Minimum number of iterations –NITA_M (1)

  • MAXQCT now used in the assignment as well as the assignment (2)


Satme2 l.jpg
SATME2

  • Extra documentation (1)

  • Extra warnings (2-4)

  • .ME2 files allows P1X to display, e.g., Xa factors

  • Options to combine counts together (e.g., as screen lines) (8)


Satoff sigopt l.jpg
SATOFF / SIGOPT

  • Batch file now runs SATOFF and SATSIM automatically (1)

  • NIPS parameter in SATALL limits the number of optimisations


Satcoba l.jpg
SATCOBA

  • Add link flows from multiple “networks” (1)

  • Link turning proportions added (2)

  • Common link numbers for different networks (6)


Super convergence tricks l.jpg
Super Convergence Tricks

  • Use OBA for the assignment

  • Use AUTOK

  • Use NITA_M and/or NITS_M


Networks behaving badly why l.jpg
Networks Behaving Badly; Why?

  • Badly congested in future year

  • Badly coded do-minimum networks

  • One-lane roads with multiple turns

  • Excessive blocking back with “feedbacks”

  • Incorrect use of MAXQCT

  • External traffic that cannot enter the network


Sateasy demand models l.jpg
SATEASY Demand Models

  • “Separable” demand functions by o-d

  • Limited number of demand formulae

  • Incorporated internally

  • Optimum convergence


Full demand models l.jpg
“Full” Demand Models

  • Includes interactions between o-d’s, e.g., distribution

  • Potentially extremely complicated combination of individual blocks

  • Very large number of potential structures

  • Some structures (e.g., hierarchical logit) may be optimised

  • But …


Demand model components l.jpg
Demand Model Components

  • … individual components are based on standard matrix and/or vector manipulation

  • Can be set up using: MX, EXCEL, CUBE (Trips) … or DIADEM

  • Onus is on the modeller to choose the appropriate structure + parameters for their particular study


Vadma diadem concerns l.jpg
VaDMA / DIADEM “Concerns”

  • VaDMA is not sufficiently prescriptive

  • DIADEM / SATURN interface

  • DIADEM may not satisfy “basic” VaDMA recommendations

  • Insufficient testing using real studies to verify the VaDMA scoping spreadsheet or to provide a “good” example.


Slide32 l.jpg

C

d-1(T)

s(T)

A

c(1)

E

D

C

B

T

Figure 7.6: A (convergent) cobweb set of demand/supply iterations


Fixed step length supply demand equilibration fsl l.jpg
Fixed Step Length Supply – Demand Equilibration (FSL)

  • General method for equilibration between demand models and supply (SATURN)

  • Take weighted average of “current” and “next” demand-generated trip matrix with a constant weighted average.

  • Good guess: lambda = 1 / (1 + e)


ad