You are on page 1of 164

7/23/2010

Sponsored by

In association with
1

7/23/2010

7/23/2010

Cube Base

ArcGIS 3D Analyst

7/23/2010

Introduction to Cube

7/23/2010

Cube Reports

Cube Base

7/23/2010

7/23/2010

Sugar Accident
traffic accident data collection

Sugar Transit Analyst


ridership and revenue estimation

Moving to Enterprise

Work flow: Cube, Mint, Sugar

7/23/2010

Mint

Cube Base

Sugar Network Editor

GIS Window:
unlimited layering, labeling, intersection
coding and analysis, unmatched
network editing and analysis, charting,
links to digital media

Application Manager:
process flow-chart for building, running
and documenting models
Scenario Manager
an easy-to-use model catalog of
applications and scenarios with links
to inputs, outputs, and reports

7/23/2010

Example: the Cubetown Demonstration


Model

In this exercise you


will explore the
Cubetown
Demonstration
Model

Steps:
1.
2.

3.

Start Cube.
Open the
Cubetown model
catalog.
Select File > Close
Catalog when
done

7/23/2010

Introduction to Application Manager


VDOT Cube Training Day One

19

Lesson overview

10

7/23/2010

Simple applications to automate analysis


steps

The simplest kind of application may stand alone and just sequence
or automate some commonly performed data analysis tasks
Example: analyze network path costs for highway and transit users
Inputs:

Outputs:

Highway network
Public transport (PT) data
Highway cost matrices
Public transport cost matrices

Steps:

Create new application


Add process steps using templates
Link processes to input data; provide output names
Run application

Creating a new application


1.

2.

3.

Click on the New


File button on
the Cube toolbar
menu
From the list of
new file types,
select New
Application
Provide required
Application
Information

Group Name
Group Code
Group Type

11

7/23/2010

Check application manager settings

Make sure that


Generate Required
Files and Apply
Process
Templates are
selected

Adding the first program step: Highway


skims

All passenger travel forecasting modules


are available from the Program menu
These are categorized by purpose,
product family, and program name

This adds a program box to the


application and prompts you to select a
process template to apply

Select Program > Passenger Forecasting >


VOYAGER > HIGHWAY

Pick Matrices of Highway Time and


Distance

You will then be prompted to provide


input and output filenames
Click Done when finished

12

7/23/2010

Process template parameter entry


window

Browse to input net = C:\TrainingData\Work\Highway.NET


Directly enter output matrix = Highway_Skim.MAT
If directory is not specified, implied model working directory will
be used (application location = C:\TrainingData\Work\)
Click Done when finished

Structure of a process step

Input Script File


Box

Program Box

New Output File


Box

Right click on a program box


to hide files and set a title
Single-click on a program or
file box to select (yellow)
Double-click on a program
box to run
Double-click on a file box to
open file

Input Linked
File Box

Unused Output
File Boxes
Unused Input
File Boxes

Execution Order

13

7/23/2010

Script files and process templates

Every Cube Voyager process step has a script containing a set of


instructions that tell the program how to process the data
To see the script for a process template, double-click on the
input script file box to open the parameter entry window, then
click on the Go To Editor menu option
Process Template Parameters

Start of Program Script


File Parameter References

End of Program Script

Adding your own process templates

We will cover more advanced Cube


Voyager scripting later in this course
If you know Cube Voyager scripting,
you can create your own process
templates and add them to Cube
Open PT_Skims.S (in the Work
subdirectory; within TrainingData)
This file contains a process template
we can use to develop transit skims
Go to File > Save Template in User.tpl
Add New Template; named PT Skims

14

7/23/2010

Exercise:
public transport skims

Program > Passenger Forecasting >


VOYAGER > PUBLIC TRANSPORT
Select user template PT Skims
Enter input/output file names (see
below)

Close and save your application

Go to File > Close on menu or click on


small X in upper-right-hand corner

To save without closing, use File >


Save

To save under a different filename, use


File > Save As

Note: all the same files will be referenced


(including script files)

To close without saving, answer No to


save changes prompt

15

7/23/2010

Exercise: Add Training Model Templates

Open Training.TPL (in the Work


subdirectory; within TrainingData)
This file contains process templates
we will use for the steps in the model
Go to File > Save Template in User.tpl
Add New Template; named Training
Model

Exercise: create travel demand model


application

16

7/23/2010

Exercise: add trip generation step

Leave files blank


this time

Linking files using application manager

Right-click on the Zonal Data 1 input


file box and select Link To > Link
To File from the context menu
Browse to TAZ.DBF
Repeat the process to link Zonal Data
2 to EITRIPS.DBF
Right-click on the ZonalPAData 1
output file and select New File
Use the Save As dialog to enter the
output file name: TripEnds.DBF
Note that Link to File is not an
option for output files

17

7/23/2010

New files and file auto-naming

Script files are automatically created and auto-named on creation


You can also right-click to auto-name a new file
The auto name is based upon the following formula:
{Two-letter application group code} +
{Three-letter program file code} +

{Two-digit application version number} +


{One-letter file ID, automatically incremented} + . + {file extension}

For example:MANET00A.NET
Tip: These settings can be customized in: Settings > Default
Settings > File Naming > Use Customized Automatic File Names

Looking at file details

You can change the application


manager view to show/hide file names,
descriptions, and other information
Right-click on a file and select
Properties from the context menu to
get more detailed information

Newly created
files are empty

18

7/23/2010

Adding a previously created application


group

The Trip Distribution and Mode Choice


steps will require skim matrices as
input
We can re-use the network skim
Application we created earlier
Group > Insert Application Group
Select Network00.app

Application Sub
Group Box

Navigating hierarchical application


groups

Double-click on an Application Sub


Group Box to open the Sub Group
To share files used by the Sub Group
with the rest of the application, make
them public
Right-click on an input or output file
box and select Make File Public
Public files are marked with >>
symbols
To return to the previous view, rightclick on white space and select Go To
Parent or select Group > Go To
Parent (F9) from the Cube menu

19

7/23/2010

Exercise: add trip distribution step

Leave Blank &


Link Later

Making permanent input / output file


linkages

20

7/23/2010

Un-linking files and correcting mistakes

To un-link an input file:

Click on the target input file box


Select Delete Link from the Cube Edit
menu
(shortcut key = Ctrl+D)

To remove a named file:

Click on any used file box


Select Clear File Name from the Cube
Functions menu (shortcut key = Shift+L)
Specify whether to delete the file from disk
as well (e.g. with auto-named files)

Exercise: add mode choice step

21

7/23/2010

Change execution order

Conceptually, the Trip Generation, Trip


Distribution, and Mode Choice Steps
should be kept together as a sequence
Change the execution order of the
Network Skims group to occur first
Right-click on the Network Skims
group and select Set Execution Order
Answer Yes when prompted to
adjust the execution orders into
sequence
Left-click on the upper-left corner of
the Network Skims group and drag to
move

Make assignment subgroup

Much as existing application groups


