00818743

Component

https://doi.org/10.3141/1752-14

http://scholar.google.com...keck&publication_year=2001

Transit assignment procedures need to reflect the constraints imposed by line routes and timetables. They require specific search algorithms that consider transfers between transit lines with their precise transfer times. Such an assignment procedure is presented for transit networks using a timetable-based search algorithm. In contrast to existing timetable-based search methods employing a shortest-path algorithm, the described procedure constructs connections using branch and bound techniques. This approach significantly reduces computing time, thus facilitating the use of timetable-based assignment for large networks. At the same time, it produces better results in cases where slow but cheap or direct connections compete with fast connections that are more expensive or require transfers.

This paper appears in Transportation Research Record No. 1752, Travel Patterns and Behavior; Effects of Communications Technology.

English

p. 100-107

2001

Transportation Research Record

0309072131

Figures (4) ; References (6) ; Tables (5)

Branch and bound algorithms; Public transit; Routes; Timetables; Transfers

Transit assignment

Finance; Highways; Operations and Traffic Management; Planning and Forecasting; Public Transportation

TRIS, TRB, ATRI

Oct 2 2001 12:00AM

• ASSESSING URBAN CONTEXT-INDUCED CHANGE IN INDIVIDUAL ACTIVITY TRAVEL PATTERNS: CASE STUDY OF NEW RAILWAY STATION
• ASSOCIATION RULES IN IDENTIFICATION OF SPATIAL-TEMPORAL PATTERNS IN MULTIDAY ACTIVITY DIARY DATA
• COEVOLUTIONARY APPROACH TO EXTRACTING AND PREDICTING LINKED SETS OF COMPLEX DECISION RULES FROM ACTIVITY DIARY DATA
• DIRECT FORECASTING OF FREEWAY CORRIDOR TRAVEL TIMES USING SPECTRAL BASIS NEURAL NETWORKS
• DRIVERS' ROUTE CHOICE RULES AND NETWORK BEHAVIOR: DO DRIVERS BECOME RATIONAL AND HOMOGENEOUS THROUGH LEARNING?
• DYNAMIC TRAFFIC ANALYSIS WITH STATIC DATA: GUIDELINES WITH APPLICATION TO PARIS
• ESTIMATING TIME-DEPENDENT ORIGIN-DESTINATION TRIP TABLES WITH TRIPS ORIGINATING IN MULTIPLE TIME SLICES
• EXPERIMENTS WITH COMPUTERIZED SELF-ADMINISTRATIVE ACTIVITY SURVEY
• INDUCTIVE LEARNING APPROACH TO EVOLUTIONARY DECISION PROCESSES IN ACTIVITY-SCHEDULING BEHAVIOR: THEORY AND NUMERICAL EXPERIMENTS
• MODELING AUTOMOBILE DEMAND AND DRIVER POPULATION IN PALESTINIAN TERRITORIES: SIMULTANEOUS-EQUATION ESTIMATION METHOD
• MODELING EFFECTS OF ANTICIPATED TIME PRESSURE ON EXECUTION OF ACTIVITY PROGRAMS
• MODELING ROUTE CHOICE BEHAVIOR WITH STOCHASTIC LEARNING AUTOMATA
• MULTILEVEL ANALYSIS OF ACTIVITY AND TRAVEL PATTERNS: ACCOUNTING FOR PERSON- AND HOUSEHOLD-SPECIFIC OBSERVED AND UNOBSERVED EFFECTS SIMULTANEOUSLY
• PATTERN RECOGNITION IN COMPLEX ACTIVITY TRAVEL PATTERNS: COMPARISON OF EUCLIDEAN DISTANCE, SIGNAL-PROCESSING THEORETICAL, AND MULTIDIMENSIONAL SEQUENCE ALIGNMENT METHODS
• REAL-TIME VARIABLE MESSAGE SIGN-BASED ROUTE GUIDANCE CONSISTENT WITH DRIVER BEHAVIOR
• SAMPLING ALTERNATIVES FROM COLOSSAL CHOICE SET: APPLICATION OF MARKOV CHAIN MONTE CARLO ALGORITHM
• STOCHASTIC USER EQUILIBRIUM FORMULATION FOR GENERALIZED NESTED LOGIT MODEL
• TELECOMMUTING IMPLICATIONS FOR TRAVEL BEHAVIOR: CASE STUDIES FROM MINNESOTA
• TRAVEL BEHAVIOR IMPLICATIONS OF INFORMATION AND COMMUNICATIONS TECHNOLOGY IN PUGET SOUND REGION
• WITHIN-HOUSEHOLD ALLOCATION OF TRAVEL: CASE OF UPPER AUSTRIA