can be added within other
applications, new application groups
can be inserted as well
Select Make New Sub Group (F7)
from the Group Cube menu
Enter required information just as you
would for any new application:

Group Name = Assign Trips


Group Code = AT
Group Type = VOYAGER

22

7/23/2010

Exercise: add time-of-day factoring step

Link mode trips to time-of-day factoring


step

23

7/23/2010

Exercise: Add highway assignment step

Running the application in Task Monitor


Select Run Application (F2) from the
Application Cube menu
Optional:
Run Current Group Only
Start run at the active program box

Task Monitor displays the run progress


and shows which group is being
executed
The run can be paused and stopped
using the yellow and red buttons
When the run is finished, you can View
Run Report File to inspect results

24

7/23/2010

Exporting a model run batch script

Clear the results by selecting Delete


All Output Files from the Functions
menu
Run the Application as before,
selecting Create Script (Run from
VOYAGER)
A script with the same name as the
application will be created and opened
in the Voyager run window
Click on the Edit Input File button to
view the script with the Cube text
editor
All macro parameters are substituted
into the batch script when it is created

Importing an existing batch script file (1)

We can re-create the application by


importing the batch script file
This is similar to the process used to
convert a TP+ job to Application
Manager
Select the Model00.S script file for
import

25

7/23/2010

Importing an existing batch script

During import, you


can organize the
steps identified in
the script into
groups of
logically related
operations, using
Start of subgroup and End of
sub-group
Create a Demand
group including
Generation,
Distribution, and
Mode Choice

Moving the Application to a Clean


Directory

Select New Application Directory


from the Application Cube menu
This will move the application and all
linked files to a directory you specify,
leaving behind any unused files
This function can be helpful for
cleaning up a model after
development is done

26

7/23/2010

Introduction to Scenario Manager


VDOT Cube Training Day One

53

Lesson Overview

27

7/23/2010

Creating a new model catalog

Click on the New


File button on
the Cube toolbar
menu
From the list of
new file types,
select New
Catalog
Select a location
for the catalog file
All the files for
your model will be
contained inside
this directory

Anatomy of the scenario manager

Scenario Manager
consists of a dock
with four panes:

Scenarios pane
hierarchical list of
defined alternatives
Applications pane
hierarchical list of
models and groups
Data pane
hierarchical list of
inputs and outputs
Keys pane table of
parameters that
affect and define
scenarios

28

7/23/2010

Adding an application to the catalog

Defining catalog keys

The Keys pane allows you to define the


keys that differentiate among scenarios
Catalog keys are parameters that can
be substituted anywhere within the
script files that control the model
process
Catalog keys are referenced e.g. in
scripts using curly brackets: {Key}
A value for each key is defined for each
scenario, and when the scenario is run,
this key value is substituted in all scripts
To create a new key, right-click on the
Keys pane and select Add from the
menu

29

7/23/2010

Catalog key names

Each key has a


unique name. This
name will be used
within curly braces
to reference the key
value in model
scripts or controls
The prompt field is
a question to ask a
model applier when
entering key values
A description can
also be entered to
document intent

Catalog key types

Numeric types

Text types

Integer
Real
Boolean (0/1)
Character
File Name
Note

Three ways to prespecify key values:

Default value
Value range
List of allowed
values

30

7/23/2010

Linking application input files to catalog


keys

Right-click on the
input file box you
wish to link to a key
Select Link to
Catalog Key
A listing of
available keys is
provided; click to
paste the key into
the Data Name
entry field
Click on the New
Key button to add a
new definition on
the fly while
linking

Exercise: Create input network file key

31

7/23/2010

Exercise: Create input zonal data file


key

Identifying Key-Linked Files in the


Application

Select View >


Legend from the
menu to get help
with reading the
flow-chart layout
Files linked to
catalog keys are
shown with a
yellow triangle
next to the file box

32

7/23/2010

Scenario key inheritance

The Scenarios pane provides a


hierarchical list of the scenarios, or
alternative conditions, to be evaluated
The first scenario created is always
called Base. It is the parent for all
other scenarios.
You can add a scenario by right-clicking
and selecting Add child from the menu
Initially, this child scenario will
inherit all of the key values of its
parent (Base)
You then differentiate the two scenarios
by altering the key values of the child
Sibling scenarios inherit key values
from the same parent scenario

Scenario directory structure

A subdirectory of the model catalog


directory will be created on disk for
each scenario when created
The Base subdirectory is created
automatically with any new catalog
The folder name will correspond to the
scenario name if the scenario is
renamed, the folder will be as well
The relationship between scenario
directories corresponds to their key
inheritance (parent-child) relationships
A scenario directory is a subdirectory
of the parent scenario directory

33

7/23/2010

System keys and scenario-specific files

Several keys are defined by the system:

{CATALOG_DIR}
the root directory where the *.CAT file is located
{SCENARIO_DIR}
the scenario directory
{SCENARIO_CODE}
{SCENARIO_SHORTNAME}
{SCENARIO_FULLNAME}

A file-reference can be made scenariospecific by including one or more of these


keys in the path (e.g. {SCENARIO_DIR})
This operation is automated by right-clicking
on a file box and selecting Make file
scenario specific in the Application

Exercise: Make output files scenariospecific

Make the following model output files


public and scenario-specific:

Production and attraction trip ends


Person-trip tables
Trips by mode
Auto trips by hour

34

7/23/2010

Basic user modes and scenario editing

Scenario editor control types

The Scenario editor


interface is created
by the developer
when defining keys
Note-type keys
provide titles
Non-note controls:

Edit box
(all except boolean)
Spin control
(integer)
Check box
(boolean)
Combo list / edit
and radio buttons
(allowed value list)

35

7/23/2010

Exercise: Add mode choice parameters

Add the following mode choice model


parameters as real-type catalog keys:

Transit-specific cost shift constant


Walk-specific cost shift constant
Home-based-work scale parameter
Home-based-other scale parameter
Non-home-based scale parameter

Apply minimum value of 0 and maximum


value of 1.0 to scale parameter ranges
Show keys for model developer only
Substitute values as appropriate into
mode choice MATRIX program script
using Insert > Catalog Key command

Organization and presentation of keys

Create a Note-type header for the


mode choice model developer keys
Use Advanced button to set font
size
You can present keys on multiple
pages using the Start a New Page on
the Scenario Dialog for this Key
option
Right-click in the Keys pane and select
Move > Arrange to change the
order in which keys are presented

36

7/23/2010

Adding files to the Data pane

By default, any files linked to catalog


keys or scenario-specific files are
included in the Data pane listing

To change this setting, right-click on the


Catalog tab heading, select Properties, and
then select the Data pane tab

You can right-click on any file box in an


application and select Add to Data
Pane
You can also manually add other files by
right-clicking on the Data pane and
selecting Add Data
To add sub folders to the default Inputs,
Outputs, and Reports folders, right-click
and select Add Sub Folder

Exercise: Add external trip tables to data


pane

Double-click to enter Demand group


Right click on Zonal Data 2 input file
box for Generation step (EITrips.DBF)
and Add to Catalog Data Section
Repeat process for Matrix File 4 input
to Mode Choice Matrix step
(External.MAT)

37

7/23/2010

Model feedback and loop controls

To ensure consistency between input


and output skim values, many models
are run with feedback between
demand and supply sub-models
(variable demand)
Feedback loops are implemented in
Cube Voyager using Pilot and automated
using Control > Loop New
The steps to be looped are identified via
their execution order numbers
The number of iterations can either be
fixed or linked to a Pilot global variable
Click and drag a file to add it to the loop
Upper-left = first iteration, lower-left =
subsequent; right = current file copy

76

38

7/23/2010

VDOT Cube Training Day Two

77

39

7/23/2010

40

7/23/2010

41

7/23/2010

42

7/23/2010

43

7/23/2010

44

7/23/2010

45

7/23/2010

46

7/23/2010

47

7/23/2010

48

7/23/2010

49

7/23/2010

50

7/23/2010

51

7/23/2010

52

7/23/2010

53

7/23/2010

54

7/23/2010

55

7/23/2010

56

7/23/2010

57

7/23/2010

VDOT Cube Training Day Two

116

58

7/23/2010

59

7/23/2010

3
2

60

7/23/2010

61

7/23/2010

62

7/23/2010

63

7/23/2010

64

7/23/2010

VDOT Cube Training Day Two

130

65

7/23/2010

66

7/23/2010

67

7/23/2010

68

7/23/2010

69

7/23/2010

70

7/23/2010

VDOT Cube Training Day Two

142

71

7/23/2010

72

7/23/2010

Model

GDB

pGDB

fGDB

SDE

fGDB

Model

pGDB

fGDB

pGDB

73

7/23/2010

Model

Model

GDB

Model

Model
GDB

Model

GDB

GDB
Model

74

7/23/2010

75

7/23/2010

76

7/23/2010

77

7/23/2010

78

7/23/2010

Scripts developed to generate


data for mapping and
reporting

79

7/23/2010

159

160

80

7/23/2010

81

7/23/2010

163

SETUP

LINKREAD

ILOOP

ADJUST

LINKREAD

CONVERGE

82

7/23/2010

RUN PGM=HIGHWAY
FILEI NETI = {NETI.Q}
FILEI MATI = {MATI.Q}
FILEO NETO = {NETO.Q}
PAR MAXITERS={NPATH}
PROCESS PHASE=ILOOP
PATHLOAD PATH=COST, VOL[1]=MI.1.1
; load trips
ENDPROCESS
PROCESS PHASE=ADJUST
function { ; this is a function block
cost={cost_fun}
} ; end of function block
ENDPROCESS
ENDRUN

83

7/23/2010

IF (LI.FUNC_CLASS==1-2) LINKCLASS=2

tc[1] = t0*(1+0.15*(V/C)^4)
tc[2] = t0*(1+0.15*(V/C)^8)

Conical:

TC[1] = T0 * (2+SQRT(16*(1-(V/C))^2 + 1.361) - 4*(1-(V/C)) - 1.167)

HCM2000 (Akcelik):

TC[1]=T0+LW.D0+(0.25*T)*((V/C-1)+ SQRT((V/C-1)^2+((16*LW.J*V/C*LI.DIST^2)/72^2)))

Empirical:

TC[1] = T0 * delay(LINKCLASS, (V/C)) ; LOOKUP delay function

IF (ITERATION < 6) BREAK


IF (GAP < GAPCUTOFF)
BALANCE = 1
BREAK
ENDIF
IF (GAPCHANGEAVE(3) < 0.006 &&
GAPCHANGEMAX(3) < 0.009 &&
ABS(GAPCHANGEMIN(3)) < 0.009)
BALANCE = 1
ENDIF

84

7/23/2010

PARAMETERS,
COMBINE=PATH

PARAMETERS,
COMBINE=EQUI,
ENHANCE=2

possible
strings

PATHLOAD CONSOLIDATE=T

85

7/23/2010

IF (LI.FUNC_CLASS==1.5)
ADDTOGROUP=1
ENDIF
PATHLOAD PATH=COST,
VOL[1]=MI.1.1, EXCLUDEGROUP=1
PATHLOAD PATH=COST,
VOL[2]=MI.1.2

86

7/23/2010

87

7/23/2010

COST[2]=TIME+TOLL/{VOT}

88

7/23/2010

PROCESS PHASE=LINKREAD
IF (li.LINKCLASS==1-2) LINKCLASS=2
IF (li.TOLL>0) ADDTOGROUP=1
ENDPROCESS
PROCESS PHASE=ILOOP
PATHLOAD PATH=COST, CONSOLIDATE=T,
EXCLUDEGROUP=1, ; non-toll path
MW[1]=PATHTRACE(TIME)
PATHLOAD PATH=COST, CONSOLIDATE=T,
MW[2]=PATHTRACE(TIME),
MW[3]=PATHTRACE(li.toll)
JLOOP
IF (MW[1]>MW[2])
MW[4] = MW[3]/(MW[1]-MW[2]) ; cost per minute saved
MW[5] = LogNormDist(MW[4],LOG(0.15),-1*LOG(0.10),1)
MW[6] = mi.1.1*MW[5] ; non-toll share
MW[7] = mi.1.1-MW[6] ; toll share
ELSE
MW[6] = mi.1.1
MW[7] = 0
ENDIF
ENDJLOOP
PATHLOAD PATH=COST, CONSOLIDATE=T,
EXCLUDEGROUP=1,
VOL[1]=MW[6]
PATHLOAD PATH=COST, CONSOLIDATE=T,
VOL[2]=MW[7]
ENDPROCESS

89

7/23/2010

Return
share with
VOT less
than cost
per minute
saved

Look up cost per minute saved for O-D pair

FILEI TOLLMATI[#], ;database or text table


ENTRYGATE, EXITGATE, TOLLS, ;identify gate #s in table
NETIENTRY, NETIEXIT, NETITOLLROAD, ;identify in net
TOLLFACTOR, TOLLROUND ;up to 10 factors w/ rounding

PATHLOAD TOLLMATI=#,# ;input table, toll set


TOLLFACTOR ;factor to convert toll to COST

90

7/23/2010

PATHLOAD PATHO=1, NAME=SOV Paths

FILEI SUBAREANETI
FILEO SUBAREAMATO
PATHLOAD SUBAREAMAT[1]=mi.1.1

RUN PGM=HIGHWAY
FILEO PRINTO[1] = "TRACE.CSV"
FILEI NETI = "HWYLOADS.NET"
PARAMETERS ZONES=1351 ;# of nodes
INODE = 5
JNODE = 25
ANODE = 733
BNODE = 1003
PROCESS PHASE=ILOOP
PATHLOAD PATH=LI.TIME_1,
THRUNODE=26,
;actual zones plus one
TRACE=((I=INODE &&
J=ANODE)||(I=ANODE &&
J=BNODE)||(I=BNODE &&
J=JNODE)) PRINTO=1 PRINT=T
CSV=T LIST=A, B, LI.TIME_1
ENDPROCESS
ENDRUN

91

7/23/2010

183

92

7/23/2010

FILE RECI=,
Num1 = 1, Num2(N) = 2, Char(C) = 3
FILE RECI=,
FIELDS = 1(C3) ;all character type

DELIMITER[1]= ,t ; separator
DELIMITER[2]=()[]{} ;escape

FILE RECI=,
Num1=1-5,Num2(N)=6-10,Char(C)=1115
FILE RECI=,
FIELDS=1-5,6-10,11-15 ;all numeric

93

7/23/2010

94

7/23/2010

PATHLOAD PATH=LI.TIME_1, THRUNODE=26,


TRACE=(I=1-25 && J=1-25), PRINTO=1 PRINT=T CSV=T
LIST=I,J, A, B, LI.DISTANCE, LI.TIME_1

FILEO
FILEI
I=1,
WRITE

RECO[1]="TRACE.DBF", FIELDS=I,J,A,B,DIST,TIME
RECI="TRACE.CSV",
J=2, A=3, B=4, DIST=5, TIME=6, SORT=I,J
RECO=1

95

7/23/2010

RO.M1 = MATVAL(1,1,ri.i,ri.j)
RO.M2 = MATVAL(1,2,ri.i,ri.j)

96

7/23/2010

97

7/23/2010

FILEI LOOKUPI[1]="lookup.dbf"
LOOKUP LOOKUPI=1,
NAME=lookup,
LOOKUP[1]=FTYPE,RESULT=SPD_A1,
LOOKUP[2]=FTYPE,RESULT=SPD_A2,
LOOKUP[3]=FTYPE,RESULT=SPD_A3,
FAIL[3]=0
; example of use: v=lookup(3,25)
; look for 25 in the FTYPE field
and returns the SPD_A3 value

98

7/23/2010

ID
1
2
3
4
5
6
7

Streets
Name Type_ID
Wood
4
Davidson
7
Mercer
2
Green
3
Oak
1
Main
1
Barrett
1

Type_ID
1
2
3

StreetTypes
Lanes
Cap_ID
1
2
1
4
2
1

CapClass
Cap_ID Capacity
1
850
2
1100
3
1250
4
1400
5
1800

99

7/23/2010

LOOP r=1,DBI.1.NUMRECORDS
_Read = DBIREADRECORD(1,r)
RO.i = di.1.i
RO.j = di.1.j
RO.a = di.1.a
RO.b = di.1.b
RO.dist=di.1.dist
RO.time=di.1.time
RO.m1=di.1.m1
RO.m2=di.1.m2
RO.linktoll=di.1.linktoll
RO.DISTRICTJ=di.2.DISTRICT
IF (di.1.linktoll>0)
WRITE RECO=1
ENDIF
ENDLOOP
PAR ZONES=1

100

7/23/2010

101

7/23/2010

RUN PGM=MATRIX
FILEO RECO[1] = "TRIPS.DBF",
FIELDS=i,j,m,v
FILEI DBI[1] = TRACE3.DBF",
AutoMDArray=trips, Indexes=i-25,j-25, ArrayFields=M1,M2
ZONES=25
JLOOP
RO.j = j
RO.m = 1
RO.v = trips[i][j][1]
WRITE RECO=1
RO.m = 2
RO.v = trips[i][j][2]
WRITE RECO=1
ENDJLOOP
ENDRUN

102

7/23/2010

103

7/23/2010

207

208

104

7/23/2010

105

7/23/2010

106

7/23/2010

eU i
Pi
eU i
i

Pi
Ui

Tij = Pi (eUij / n=1Z eUin), Uij = Cij + lnAjKij Vij +


where Tij are expected trips between zones i and j,
Pi and Aj are productions from i and attractions to j, respectively,
Uij is the expected (dis)utility of travel between i and j, composed of
Vij is the systematic (dis)utility of travel, plus a random disturbance term

107

7/23/2010

108

7/23/2010

MW[1]
MW[2]
MW[3]
MW[4]
MW[5]

=
=
=
=
=

exp(-beta*(mi.1.gCost))
exp(-beta*(mi.2.gCost) + ASC)
MW[1] + MW[2]
MW[1] / MW[3]
1 - MW[4]

;Auto generalized costs in equivalent time units


MW[11] = mi.2.3
;Transit generalized costs in equivalent time units
MW[12] = mi.3.1 + {ASC_PT}
;Walk access assuming speed of 2.5 miles per hour
MW[13] = 60*mi.2.DISTANCE/2.5 + {ASC_WK}
;HBW mode choice model
XCHOICE,
ALTERNATIVES = car pt walk,
DEMANDMW = 1,
COSTSMW = 11, 12, 13,
ODEMANDMW = 14, 15, 16,
SPLIT = total {HBW_Scale} car pt walk,
STARTMW = 100

109

7/23/2010

XCHOICE,
ALTERNATIVES = all, ;
DEMAND = HBW_P[I], ;
UTILITIESMW = 3,
;
ODEMANDMW = 7,
;
DESTSPLIT = TOTAL all

destinations not modes


must be loaded into array
previously calculated MW
output MW
; no scale (utility-based)

110

7/23/2010

XCHOICE,
ALTERNATIVES = free, toll,
DEMANDMW = 1,
COSTSMW = 2, 3,
ODEMANDMW = 4, 5,
SPLIT = TOTAL 0.2 free toll,
SPLITCOMP = 6,
STARTMW = 10

111

7/23/2010

Total

SOV

Car

NMT

HOV

Toll

PT
Auto

Walk

How are the utilities of upper level nests calculated?


By using the logsum of choices at the lower level
Transit Nest

Auto Nest

Logsum transit ln( eUwalktransit eUdrivetransit )

Logsum auto ln( eUdrivealone eUshared ride )


Uauto auto * Logsum auto

Utransit transit * Logsum transit

Probability of taking transit:

Ptransit

eUtransit
eUtransit eUauto
22
4

112

7/23/2010

Example

Nest/Sub-nest

Value

Transit

0.5000

Transit/Access

0.5000

Auto

1.0000

Auto/Shared Ride

1.0000

22
5

113

7/23/2010

; Destination followed by mode


XCHOICE,
; List choices
ALTERNATIVES = car pt,
; Base demand matrices
BASEDEMANDMW = 11,12,
;
DUTILSMW = 16,17,
ODEMANDMW = 21,22,
DESTSPLIT = TOTAL 0.5 dist,
SPLIT = distribution car pt,
STARTMW = 50

114

7/23/2010

Total

Walk /
Bike

Drive

Alone

Toll

Shared

Non-toll

Walk
access

Public
Transit

Bus

Rail

Drive
Access

Walk
access

Drive
access

115

7/23/2010

231

116

7/23/2010

23
3

117

7/23/2010

118

7/23/2010

Skimming

Assignment

119

7/23/2010

Home

Comparison of Single-Path
and Multi-Path Captures

A
C

B
D

Total
Cost

Captured
by SP?

Captured
by MP?

A-B-E-H

60

Yes

Yes

A-B-D-F-H

83

No

Maybe

A-C-G-H

69

No

Maybe

Path

H
Each colored line represents a distinct route
Work

Black lines are connectors

120

7/23/2010

121

7/23/2010

Transit
System

Access
Modes

Sub-Modes

# Path
Types

Daily

Walk, drive

Transit

Peak,
off-peak

Walk, parkride, dropoff

Bus, Rail

12 (or 8)

AM peak, Walk, parkElaborate off-peak, ride, dropPM peak off

Bus, LRT,
HRT, CRT

36 (or
24)

Simple
Typical

Periods

Path types

Walk-transit; Drive-transit
Peak walk-bus; Peak walkrail; Off-peak walk-bus; Offpeak walk-rail; etc.
Peak walk-bus; Peak walkLRT; etc.

Transit

Bus

Rail

122

7/23/2010

Cost

Definition

Access/Egress time

Time taken to access the transit stop from the origin zone or to
the destination zone

Initial wait time

Time spent in waiting for the first transit boarding

Boarding penalty

Penalty applied at each boarding of a transit service

In-vehicle time

Time spent traveling in a transit vehicle

Transfer walk time

Time taken to transfer from one transit service to the another

Transfer wait time

Time spent in waiting for the transfer transit to arrive

Transfer penalty

Transit mode to transit mode interchange penalty

123

7/23/2010

Parameter

Description

BESTPATHONLY If true, enacts the single-path path-builder


FREQBYMODE
RECOSTMAX

If true, PT will combine headways on same-mode services.


If false, PT will combine headways across modes. Only
applicable when BESTPATHONLY=T
Maximum weighted time for any path to be either
considered the minimum cost path or enumerated

SERVICEMODEL Determines the type of service model to be used


VALUEOFTIME

Converts fares into generalized cost

Example
T (mandatory)
T
300
FREQUENCY
(mandatory)
6

Refer CUBE documentation for details

124

7/23/2010

Parameter

Description

Example

DELMODE

List of transit modes that are removed from


consideration during pathbuilding

Project mode for bus


paths; None for project
paths

DELACCESSMODE

List of access modes that are removed from


consideration during pathbuilding

2 (for walk path),


1 (for auto path)

DELEGRESSMODE

List of egress modes that are removed from


consideration during pathbuilding

2 (for all paths)

Refer CUBE documentation for details

Parameter

Description

Example

FARESYSTEM

Number of the faresystem that applies to the modes or


operators

FARESYSTEM=1
OPERATOR=1

IWAITCURVE

Wait curve (specified in system data file) number to


be used to calculate the initial wait time

XWAITCURVE

Wait curve (specified in system data file) number to


be used to calculate the transfer wait time

WAITFACTOR

A node specific wait time weighting factor

2.00

Refer CUBE documentation for details

125

7/23/2010

Mode

Example

Walk access modes

2.00

Drive access modes

1.50

All transit modes (except commuter rail)

1.00

Commuter rail

0.80

;Runfactors (Example)
RUNFACTOR[1]
= 2.00
RUNFACTOR[2]
= 1.00
RUNFACTOR[3]
= 1.50
RUNFACTOR[4]
= 2.00
RUNFACTOR[5]
= 2.00
RUNFACTOR[101] = 1.00
RUNFACTOR[102] = 1.00
RUNFACTOR[103] = 1.00
RUNFACTOR[104] = 1.00
RUNFACTOR[105] = 1.00

Note: A RUNFACTOR of 0.80 is applied only in the cities


where commuter rail already exists; all other areas should
use a factor of 1.00

Parameter

Description

Example

Upper limit on the number of transfers on the minimumcost all-or-nothing route

MAXFERS

Upper limit on the number of transfers allowed

XFERPEN

Transit mode-to-transit mode transfer penalty, in minutes

XFERFACTOR

Transit mode-to-transit mode weighting factor for transfer


penalties specified by XFERPEN

1.0

XFERCONST

Transit mode-to-transit mode constant that is added to


the weighted transfer penalty obtained from XFERPEN

AONMAXFERS

Refer CUBE documentation for details

126

7/23/2010

;Global Settings
BESTPATHONLY=T
MAXFERS=5
SERVICEMODEL=FREQUENCY
RECOSTMAX=300.0
FREQBYMODE=T
;Modes Settings
; DELMODE =
DELACCESSMODE = 2
DELEGRESSMODE = 2
;Fare and Wait Times
FARESYSTEM=1, OPERATOR=1
FARESYSTEM=2, OPERATOR=2
IWAITCURVE=1, NODES=654-99999
XWAITCURVE=2, NODES=654-99999
WAITFACTOR=2.00, NODES=654-99999

;Runfactors
RUNFACTOR[1]
= 2.00
RUNFACTOR[2]
= 1.00
RUNFACTOR[3]
= 2.00
RUNFACTOR[101] = 1.00
RUNFACTOR[102] = 1.00
RUNFACTOR[103] = 1.00
;Boarding and Transfer Penalties
BRDPEN[101] = 2.0
BRDPEN[102] = 2.0
BRDPEN[103] = 2.0
XFERPEN=0.00, from=21-200, to=21-200
XFERFACTOR=1.00, from=21-200,to=21-200
XFERCONST=5.0, from=21-200, to=21-200

Contd

127

7/23/2010

Total

Walk /
Bike

Drive

Alone

Toll

Shared

Non-toll

Walk
access

Public
Transit

Bus

Rail

Drive
Access

Walk
access

Drive
access

Modify this step

inside SKIMS group

128

7/23/2010

129

7/23/2010

130

7/23/2010

131

7/23/2010

132

7/23/2010

;;<<PT>><<SYSTEM>>;;
MODE NUMBER=2 LONGNAME="AUTO CONNECTORS" NAME="AUTOCON"
MODE NUMBER=101 LONGNAME="LOCAL BUS" NAME="LB"
MODE NUMBER=102 LONGNAME="PREM BUS" NAME="PREM"

OPERATOR NUMBER=1 LONGNAME="LOCAL BUS" NAME="LB"


OPERATOR NUMBER=3 LONGNAME="PREMIUM BUS" NAME="PB"
OPERATOR NUMBER=5 LONGNAME="RAIL" NAME="RL"
WAITCRVDEF NUMBER=1 LONGNAME="InitialWait" NAME="InitWait" ,
CURVE=0-2,4-2,60-30,180-30
WAITCRVDEF NUMBER=2 LONGNAME="TransferWait" NAME="XferWait" ,
CURVE=0-2,4-2,60-30,160-30
WAITCRVDEF NUMBER=3 LONGNAME="No Minimum Time" NAME="IWAIT2" ,
CURVE=0-0,4-2,60-30,160-30

Keywords

Example

NUMBER

NAME

AUTOCON

LONGNAME

AUTO ACCESS
CONNECTORS

Description
Unique numeric identifier
Unique string identifier (max 14 characters)
Second unique string identifier (max 40 characters)

133

7/23/2010

; Mode numbers
MODE NUMBER 1
MODE NUMBER 2
MODE NUMBER 3
MODE NUMBER 101
MODE NUMBER 102
MODE NUMBER 103
MODE NUMBER 104
MODE NUMBER 105

LONGNAME=WALK CONNECTOR
LONGNAME=DRIVE CONNECTOR
LONGNAME=TRANSFER CONNECTOR
LONGNAME=LOCAL EXPRESS BUS
LONGNAME=BRT BUS
LONGNAME=STREETCAR
LONGNAME=COMMUTER RAIL
LONGNAME=NEW MODE

NAME=WALKCON
NAME=DRCON
NAME=XFERCON
NAME=BUS
NAME=BRT
NAME=STREETCAR
NAME=COMRAIL
NAME=NEWMODE

134

7/23/2010

Keywords

Example

NUMBER

NAME

LB

LONGNAME

Local Buses

Description
Unique numeric identifier of the operator
Unique string identifier (14 characters)
Second unique string identifier (40 characters)

If a transit agency or authority offers a single fare system,


then the OPERATOR should be defined for that transit
agency or authority

If a transit agency or authority offers multiple fare


systems, then an OPERATOR should be defined for each
fare system offered by that agency or authority
Also, the summary reports produced by PT is generated for
each mode and operator

135

7/23/2010

; Operator numbers
OPERATOR NUMBER=1 LONGNAME="LOCAL BUSES"
OPERATOR NUMBER=2 LONGNAME="EXPRESS BUSES"
OPERATOR NUMBER=3 LONGNAME="BRT BUSES"
OPERATOR NUMBER=4 LONGNAME="RAIL"
OPERATOR NUMBER=5 LONGNAME="COMMUTER RAIL"
OPERATOR NUMBER=6 LONGNAME="TROLLEY"
OPERATOR NUMBER=7 LONGNAME=CIRCULATOR"

NAME="LB"
NAME="EB"
NAME="BRT"
NAME="RL"
NAME="CR"
NAME="TRL"
NAME=CIR

136

7/23/2010

Keywords

Example

NUMBER

NAME

InitWait

LONGNAME
CURVE

Description
Unique numeric identifier for a curve
Unique string identifier for a curve

Initial Wait Curve Second unique string identifier for a curve

List of XY pairs used to compute wait times

0-2, 30-15

CURVE = 0-2,4-2,60-30,180-30
Wait Time Curve
40

Wait time (minute)

35
30
25

Minimum wait time: 2 minutes


Maximum wait time: 30 minutes
Otherwise, wait time is half of
service headway

20
15
10
5
0
0

10

20

30

40

50

60

70

80

90

100

Headw ay (minute)

137

7/23/2010

138

7/23/2010

Keywords
NUMBER

Description

Values

Fare System number

--

NAME

14-character description

--

LONGNAME

40-character description

--

STRUCTURE

Type of fare system

FREE (free), FLAT (flat),


ACCUMULATE (zone-based)

Determine how the fare is produced for


consecutive legs using the same fare system

Not used if free; CUMULATIVE for


flat and zone-based

SAME
IBOARDFARE

Initial boarding fare

FAREFROMFS

Transfer fare when transferring from other


FARESYSTEMs

FAREZONES

Keyword

Name of the node variable in the network file


containing the nodes fare zone number

Not used if free; Appropriate fares


for flat & zone-based
NI.xxxxxx

Description

FLAT

Trip length is not relevant for this fare structure. Calculate fare from
IBOARDFARE and FAREFROMFS

DISTANCE

Trip length is in-vehicle distance, measured in user-specified units (e.g., miles)

HILOW

Trip length is the difference between the highest and lowest fare zones crossed

COUNT

Trip length is a measure of the number of fare zones crossed

FROMTO

Trip length is an attribute of the boarding and alighting fare zones

ACCUMULATE

Trip length is the number of fare zones crossed. Each fare zone has an
associated fare which is accumulated as the zone is traversed. This differs from
COUNT, where the fare is calculated at the end of the leg or trip from the total
number of fare zones traversed

FREE

Defines a NULL fare system; lines with such systems give free rides

139

7/23/2010

FARESYSTEM NUMBER=1 LONGNAME="Local Buses" NAME="LB" STRUCTURE=FLAT SAME=CUMULATIVE,


IBOARDFARE=1.50,FAREFROMFS=0.00,0.00,0.00,0.00,1.50,0.75
FARESYSTEM NUMBER=2 LONGNAME="Express Buses" NAME="EB" STRUCTURE=FLAT SAME=CUMULATIVE,
IBOARDFARE=2.00,FAREFROMFS=0.50,0.00,0.00,0.00,2.00,1.25
FARESYSTEM NUMBER=3 LONGNAME=BRT Buses" NAME=BRT" STRUCTURE=FLAT SAME=CUMULATIVE,
IBOARDFARE=2.50,FAREFROMFS=1.00,0.50,0.00,0.00,2.50,1.75
FARESYSTEM NUMBER=4 LONGNAME="Commuter Rail" NAME="Rail" STRUCTURE=FLAT SAME=CUMULATIVE,
IBOARDFARE=3.00,FAREFROMFS=1.50,1.00,0.50,0.00,3.00,2.25

FARESYSTEM NUMBER=5 LONGNAME=Streetcar" NAME=STR" STRUCTURE=FREE


FARESYSTEM NUMBER=6 LONGNAME=Circulator" NAME=CIR" STRUCTURE=FLAT SAME=CUMULATIVE,
IBOARDFARE=0.75,FAREFROMFS=0.00,0.00,0.00,0.00,0.75,0.00

Mapping in this example is done


using OPERATOR numbers assigned
to each LINE

140

7/23/2010

Source: http://www.tri-rail.com/

Zone 6

Zone 5
Zone 4
Number of
zones traveled

One-way fare

$2.00

$3.00

$4.00

$4.50

$5.00

$5.50

Zone 3
Zone 2

Zone 1

Example (Tri-Rail):
FARESYSTEM NUMBER=6 LONGNAME="TRIRAIL ZONE", NAME="TRIZONE",
STRUCTURE=COUNT, FAREZONES=NI.FAREZONENUMBER,
FARETABLE=1-2.00, 2-3.00,3-4.00, 4-4.50, 5-5.00, 6-5.50

141

7/23/2010

FARESYSTEM NUMBER=1, NAME=Trip Based,STRUCTURE=FROMTO,


FAREMATRIX=FMI.1.RailFare, FAREZONES=NI.FAREZONE

FARESYSTEM NUMBER=2 LONGNAME="ALL" NAME="ALL,STRUCTURE="DISTANCE",


SAME=SEPARATE, FARETABLE=2.5,0.50, 4,0.60, 10,1.20, 15,1.50
INTERPOLATE=T

In the faretable defined above, a person traveling 8 miles pays a $1.00 fare.

142

7/23/2010

143

7/23/2010

144

7/23/2010

145

7/23/2010

146

7/23/2010

Pi

Ci

where the C represent costs of paths. The choice process is applied


to whole paths (rather than being applied at the point where discrete
paths divide, as in the headway based evaluation process)

147

7/23/2010

Stop node 1

Stop node 2

Stop node 3

Stop node 4

148

7/23/2010

REval Route(s) from Origin 1 to Destination 2

N:
1 Mode WaitA TimeA Actual B/XPen Percvd
->
106 100
- 13.23 13.23
- 13.23
->
141
2
8.67 10.00 31.90
0.00 23.32
->
141
0.00 31.90
- 23.32
->
124
2
8.67
5.00 45.56
0.00 28.40
->
124
0.00 45.56
- 28.40
->
162
2
8.67 10.00 64.23
0.00 38.49
->
2 100
9.59 73.82
- 48.08
Mode TimeA
Dist IWaitA XWaitA
2 25.00 23.31
8.67 17.33
100 22.82
1.52
Probability=0.7242

Dist
0.88
7.04
0.00
9.43
0.00
6.84
0.64

Total
0.88
7.92
7.92
17.35
17.35
24.19
24.83

Lines(weight)

N:
1 Mode WaitA TimeA Actual B/XPen Percvd
->
106 100
- 13.23 13.23
- 13.23
->
162
2
8.67 30.00 51.90
0.00 43.32
->
2 100
9.59 61.49
- 52.91
Mode TimeA
Dist IWaitA XWaitA
2 30.00 19.80
8.67
0.00
100 22.82
1.52
Probability=0.2758

Dist
0.88
19.80
0.64

Total
0.88
20.68
21.32

Lines(weight)

Autobus 1(1.000)
Autobus 2(1.000)
Autobus 3(1.000)

Autobus 1(1.000)

Stop node 1

Stop node 2

Stop node 3

Stop node 4

149

7/23/2010

REval Route(s) from Origin 1 to Destination 2


N:
1 Mode WaitA TimeA Actual B/XPen Percvd
->
106 100
- 13.23 13.23
- 13.23
->
162
2
0.00 30.00 43.23
0.00 43.23
->
2 100
9.59 52.82
- 52.82
Mode TimeA
Dist IWaitA XWaitA
2 30.00 19.80
0.00
0.00
100 22.82
1.52
Probability=0.0475

Dist
0.88
19.80
0.64

Total
0.88
20.68
21.32

N:
1 Mode WaitA TimeA Actual B/XPen Percvd
->
106 100
- 13.23 13.23
- 13.23
->
141
2
0.00
8.00 21.23
0.00 21.23
->
141
0.00 21.23
- 21.23
->
124
2
2.00
5.00 28.23
0.00 28.23
->
124
0.00 28.23
- 28.23
->
162
2
5.00
5.00 38.23
0.00 38.23
->
2 100
9.59 47.82
- 47.82
Mode TimeA
Dist IWaitA XWaitA
2 18.00 23.31
0.00
7.00
100 22.82
1.52
Probability=0.0525

Dist
0.88
7.04
0.00
9.43
0.00
6.84
0.64

Total
0.88
7.92
7.92
17.35
17.35
24.19
24.83

Dep

Arr

0600.0

0630.0

Lines

Dep

Arr

0600.0

0608.0

Autobus 1

0610.0

0615.0

Autobus 2

0620.0

0625.0

Autobus 3

Autobus 1

Lines

150

7/23/2010

REval Route(s) from Origin 1 to Destination 2


N:
1 Mode WaitA TimeA Actual B/XPen Percvd
->
106 100
- 13.23 13.23
- 13.23
->
162
2
0.00 30.00 43.23
0.00 43.23
->
2 100
9.59 52.82
- 52.82
Mode TimeA
Dist IWaitA XWaitA
2 30.00 19.80
0.00
0.00
100 22.82
1.52
Probability=0.0523

Dist
0.88
19.80
0.64

Total
0.88
20.68
21.32

N:
1 Mode WaitA TimeA Actual B/XPen Percvd
->
106 100
- 13.23 13.23
- 13.23
->
141
2
0.00
8.00 21.23
0.00 21.23
->
141
0.00 21.23
- 21.23
->
124
2
7.00
5.00 33.23
0.00 33.23
->
124
0.00 33.23
- 33.23
->
162
2 10.00
5.00 48.23
0.00 48.23
->
2 100
9.59 57.82
- 57.82
Mode TimeA
Dist IWaitA XWaitA
2 18.00 23.31
0.00 17.00
100 22.82
1.52
Probability=0.0477

Dist
0.88
7.04
0.00
9.43
0.00
6.84
0.64

Total
0.88
7.92
7.92
17.35
17.35
24.19
24.83

Dep

Arr

0600.0

0630.0

Lines
Autobus 1

Dep

Arr

0600.0

0608.0

Lines
Autobus 1

0615.0

0620.0

Autobus 2

0630.0

0635.0

Autobus 3

151

7/23/2010

REval Route(s) from Origin 1 to Destination 2


N:
1 Mode WaitA TimeA Actual B/XPen Percvd
->
106 100
- 13.23 13.23
- 13.23
->
141
2
0.00
8.00 21.23
0.00 21.23
->
141
0.00 21.23
- 21.23
->
124
2
2.00
5.00 28.23
0.00 28.23
->
124
0.00 28.23
- 28.23
->
162
2
5.00
5.00 38.23
0.00 38.23
->
2 100
9.59 47.82
- 47.82
Mode TimeA
Dist IWaitA XWaitA
2 18.00 23.31
0.00
7.00
100 22.82
1.52
Probability=0.0196

Dist
0.88
7.04
0.00
9.43
0.00
6.84
0.64

Total
0.88
7.92
7.92
17.35
17.35
24.19
24.83

N:
1 Mode WaitA TimeA Actual B/XPen Percvd
->
106 100
- 13.23 13.23
- 13.23
->
141
2
0.00
8.00 21.23
0.00 21.23
->
141
0.00 21.23
- 21.23
->
124
2
2.00
5.00 28.23
0.00 28.23
->
124
0.00 28.23
- 28.23
->
162
2
5.00
5.00 38.23
0.00 38.23
->
2 100
9.59 47.82
- 47.82
Mode TimeA
Dist IWaitA XWaitA
2 18.00 23.31
0.00
7.00
100 22.82
1.52
Probability=0.0196

Dist
0.88
7.04
0.00
9.43
0.00
6.84
0.64

Total
0.88
7.92
7.92
17.35
17.35
24.19
24.83

Dep

Arr

Lines

0600.0

0608.0

Autobus 1

0610.0

0615.0

Autobus 2

0620.0

0625.0

Autobus 3

Dep

Arr

0620.0

0628.0

Autobus 1

0630.0

0635.0

Autobus 2

0640.0

0645.0

Autobus 3

Lines

152

7/23/2010

REval Route(s) from Origin 1 to Destination 2



N:
1 Mode WaitA TimeA Actual B/XPen Percvd
->
106 100
- 13.23 13.23
- 13.23
->
162
2
0.00 20.00 33.23
0.00 33.23
->
2 100
9.59 42.82
- 42.82
Mode TimeA
Dist IWaitA XWaitA
2 20.00 19.80
0.00
0.00
100 22.82
1.52
Probability=0.1138

Dist
0.88
19.80
0.64

Total
0.88
20.68
21.32

N:
1 Mode WaitA TimeA Actual B/XPen Percvd
->
106 100
- 13.23 13.23
- 13.23
->
141
2
0.00 10.00 23.23
0.00 23.23
->
141
0.00 23.23
- 23.23
->
124
2
2.00
5.00 30.23
0.00 30.23
->
124
0.00 30.23
- 30.23
->
162
2
3.00
5.00 38.23
0.00 38.23
->
2 100
9.59 47.82
- 47.82
Mode TimeA
Dist IWaitA XWaitA
2 20.00 23.31
0.00
5.00
100 22.82
1.52
Probability=0.1019

Dist
0.88
7.04
0.00
9.43
0.00
6.84
0.64

Total
0.88
7.92
7.92
17.35
17.35
24.19
24.83

Dep

Arr

0800.0

0820.0

Lines
Autobus 1

Dep

Arr

0800.0

0810.0

Autobus 1

Lines

0812.0

0817.0

Autobus 2

0820.0

0825.0

Autobus 3

153

7/23/2010

FILEI NETI=HR0022_opk.DAT
PAR listinput = N
READ FILE = AE00BUS.LIN
READ FILE = FARE_TPP.LIN
READ FILE = HR00WALK.LIN

FILEI NETI=HR0022_opk.DAT
LINEI = AE00BUS_PT.LIN,
LIST=N
NTLEGI = HR00WALK.NTL
FAREI = FARE_PT.FAR
FACTORI = FACTOR.FAC
SYSTEMI = SYSTEM.PTS

154

7/23/2010

LINK NODES=4074-4080,
dist=95,speed=35
LINE, NAME=HRT73,MODE=1,
FREQ[1]=60,
FREQ[2]=60,
N=4144,4143,-4176

;LINK NODES=4074-4080,
dist=95,speed=35
LINE, NAME=HRT73,MODE=1,
HEADWAY[1]=60,
HEADWAY[2]=60,
N=4144,4143,-4176

FARE
XFARE[15]=150,125,50,75,4*0,
150,7*0
FARE
XFARE[16]=150,125,50,75,4*0,
150,7*0

;In FAREI
FARESYSTEM NUMBER=1,
STRUCTURE=FLAT,
IBOARDFARE=150,
FAREFROMFS=0,50,100,75,150,0

FARE
FARE
FARE
FARE
FARE

XFARE[1]=9*0
XFARE[2]=50,8*10
XFARE[3]=9*100
XFARE[4]=9*75
XFARE[5]=3*150,75,0,4*150

;In FACTORI
FARESYSTEM=1, MODE=1

155

7/23/2010

SUPPLINK N=59-2592
MODE=16 DIST=129
SPEED=3 ONEWAY=N

NT LEG=59-2592
MODE=16 DIST=129
SPEED=3 ONEWAY=N

mato = WBUS00OP.TEM
nodeo = WBUS00OP_node.DBF
linko = WBUS00OP_link.DBF
supporto =
WBUS00OP_supp.DAT
ONEWAY = N FIXED = Y

mato = WBUS00OP.TEM,
MO=1-11,
NAME=
RIDE_T,WAIT_T,WALK_T,FARE,
TRTB_T,PENT_T,TRTT_T,EXP_T,
DIST,BOARDS
neto = wbus00op.net
linko = wbus00op_link.dbf
ntlego = wbus00op_ntleg.dat,
NET=O
routeo = wbus00op.rte
REPORTO = wbus00op.prn

156

7/23/2010

PHASE1 HWYTIME = TRAN

TRANTIME=LI.TRAN

freqperiod = 2
walkspeed = 3.0
maxpathtime = 250
useruntime = Y

HDWAYPERIOD=2
;see GENERATE

ZONEACCESS generate=Y,
maxdist=10*75,
maxstops=10*6, mode=16
SELECT accessmodes = 16

PHASE=DATAPREP
GENERATE,
COST=LI.DISTANCE,
MAXCOST=10*75,
MAXNTLEGS=10*6,
NTLEGMODE=16
ENDPHASE

;in FACTORS:
RECOSTMAX=250

;In FACTORI:
DELACCESSMODE=15

157

7/23/2010

boardpen[2]=
5.3,6.9,7.6,8.2,8.6
iwaitfac[1] = 10 * 2.0
xwaitfac[1] = 10 * 2.0
modefac[1] = 3 * 1.0
modefac[4] = 1 * 1.5
modefac[5] = 1 * 1.0
modefac[6] = 1 * 1.5, 4 * 1.0
modefac[11] = 6 * 1.5
nox[16][16] = y

BRDPEN=5.3,6.9,7.6,8.2,8.6
WAITFACTOR=2.0, NODES=1481-8807
RUNFACTOR=3*1.0,1.5,1.0,1.5,
4*1.0,6*1.5

MATRICES NAME=
RIDE_T,WAIT_T,WALK_T,FARE,TRTB_T,PENT_T,
TRTT_T,EXP_T,DIST,BOARDS,
MW[1]=TIME(1,2,3,4,5,6,7,8,9,10),
MW[2]=IWAIT,
MW[3]=TIME(16),
MW[4]=XFARE,
MW[5]=TIME(1,5),
MW[6]=TIME(2),
MW[7]=TIME(3),
MW[8]=TIME(9),
MW[9]=DIST(0),
MW[10]=BOARDS,

PHASE=SKIMIJ
MW[1]=TIMEA(0,TMODES),
MW[2]=IWAITA(0),
MW[3]=TIMEA(0,16),
MW[4]=FAREA(0,TMODES),
MW[5]=TIMEA(0,1,5),
MW[6]=TIMEA(0,2),
MW[7]=TIMEA(0,3),
MW[8]=TIMEA(0,9),
MW[9]=DIST(0,ALLMODES),
MW[10]=BRDINGS(0,TMODES),

mw[12]=xwait(1),
mw[13]=xwait(2),
mw[14]=xwait(3),
mw[15]=xwait(9)

mw[11]=xwaitA(0)
ENDPHASE

158

7/23/2010

REPORT lines = Name,Mode


linestring = '*'
REPORT linevol = Y,
linesort = Y

REPORT LINES=T,
SORT=Name,Mode
REPORT LINEVOLS=T

318

159

7/23/2010

319

Cube Analyst - Matrix Optimization

Estimation and updating of trip matrices

Uses a maximum likelihood estimator


Explicit use of quality weights in the
estimation
Provides great control on the estimation
Represents the reality of observed data

Data types

Counts
Trip ends
Partial matrices

320

160

7/23/2010

161

7/23/2010

162

7/23/2010

163

7/23/2010

328

164

You might also like