TRANSPORTATION AND TRAFFIC THEORY
Related books Eds. HENSHER & BUTTON Handbooks in Transport 6-Volume Set TAYLOR Transportation and Traffic Theory in the 21 s t Century (ISTTT15) AXHAUSEN Travel Behaviour Research DOHERTY & LEE-GOSSELIN Integrated Land-Use and Transport Models GÄRLING etal. Theoretical Foundations of Travel Choice Modeling HENSHER Travel Behaviour Research: The Leading Edge MAHMASSANI Travel Behavior Research Opportunities and Applications Challenges STOPHER & STECHER Transport Survey Methods TANIGUCHI & THOMPSON Logistics Systems for Sustainable Cities TIMMERMANS Progress in Activity-Based Analysis
Related Journals Transportation Research Part A: Policy and Practice
Editor: Phil Goodwin
Transportation Research Part B: Methodological
Editor: Fred Mannering
Transportation Research Part C: Emerging Technologies
Editors: Steve Ritchie and Markos Papageorgiou
Transportation Research Part D: Transport and Environment
Editor: Ken Button
Transportation Research Part E: Logistics and Transportation Review
Editor: Wayne Talley
Transportation Research Part F: Traffic Psychology and Behaviour
Editors: Talib Rothengatter and John Groeger
Transport Policy
Editors: Moshe Ben-Akiva, Yoshitsugu Hayashi, John Preston & Peter Bonsall
For full details of all transportation titles published under the Elsevier imprint please go to: www.ElsevierSocialSciences.com/transport
TRANSPORTATION AND TRAFFIC THEORY FLOW, DYNAMICS AND HUMAN INTERACTION Proceedings of the 16th International Symposium on Transportation and Traffic Theory University of Maryland, College Park, Maryland, 19-21 July 2005
edited by
HANI S. MAHMASSANI University of Maryland, USA
Amsterdam - Boston - Heidelberg - London - New York - Oxford Paris - San Diego - San Francisco - Singapore - Sydney - Tokyo
ELSEVIER B.V. Sara Burgerhartstraat 25 P.O. Box 211, 1000 AE Amsterdam, The Netherlands
ELSEVIER Inc. 525 B Street Suite 1900, San Diego CA 92101-4495, USA
ELSEVIER Ltd. The Boulevard Langford Lane, Kidlington, Oxford OX51GB, UK
ELSEVIER Ltd. 84 Theobalds Road London WC1X 8RR UK
© 2005 Elsevier Ltd. All rights reserved. This work is protected under copyright by Elsevier Ltd., and the following terms and conditions apply to its use: Photocopying Single photocopies of single chapters may be made for personal use as allowed by national copyright laws. Permission of the Publisher and payment of a fee is required for all other photocopying, including multiple or systematic copying, copying for advertising or promotional purposes, resale, and all forms of document delivery. Special rates are available for educational institutions that wish to make photocopies for non-profit educational classroom use. Permissions may be sought directly from Elsevier's Rights Department in Oxford, UK: phone (+44) 1865 843830, fax (+44) 1865 853333, e-mail:
[email protected]. Requests may also be completed on-line via the Elsevier homepage (http://www.elsevier.com/locate/permissions). In the USA, users may clear permissions and make payments through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA; phone: (+1) (978) 7508400, fax: (+1) (978) 7504744, and in the UK through the Copyright Licensing Agency Rapid Clearance Service (CLARCS), 90 Tottenham Court Road, London W1P 0LP, UK; phone: (+44) 20 7631 5555; fax: (+44) 20 7631 5500. Other countries may have a local reprographic rights agency for payments. Derivative Works Tables of contents may be reproduced for internal circulation, but permission of the Publisher is required for external resale or distribution of such material. Permission of the Publisher is required for all other derivative works, including compilations and translations. Electronic Storage or Usage Permission of the Publisher is required to store or use electronically any material contained in this work, including any chapter or part of a chapter. Except as outlined above, no part of this work may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without prior written permission of the Publisher. Address permissions requests to: Elsevier's Rights Department, at the fax and e-mail addresses noted above. Notice No responsibility is assumed by the Publisher for any injury and/or damage to persons or property as a matter of products liability, negligence or otherwise, or from any use or operation of any methods, products, instructions or ideas contained in the material herein. Because of rapid advances in the medical sciences, in particular, independent verification of diagnoses and drug dosages should be made.
First edition 2005 Library of Congress Cataloging in Publication Data A catalog record is available from the Library of Congress. British Library Cataloguing in Publication Data A catalogue record is available from the British Library.
ISBN: 0-08-044680-9 @ The paper used in this publication meets the requirements of ANSI/NISO Z39.48-1992 (Permanence of Paper). Printed in The Netherlands.
Contents Preface
ix
International Advisory Committee
xi
Contributors
xii
Bilevel optimisation of prices in a variety of transportation models
1
MJ Smith A sequential experimental approach for analyzing second-best road pricing with unknown demand functions H Yang, WXu and Q Meng
23
Highway space inventory control system D Teodorovic and P Edara
43
Path size and overlap in multi-modal transport networks SHoogendoorn-Lanser, R van Nes andP HL Bovy
63
Pedestrian dynamics and evacuation: empirical results and design solutions D Helbing, A Johanssen and L Buzna
85
An empircal assessment of traffic operations C Chen, P Varaiya and J Kwon
105
Reliability of freeway traffic flow: a stochastic concept of capacity WBrilon , J Geistefeldt and M Regler
125
A critical comparison of the kinematic-wave model with observational data K Nagel and P Nelson
145
Average velocity of waves propagating through congested freeway traffic B Coifman and Y Wang
165
Microscopic three-phase traffic theory and its applications for freeway traffic control B Kerner
181
A behavioural approach to instability, stop and go waves, wide jams and capacity drop C Tampere, S Hoogendoorn and B van Arem
205
Controlling traffic breakdowns R Ktihne and R Mahnke
229
vi Contents Parameter estimation and analysis of car-following models S Hoogendoorn and S Ossen
245
Modeling Impatience of drivers in passing maneuvers M Pollatschek and A Polus
267
A simulation model for motorway merging behaviour J Wang, R Liu and F Montgomery
281
Freeway ramp merging process observed in congested traffic: lag vehicle acceleration model M Sarvi, A Ceder and M Kuwahara
303
A first-order macroscopic traffic flow model for mixed traffic including moving bottleneck effects S Chanut
323
A variational formulation of kinematic waves: bottleneck properties and examples C Daganzo and M Menendez
345
First-order macroscopic traffic flow models: intersection modeling, network modeling J P Lebacque and M Khoshyaran
365
Real-time estimation of travel times on signalized arterials A Skabardonis and N Geroliminis
387
Calibration and validation of dynamic traffic assignment systems R Balakrishna, H Koutsopoulos and M Ben-Akiva
407
Non-equilibrium dynamic traffic assignment W Y Szeto and H K Lo
427
Precision of predicted travel time, the responses of travellers, and satisfaction in the travel experience SKikuchi, S Mangalpally and A Gupta
447
Behavioral dynamics in activity participation, travel, and information and communications technology K Goulias and T G Kim
467
Modeling the joint labor-commute engagement decisions of San Francisco Bay Area residents
487
DTOry and P L Mokhtarian
Contents vii A model of daily time use allocation using fractional logit methodology X Ye and R Pendyala
507
Efficient estimation of nested logit models using choice-based samples L A Garrow, F S Koppelman and B L Nelson
525
Functional approximations to alternative-specific constants in time-period choice-modelling S Hess, J W Polak and M Bierlaire
545
Project-based activity scheduling for person agents
565
EJ Miller Modelling commercial vehicle empty trips: theory and application JHolguin-Veras, JCZorrilla andE Thorson
585
Rationality and heterogeneity in taxi driver decisions: application of a stochastic-process model of taxi behavior R Kitamura and T Yoshii
609
A rolling-horizon approach to the optimal dispatching of taxis
629
M GHBell, KI Wong and A J Nicholson Capacitated arc routing problem with extensions H Qiao and A Haghani
649
User-equilibrium route set analysis of a large road network H Bar-Gera and D Boyce
673
Comparison of static maximum likelihood origin-destination formulations H Rakha, H Paramahamsan and M van Aerde
693
A time-dependent activity and travel choice model with multiple parking options 717
HJHuang, Z CLi, WHKLam andS C Wong Doubly dynamic equilibrium distribution approximation model for dynamic traffic assignment N C Balijepalli and D P Watling
741
A combined model of housing location and traffic equilibrium problems in a continuous transportation system H W Ho and S C Wong
761
This Page is intentionally Left Blank
Preface For many researchers and scholars in the inter-disciplinary field of traffic science and transportation system modelling, the book publication that contains the Proceedings of the International Symposium on Transportation and Traffic Theory (ISTTT) series provides a much-awaited field-defining milestone, featuring some of the best and most promising thinking and theoretical developments in the field. The ISTTT series is the main gathering for the world's transportation and traffic theorists, and those who are interested in contributing to or gaining a deep understanding of traffic and transportation phenomena in order to develop effective approaches to plan, design and manage these systems. The Symposium deals primarily with the scientific and fundamental aspects of transportation and traffic phenomena, including identification and characterization of previously undocumented or underappreciated phenomena, formulation, observation and testing of new models of and new perspectives on known phenomena, as well as extension, refinement, testing or critique of existing theories and models of known phenomena. This volume contains contributions selected for the 16th International Symposium on Transportation and Traffic Theory (ISTTT), held at the University of Maryland in College Park, Maryland in the USA on July 19 - 21, 2005. The 39 contributions selected for this volume do not represent all the papers accepted for inclusion in the ISTTT program. In view of the high level of interest and very high quality of submissions from all over the world, and the limited number that could be included in this volume, several additional papers were accepted for following a very demanding and rigorous refereeing process. These will be published through regular Journal channels. All papers in this volume passed a three-stage review process. In a first stage, nearly 200 submitted extended abstracts were reviewed by up to four members of the scientific and organizing committees, resulting in invitations to 88 authors to submit full papers. The second stage entailed the review of each of the 84 submitted full papers by two to five internationally recognized referees. Based on that process, 45 revised papers were submitted for final evaluation and review; 39 of these are included in the present volume, each reflecting the high quality, excellence, rigour and innovation that are the defining qualities of this series. The ISTTT 16 comes at a time when the field is experiencing a major renewal, reflected by the entry of a large number of new scientists from a variety of disciplines, and the mutual coexistence of a growing number of theoretical perspectives and modelling cultures. It is also a time when theories and models developed over the past 40 years are finding their way into professional practice through computer software packages to a greater extent than at any time in the past. The present volume reflects some of the most vibrant work taking place in the world's leading institutes on the science of traffic and transportation, and presents a view of the breadth of topics and richness of influences that are permeating the field.
x Preface The contributions included in this volume reflect a range of topics that pertain to modelling traffic and transportation processes as complex systems. Several themes are reflected in this collection, though perhaps none as strongly and visibly as the overarching desire to understand and characterise the fundamental processes that govern the behaviour and performance of our transportation systems. At the root of these characterizations is the recognition that traffic and transportation systems are a collective expression of individual human decisions. Modelling traffic and transportation systems is about modelling human interaction, amongst individuals as well as with the surrounding transportation infrastructure, controls and environment. The number of contributions in this volume that deal with some aspect of human behaviour, whether as travellers, drivers, passengers, operators, or regulators, is relatively greater than in past Symposia. This is reflective of great strides being made in our community of scholars in developing theories and mathematical representations of these phenomena, and in the combination of theoretical development with observation through novel measurement techniques. The underlying themes and approaches traditionally used in different functional areas, such as planning or operations, or transport modes, such as freight or passenger modes, appear to be converging towards greater focus on individual decisionmaking and human interaction in the context of flow processes, network dynamics and spatial systems. Special appreciation is extended to the members of the International Advisory Committee and the local organizing committee in the review and selection process of the papers included in this volume. Particular gratitude is owed to the referees who contributed considerable time and effort to the review process. Only through their dedicated and thoughtful effort can the ISTTT maintain its high standards of intellectual excellence. I am grateful to Ms. Elisabeth Fernandez-Kimmel for her most able assistance and tremendous effort in the final preparation of the camera-ready document. Hani S. Mahmassani March 2005
International Advisory Committee C F Daganzo
University of California, Berkeley, USA (Convenor)
R E Allsop
University College, London, UK
M G H Bell
Imperial College, London, UK
P H L Bovy
Delft University of Technology, The Netherlands
W Brilon
Ruhr-University, Bochum, Germany
A Ceder
Technion-Israel Institute of Technology, Haifa, Israel
N H Gartner
University of Massachusetts, Lowell, USA
R Kitamura
Kyoto University, Japan
R Kiihne
German Aerospace Center, Berlin, Germany
M Kuwahara
University of Tokyo, Japan
WLam
Hong Kong Polytechnic University, China
J-B Lesort
Institut National de Recherche sur les Transports et leur Securite, Lyon, France
H.S. Mahmassani
University of Maryland, College Park, USA
V V Silyanov
Moscow State Automobile and Road Technical University, Russia
M A P Taylor
University of South Australia, Adelaide, Australia
M Tracz
Cracow University of Technology, Poland
S C Wirasinghe
University of Calgary, Canada
Honorary members E Hauer
Canada
H Keller
Germany
M Koshi
Japan
W Leutzbach
Germany
H-G Retzko
Germany
D I Robertson
United Kingdom
S Yagar
Canada
Contributors R Balakrishna N C Balijepalli H Bar-Gera M G H Bell M Ben-Akiva M Bierlalre P H L Bovy D Boyce W Brilon L Buzna A Ceder S Chanut CChen B Coifman
C Daganzo P Edara
L A Garrow J Geistefeldt N Geroliminis K Goulias A Gupta A Haghani D Helbing SHess HWHo
Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA Institute for Transport Studies, University of Leeds, UK Ben-Gurion University of the Negev, Be'er Sheva, Israel Centre for Transport Studies, Imperial College London, UK Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA Institute of Mathematics, Ecole Polytechnique Federate de Lausanne, Switzerland Faculty of Civil Engineering and Geosciences, Transport & Planning, Delft University of Technology, The Netherlands Northwestern University Evanston, Illinois, USA Institute for Transportation and Traffic Engineering, RuhrUniversity, Bochum, Germany Department of Transportation Networks, University of Zilina, Slovakia Transportation Research Institute, Technion-Israel Institute of Technology, Haifa, Israel Laboratoire Ingenierie Circulation Transport LICIT (INRETS - ENTPE), Cedex, France University of California, Berkeley, USA Department of Civil and Environmental Engineering and Geodetic Science, Ohio State University, Columbus, Ohio, USA Institute of Transportation Studies, University of California, Berkeley, USA Charles E. Via Jr. Department of Civil and Environmental Engineering, Virginia Polytechnic Institute and State University, Falls Church, Virginia, USA Georgia Institute of Technology, Atlanta, Georgia, USA Institute for Transportation and Traffic Engineering, RuhrUniversity, Bochum, Germany Institute of Transportation Studies, University of California, Berkeley, USA University of California, Santa Barbara, USA University of Delaware, Newark, Delaware, USA Department of Civil and Environmental Engineering, University of Maryland, College Park, Maryland, USA Institute for Economics and Traffic, Dresden University of Technology, Dresden, Germany Centre for Transport Studies, Imperial College London, UK Department of Civil Engineering, The University of Hong Kong, China
Contributors
HWHo J Holguin-Veras S Hoogendoorn S Hoogendoorn-Lancer H J Huang A Johanssen B Kerner M Khoshyaran S Kikuchi TGKim R Kitamura
F S Koppelman H Koutsopoulos R Kiihne M Kuwahara JKwon W H K Lam J P Lebacque ZCLi RLiu HKLo R Mahnke S Mangalpally M Menendez Q Meng E J Miller P L Mokhtarian
xiii
Department of Civil Engineering, The University of Hong Kong, China Department of Civil and Environmental Engineering, Rensselaer Polytechnic Institute, Troy, New York, USA Faculty of Civil Engineering and Geosciences, Transport & Planning, Delft University of Technology, The Netherlands Faculty of Civil Engineering and Geosciences, Transport & Planning, Delft University of Technology, The Netherlands School of Management, Beijing University of Aeronautics and Astronautics, China Department of Physical Resource Theory, Chalmers University of Technology, Sweden Daimler Chrysler AG, Stuttgart, Germany ETC Economics Traffic Clinic, France University of Delaware, Newark, Delaware, USA The Pennsylvania State University, University Park, Pennsylvania, USA Department of Urban Management, Kyoto University, Kyoto, Japan, and Department of Civil and Environmental Engineering, University of California, Davis, USA Northwestern University Evanston, Illinois, USA Department of Civil Engineering, Northeastern University, Boston, Massachusetts, USA Institute of Transportation Research, German Aerospace Center, Berlin, Germany Institute of Industrial Science, University of Tokyo, Japan Statistics Department, California State University, Hayward, California, USA Department of Civil and Structural Engineering, Hong Kong Polytechnic University, China INRETS-GRETIA2, France School of Management, Beijing University of Aeronautics and Astronautics, China Institute for Transport Studies, University of Leeds, UK Department of Civil Engineering, Hong Kong University of Science and Technology, Hong Kong, China Uiversity of Rostock, Institute of Physics, Rostock, Germany University of Delaware, Newark, Delaware, USA Institute of Transportation Studies, University of California, Berkeley, USA Department of Civil Engineering, The National University of Singapore, Singapore Department of Civil Engineering, University of Toronto, Toronto, Canada University of California at Davis, Davis, USA
xiv Contributors F Montgomery K Nagel B L Nelson P Nelson A J Nicholson DTOry S Ossen H Paramahamsan R Pendyala J W Polak M Pollatschek A Polus HQiao HRakha M Regler M Sarvi A Skabardonis M J Smith W Y Szeto C Tampere D Teodorovic
E Thorson M van Aerde B van Arem R van Nes P Varaiya
Institute for Transport Studies, University of Leeds, UK Institute for Land and Sea Transport Systems, Technical University of Berlin, Berlin, Germany Northwestern University Evanston, Illinois, USA Dept of Computer Science, Texas A&M University, College Station, Texas, USA Deparment of Civil Engineering, University of Canterbury, New Zealand University of California at Davis, Davis, USA Faculty of Civil Engineering and Geosciences, Transport & Planning, Delft University of Technology, The Netherlands Charles Via Jr. Dept. of Civil and Environmental Engineering, Virginia Tech, Blacksburg, Virginia, USA Department of Civil and Environmental Engineering, University of South Florida, Tampa, Florida, USA Centre for Transport Studies, Imperial College London, UK Department of Industrial Engineering and Management, Technion-Israel Institute of Technology, Haifa, Israel Department of Civil and environmental Engineering, Technion-Israel Institute of Technology, Haifa, Israel The Robert H. Smith School of Business, University of Maryland, College Park, Maryland, USA Charles Via Jr. Dept. of Civil and Environmental Engineering, Virginia Tech, Blacksburg, Virginia, USA Institute for Transportation and Traffic Engineering, RuhrUniversity, Bochum, Germany Department of Civil Engineering, Monash University, Victoria, Australia Institute of Transportation Studies, University of California, Berkeley, USA Department of Mathematics, University of York, UK Department of Civil, Structural, and Environmental Engineering, Trinity College, University of Dublin, Ireland Department of Traffic and Infrastructure, Katholieke Universiteit, Leuven, Belgium Charles E. Via Jr. Department of Civil and Environmental Engineering, Virginia Polytechnic Institute and State University, Falls Church, Virginia, USA Department of Civil and Environmental Engineering, Rensselaer Polytechnic Institute, Troy, New York, USA Posthumously TNO Inro, Department of Traffic and Transport and University of Twente Faculty of Civil Engineering and Geosciences, Transport & Planning, Delft University of Technology, The Netherlands University of California, Berkeley, USA
Contributors xv J Wang Y Wang D P Watling K I Wong S C Wong W Xu H Yang X Ye T Yoshii J C Zorrilla
Institute for Transport Studies, University of Leeds, UK Department of Electrical and Computer Engineering, Ohio State University, Columbus, Ohio, USA Institute for Transport Studies, University of Leeds, UK Centre for Transport Studies, Imperial College London, UK Department of Civil Engineering, The University of Hong Kong, China Department of Civil Engineering, The Hong Kong University of Science & Technology, Hong Kong, China Department of Civil Engineering, The Hong Kong University of Science & Technology, Hong Kong, China Department of Civil and Environmental Engineering, University of South Florida, Tampa, Florida, USA Department of Urban Management, Kyoto University, Kyoto, Japan Department of Civil and Environmental Engineering, Rensselaer Polytechnic Institute, Troy, New York, USA
This Page is intentionally Left Blank
1
BILEVEL OPTIMISATION OF PRICES IN A VARIETY OF TRANSPORTATION MODELS MJ Smith, Department of Mathematics, University of York, United Kingdom
INTRODUCTION The primary equilibrium model in this paper is similar to that suggested by Aashtiani and Magnanti (1983). This model combines the standard "user equilibrium" route-choice principle stated by Wardrop (1952) and a demand for travel between each OD pair which may vary with the costs of travel between the various OD pairs. There are many other equilibrium models. See for example: Beckmann (1956), Evans (1976), Gartner (1980), Bar Gera (2002) and Bar Gera and Boyce (2003). Optimising prices and signal controls within equilibrium models The need to optimise controls within equilibrium models is clear; as Beckmann often pointed out, control changes have a knock-on effect as users play their own games while the controller is playing his. The basic optimisation idea in this paper is intended to be a really quite simple approach to the problem; building directly upon the "half-space projection" direction developed in a series of papers: Smith et al (1997, 1998a, b), Clegg et al (2001) and Clegg and Smith (1998, 2001). We extend this previous work and also show how these methods apply to a range of different models. Fletcher and Leyffer (2000) and Rodrigues and Monteiro (2004) both consider descent methods which have some similarity with the simultaneous descent method outlined here. Using the simultaneous descent algorithm here the approach to a stationary point is typically via points which are not themselves approximate equilibria, so that the optimisation and the equilibration move in parallel and the need to compute a sequence of approximate equilibria is avoided.
2 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Abdulaal and Leblanc (1979), Tan, Gershwin and Athans (1979), Marcotte (1983, 1986), Fisk (1984), Tobin and Friesz (1988), Davis (1994), Yang and Yagar (1994), Yang (1996a, b, c), Chiou (1997), Clune et al (1999), Patriksson and Rockafellar (2002) and Clark and Watling (2002) have all sought to solve bilevel problems. Migdalas (1995) provides an excellent survey of the area. Bilevel problems in a wider context have been studied by for example Gauvin and Savard (1994), Luo et al (1996) and Outrata and Zowe (1998). The need to optimise signal controls subject to equilibrium within an equilibrium transportation model was pointed out in an early paper by Allsop (1974). In this paper we begin by considering optimisation within our primary model and then show that the same ideas work in several other models. Finally we give a general model embracing all of them. THE BASIC EQUILIBRIUM MODEL, MODEL 0 The model, model 0, presented here is the base or initial model considered in this paper. The main variables In model 0 we suppose given a network with K OD pairs, that OD pair ij is joined by Ny routes and so the total number of routes is N = SijNij. The main variables are as follows: Xjjr = the flow along the r* route joining OD pair ij (in vehicles per minute, say); X = the route flow vector comprising all the Xyr; Yy = the cost of travel between OD pair ij (in minutes per vehicle, say); and Y = the cost vector comprising all the Yy. Flows are in (flow per unit time) units and costs are in (time per unit of flow) units; so that a flow times a cost is dimensionless. Let 0N denote the zero N-vector, +coN denote the N-vector with infinite co-ordinates. Then we put [0N, +ooN) = [0, +oo)N and [0K, +ooK) = [0, +oo)K. Cost functions and demand functions We suppose given two functions; the cost function C(.) and the demand function D(.). Here Cjjr(X) is the cost of traversing the rth route joining OD pair ij when the flow vector is X > 0 and Dy(Y) is the total flow between OD pair ij when the OD cost vector is Y where Y > 0. We suppose that the cost function C(.) is defined throughout [0N, +ooN) and that the demand function D(.) is defined throughout [0K, +ooK). Thus including domains and co-domains, our two given functions are: C: [0N, +ooN) -^ [0, +ooN) and D: [0K, +ooK) [0K, +ooK). The functions T and S We define the two functions T:[0N, +<x>N) * [0K, +ooK) and S:[0K, +°oK) -> [0N, +°oN) as follows. For each ij and each ijr: Tij(X) = ZrXijr for all X e [0N, +ooN) and S1]r(Y) = Yy for all Y e [0K, +ooK). Tjj(X) is the total flow from i to j and Syr(Y) spreads each cost Yy over all routes joining i to j .
Bilevel optimisation of prices in a variety of transportation models 3 Assumptions: positivity, non-negativity, boundedness, monotonicity, smoothness We suppose that: C(X) > 0 for all X e [0N, +ooN) and D(Y) > 0 for all Ye [0K, +ooK). D is bounded and C is bounded on bounded sets. C and -D are both monotone. C and D are differentiable and their derivatives are continuous. C is monotone means that: [C(X') - C(X2)]-(X'- X2) > 0 for all X1 e [0N, +ooN) and X2 e [0N, +ooN). It is easy to show that if C and - D are monotone then (C(X) - S(Y), T(X) - D(Y)) is also a monotone function of (X, Y) e [0N, +ooN) x [0K, +ooK).
EQUILIBRIUM CONDITIONS AND SEARCH DIRECTION Suppose given a (flow-vector, cost-vector) pair (X, Y) in which all Xyr > 0 and all Yjj > 0. Then (X, Y) will be called an equilibrium if (X, Y) s [0N, +ooN) x [0K, +ooK), for each ijr the cost Cijr(X) of traversing the rth joining OD pair ij equals Yjj, and for each ij the demand Djj(Y) generated by the cost vector Y equals the total flow Tjj(X) = ZrXjjr actually occurring from i to j . So in this case (X, Y) is a variable demand equilibrium pair if and only if (X, Y) e [0N, +coN) x[0K,+ooK), Yjj - Cijr(X) = 0 for all ijr; and Dij(Y) - Tjj(X) = 0 for all ij. (1) The equilibrium equations (1) may be written in vector form: (S(Y) - C(X), D(Y) - T(X)) = 0. Here we are assuming initially that at equilibrium all Xjjr > 0 and all Yjj > 0. To relax this initial assumption and so to allow the possibility that a listed route may have a high cost and zero flow at equilibrium we revise (1) to introduce a partial complementarity condition. The revised equilibrium condition is as follows. For each ijr: Yy - Cijr(X) < 0 and Yy - Cijr(X) < 0 implies Xijr = 0; and Dij(Y)-Tij(X) = 0. (2) The set of equilibria, or solutions to (2), will be denoted by E. Throughout this paper we assume that this set is non-empty. The feasible set F and the objective function V Suppose given upper bounds ViUXy,- and !4UYy for Xyr and Yjj at equilibria; so that all equilibria lie inside ViF and so well inside F where F = [0N, UX] x [0K, UY] = n ijr [0, UXij,] x riijtO, UYy] c [0N, +roN) x [0, +ooK). This ensures that the set of equilibria E is well inside F. We do not here consider the problem of proving existence of a non-empty set of equilibria, and nor do we consider the specification of the set F. Some results concerning the existence of UXjjr, UY;J and F are given in Smith (2005). Given the set F, consider the objective function V: F -> R+ where, for all (X, Y) e F:
4 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Ljr{Xijr2[Cijr(X) - Y y ] + 2 + (UXijr- XijO^Yij - Cijr(X)]+2} +Lj{Yij2[Tij(X) - Dij(Y)]+2+ (UYrYij)2[Dij(Y) - T,j(X)]+2}. Here y+ = max{y, 0} for all real numbers y. It is easy to show that, provided the set of all equilibria is a subset of !4F then the set of zeros of V in F is exactly the set of equilibria.
V(X, Y) =
To seek a zero of V and hence an equilibrium state, consider the following search direction A = (A1, A2) where the ijrth component of the flow search direction A'(X, Y) is for each ijr: A'i]r(X, Y) = (UXijr- Xijr)2[Y;j - Cijr(X)]+ - Xijr2[Cijr(X) - Y S ] + ; and the ijth component of the cost search direction A2(X, Y) is for each ij: A2ij(X,Y) = (UYi]-Yij)2[Dij(Y)-Tij(X)]+-Yij2[Tij(X)-Dij(Y)]+. The whole search direction A(X, Y) = (A'(X, Y), A2(X, Y)) for all (X, Y) e F. This is precisely the algorithm (D) direction, introduced in Smith (1984a, b), in this setting; applied with the function - (C(X) - S(Y), T(X) - D(Y)) on the set F = [0N, UX] x [0K, UY]. We are given that C and -D are both monotone and it follows that (C(X) - S(Y), T(X) - D(Y)) is a monotone function of (X, Y) on F. This is the fact which is critical to what follows. Since (C(X) - S(Y), T(X) - D(Y)) is a monotone continuously differentiable function of (X, Y) on F, it follows from Smith (1984a, b) that A(X, Y) is a descent direction for objective V at (X, Y) (unless V(X, Y) = 0 in which case (X, Y) is an equilibrium) and also that there is for each (X, Y) a positive number T\ such that (X, Y) + tA(X, Y) e F if (X, Y) e F and 0 < t < n. The set E of equilibria is under the present conditions also convex, since (C - S, T - D) is monotone. Since V is continuous the set E = {x; V(x) = 0} is also closed. Thus since we are assuming that E is non-empty, E is a closed convex set such that E c [0N, V2UX]x[0K, ViUY].
AN EQUILIBRATION METHOD Motivated by the previous section, we suppose that the following basic condition holds. BASIC CONDITION: There is a fixed set of N routes joining K OD pairs as above, C and -D are monotone and continuously differentiable, F = [0N, UX]x[0K, UY], and the set of equilibria is a non-empty subset of >/2F = [0N, y2UX]x[0K, '/2UY]. Any pair (X, Y) in F will be called feasible. In order to estimate an equilibrium (X, Y), we start anywhere in F and update (X, Y) as follows: (X1, Y1) is any feasible starting value for (X, Y) and following some rule or algorithm: (X1, Y1) ^ (X2, Y2) * (X3, Y3) ^ . For any feasible start point all succeeding pairs are also to be feasible.
Bilevel optimisation of prices in a variety of transportation models 5 Definition of convergence We make the following definition. The above infinite sequence {(Xn, Yn)} of feasible (X, Y) pairs in F converges if and only if (1) the equilibrium set E is nonempty and (2) the Euclidean distance between (X", Y") and the set E of equilibria tends to zero as n tends to infinity. We will agree that an algorithm converges if and only if for any start point (X1, Y1) which generates an infinite sequence then this infinite sequence converges. Steepness of descent Suppose now that our basic condition above holds. Then Smith (1984a, b) shows that (given the basic condition above) there is a continuous real-valued function G such that G(X,Y)>Oif(X,Y)eF\E; G(X, Y) = 0 if (X, Y) e E; and A(X, Y)-gradV(X, Y) < - G(X, Y) for all (X, Y) e F. This means that V is a Lyapunov function for the dynamical system: d((X(t), Y(t))/dt = A((X(t), Y(t)) for all t > 0, (X(0), Y(0)) = (X°, Y°) e F. It also means that the steepness of the descent of the Lyapunov function V at (X, Y), as (X, Y) follows A(X, Y), maybe estimated by G(X, Y). That is: dV(X(t), Y(t))/dt = gradV(X(t), Y(t)) A(X(t), Y(t)) < - G(X(t), Y(t)) for all t > 0. The projection Proj Given F, for each (X, Y) e RN+1C the projection Proj(X, Y) of (X, Y) onto the feasible set F is defined to be the point of F closest to (X, Y).
DYNAMIC ARMIJO-LIKE STEP LENGTHS Given that the basic condition holds we reduce V to zero by moving (X, Y) e F continually in direction A. For step length choice we follow a dynamic Armijo-like scheme very close to that described in Smith (1984b). For now we let z stand for (X, Y) and Zn stand for (Xn, Yn). A (zn, tn_i)-updating dynamic Armijo-like equilibration algorithm Here we suppose that if we are at iteration n; at a non-equilibrium (Xn, Y") = z,, where the search direction is A(Zn) and the step length actually used at Zn is un then our next z will be Zn+i = PrOJ(Zn + UnA(Zn))
where Proj denotes the projection onto F. The real number un > 0 will be called a used step length and tn > 0 will be called a step length. For the purposes of most of this section we will suppose that if u^ is a used step length then Proj(zn + UnA(z^)) = Zn + UnA(Zn).
6 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction That is we suppose that the projection operator does not actually do anything; so the boundary of the feasible set F is here having no effect. To determine un we specify a dynamic Armijo-like scheme based on a continuous function G such as that given above. To motivate the scheme, it is clear that if the step length t at z were very small then the change in V = V(z + tA(z)) - V(z) would be more negative than - 3/4tG(z). So the slope of V(z + tA(z)) against t would be at least as steep as - 3AG(z) for small t. We do not wish to have such small steps t as the reduction in V might be very small, by virtue of the small step size t. On the other hand if t is large the slope of V(z + tA(z)) against t can be no steeper than -%G(z) on average; for if the average gradient of V(z + tA(z)) against t were < - %G(z) for large t then V(z + tA(z)) would sometimes be < V(z) - VitG(z) and this would be negative for large t, which is impossible. (Of course, by its definition, V > 0 always.) We do not wish to have steps this large as the reduction in V might be very small, due to a shallow negative slope (or perhaps V may even increase, due to a positive slope). So we seek step lengths which give rise to slopes between - 3/4G(z) and - lAG{z). Such step lengths have an Armijo property and allow convergence to equilibrium to be shown. The dynamic Armijo (zn, tn_i)-updating equilibration algorithm To be specific, we start at an arbitrary z\ e F and to = 1. This 0th or initial step length to is fairly arbitrary, but it must be positive. If we are at a current non-equilibrium point Z j e F , and the previous possible step length was tn_i, then we are to update Zn and tn-i (for n > 1) according to some fairly simple rules as follows. Firstly, zn is kept fixed and tn.i is halved to obtain: tn_i, (i4)tn.i, (/4)2tn-i, . . . . , (V2)ptn-i, where the halving ceases as soon as: V[z^ + (MOViAfe)] - V(zn) < - (l/8)(I/2)ptn.,G(zn) for the first time, p = 0 is allowed here; it may be that Vfc, + t^Afe)] - V(Zn) < - (l/8)tn.1G(Zn) already. The halving surely ceases by definition of G as Zn is a non-equilibrium. Then: let un = (Vy'tn-i for this p (this is the used step length at zn) and let Zn+i = Zn + UnA(Zn).
Finally update tn_i as follows: if V f e + unA(zn)] - V(zn) < -3/4UnG(Zn) put tn = 2u n ; if -3/4UnG(zn) < V[zn + unA(zn)] - V(Zn) < -1/4UnG(zn), put tn = u n ; and i f - V ^ G f e ) < V[z» + unA(zn)] - V(zn) < - (l/8)u n G(z n ) put tn ='/2un. These are three mutually exclusive possibilities and they together exhaust all eventualities since, by choice of un = ('/iytn-ijVtzn + unA(Zn)] - V(z,,) > - (1/8)^0(2,,) is not possible.
Clearly not all tn are in fact used to move z. The used step lengths are the un. It is clear that V[zn + unA(zn)] - V(zn) < - (l/SKGfe) for all used step lengths un. (Stop when V(zT1) is less than some preassigned positive number.)
Bilevel optimisation of prices in a variety of transportation models 7
CONVERGENCE TO EQUILIBRIUM Suppose that the basic condition holds. For any starting point zi e F and with an initial "previous" step length to = 1 we suppose that the algorithm specified above generates an infinite trajectory: z\, Zi, Z3,.. ., z,,, . . . . and an infinite sequence to, ti, Xi, \-$,. .., tn, . . . . of possible step lengths. We assume that these sequences are infinite: so we never actually hit the equilibrium set E. (If the sequence hits an equilibrium we simply stop.) To prove convergence we use proof by contradiction. Suppose that {z,^ tn-i} is an infinite sequence generated by our algorithm and that {zj does not converge to the equilibrium set E = {z e F; V(z) = 0}. Then, since F is closed and bounded, {Zn} must have a non-equilibrium limit point. Let w e F be such a non-equilibrium limit point of the sequence {zn}. Then we use the following lemma proved in Smith (2005). Lemma. Let the sequence {(z,,, tn_i)} be derived using the algorithm above so Zn+i = z,, + unAn(zn), let w e intF, let w be a non-equilibrium so that V(w) > 0 and suppose that w is a limit point of {z,,}. Then, under our assumptions, there is a suffix i(w) such that V(ZJ(W)) < V(w). This lemma shows (since V(Zn) decreases) that w cannot in fact be a limit point of the sequence {z,,}. It follows that the sequence {zj has no non-equilibrium limit points. Hence, since F is closed and bounded, {zn} converges to the set of equilibria.
OPTIMISING PRICES Now we suppose that there is a specified smooth function Z which we here regard as a measure of total disbenefit. We seek to minimise Z at an equilibrium by charging prices for traversing certain arcs or routes in the network, thus influencing the equilibrium traffic distribution. If Z itself depends on the prices charged then charges will also influence Z directly. We suppose throughout that Z is a continuously differentiable and non-negative function of the route-flow vector X, the OD cost vector Y and the new route-price vector P. Adding a price vector P Suppose that route ijr is (possibly) to be subject to a charge Pjjr and that the vector P of all possible route prices P;jr will be confined to some polyhedral closed bounded set Fcontroi of feasible control vectors. In this case the vector (X, Y, P) will now be called a user-equilibrium if (X, Y) e R+N+K, P e Fcontroi, and for all ijr, Yjj - Cijr(X) - Pijr< 0 and Yy - C1]r(X) - Pijr < 0 implies Xijr = 0, and Dij(Y) - Ty(X) = 0. (5) To optimise, as before with equilibration, we need a bounded set of (X, Y) pairs. So our basic condition will now be enhanced to allow for the set of controls. We now assume that the following control-enhanced condition holds. CONTROL-ENHANCED BASIC CONDITION: There is a fixed set of N routes joining K OD pairs as above,
8
Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
C and -D are monotone and continuously differentiable, F = [0 N , UX]x[0 K , UY], and for all fixed P e F control , the set of equilibria is a non-empty subset of [0 N , !/ 2 UX]x[0 K , '/ 2 UY]. The previous V and A will now involve P. Now for all (X, Y, P) e FxF contro i: V(X, Y, P) = L ]r {Xi jr 2 [P, ]r + C ijr (X) - Y S] ] + 2 + (UX1]r- X ^ f Y s - (P1]r + C 1]r (X))] + 2 } + LjJY/tTijCX) - Dij(Y)]+2 + (UY1J-Y1J)2[Dij(Y) - Tij(X)] + 2 }, AV(X, Y , P) = (UX ljr - Xi,-r)2[Yij - CPijr + C i]r (X))] + - X ijr 2 [(P ijr + C ijr (X)) - Yjj]+, A2,j(X, Y, P) = (UYtJ -Ys)2[DgCY) - T i] (X)] + - Yg2[Tij(X) - D y (Y)] + , and
A(X, Y, P) = (A'(X, Y, P), A2(X, Y, P)).
The previous equilibrium constraint (X, Y) e F and V(X, Y) = 0 will now be written (allowing for the possible prices): (X, Y, P) e FxFCOTtrol and V(X, Y, P) = 0. We will also write: H = FxFcontroi- Finally we suppose that all the Nc functions h; are linear and let H = {(X, Y, P); hi(X, Y, P) < 0 for i = 1,2, 3 , . . . , Nc}.
A constraint qualification and new notation Suppose that (X, Y, P) e H is not an equilibrium so that V(X, Y, P) > 0. It follows that for this (X, Y, P), A(X, Y, P) is a feasible descent direction for V with P fixed and hence that: ProjF[-grad(x, Y) V(X, Y, P)] * 0 if V(X, Y, P) > 0. Here only (X, Y) varies in F and P is fixed in Fcontroi. It follows at once that: ProjH[-grad(x, Y, P) V(X, Y, P)] * 0 if V(X, Y, P) > 0. Here (X, Y, P) varies in H. Replacing (X, Y, P) by just x, the equilibrium condition (X, Y, P) e H = FxFcontrol and V(X, Y, P) = 0 becomes: x s H and V(x) = 0. Also (6) above may now be written: ProjH[-grad V(x)] * 0 if V(x) > 0.
(6)
(7)
This may be thought of as a constraint qualification applying (for any positive e) to the set EE={xeH;V(x)<s}. Condition (7) implies that if x is any point in the set Es such that V(x) = s and hj(x) = 0 for i = 1, 2, 3, . . . , k and no others then there is a direction 8 = ProJH[-grad V(x)] such that
Bilevel optimisation of prices in a variety of transportation models 9 S-descV(x) > 0 and 5-deschj(x) > 0 for i = 1, 2, 3, . . . , k. That is: there is a feasible descent direction for V on the edge of any Ee provided s > 0. Now the proposed optimisation algorithm, where (X1, Y1, P1) is any starting value for (X, Y, P)inHand(X 1 , Y1, P1) ^ (X2, Y2, P2) ^ (X3, Y3, P3) ^ , becomes: x1 is any starting 1 2 3 . value for x in H and x -^ x -> x A simple simultaneous descent direction (for x in the interior of H) We suppose that we wish to minimise Z(X, Y, P) = Z(x) subject to V(X, Y, P) = V(x) < s so that we need to optimise V and Z simultaneously in some way. In this paper we let x lie in the interior of H. We also need our control-enhanced basic condition above. We make the further initial basic assumption that gradZ(x) ^ 0 for all x e H. Now, under our control-enhanced basic conditions, V(x) > 0 implies gradV(x) ^ 0. So we may now let (for x e H and V(x) > 0): descV(x) = - grad V(x)/||grad V(x)||, descZ(x) = - gradZ(x)/||gradZ(x)|| and desc(Z, V)(x) = /2descZ(x) +'/2descV(x). (8) This direction (8), if non-zero, reduces V and Z simultaneously. In any case this direction is never an ascent direction, for either V or Z. However descV is not defined where V = 0 and changes sharply in the vicinity of a point at which V = 0. So it is natural to change this direction (8) slightly so that it is defined everywhere and is smoothly varying. This may be done by enlarging the equilibrium set E. We are led to put (where s > 0): Es = {x e H: 0 < V(x) < s} and for all x e H: A£(x) = [ 1 -V(x)/e]+descZ(x) + [V(x)/s]desc(Z, V)(x) + [V(x)/e-1 ]+descV(x). (9) Our general approach here is also similar that adopted in Clegg and Smith (2001). The present direction (9) with the present definition of the simultaneous descent direction desc(Z, V)(x) has been introduced so as to allow an effective step length selection procedure to be more easily designed. [Estimation of Ae(x) is made more simple by supposing that the cost and demand functions have symmetrical Jacobians.] For any x in the interior of H the zeros of As(x) coincide exactly with points x in EE at which Z is stationary; or those points in E£ for which there is no descent direction for Z which remains inside Ee. We will now show this. Optimality conditions for x in the interior of H
Definitions ofs-feasible descent and s-linear optimality (for x in the interior ofH) The vector u is an s-feasible Z-descent direction at x (in the interior of H) if and only if
10 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction u-[descZ(x)] > 0 and either V(x) < s or {V(x) = s and u-[descV(x)] > 0}. x* (in the interior of H) is s-linearly-optimal if and only if V(x*) < s and there is no s-feasible Z-descent direction at x*. s-linear-optimality conditions (in the interior ofH) In this section we give optimality conditions for any x in the interior of H. These results are particularly useful if H has been chosen correctly; so that at any e-linearly-optimal x = (X, Y, P) the upper and lower bounds on x = (X, Y, P) are not binding. For such x, in the interior of H, we let A6(x) be given by (9) above and show how this vector may be used to classify points x according to whether they are s-linearly-optimal or not. Observe that desc(Z, V)(x) = !/->descV(x) + V2descZ(x) (if non-zero) is a direction in which both V and Z decline; and is never a direction of increase for either V or Z. So if xeintH and !4descV(x) + V2descZ(x) is non-zero then x is not E-linearly-optimal and also Ae(x) reduces both V and Z. This is the crux. It follows from these conditions that, at least for x s intH, AE(x) = 0 if and only if x is slinearly-optimal. In detail, there are four mutually exclusive cases (still supposing that x is in the interior of H): 1. V(x)>s, 2. 0 < V(x) < s, 3. V(x) = s and desc(Z, V)(x) * 0, and 4. V(x) = s and desc(Z, V)(x) = 0. We show that x is not E-linearly-optimal in cases 1 - 3 and A s (x) ^ 0 then; and that, in case 4, x is E-linearly-optimal and also that in this case A£(x) = 0.
1. V(x)>s In this case x ? E E and also Ae(x) = [V(x)/s]desc(Z, V)(x) + [V(x)/s - l]descV(x) is non-zero as descV(x) is non-zero and desc(Z, V)(x) is never a direction in which V ascends. Of course x is not s-feasible and so is not E-linearly-optimal. Here following As(x) reduces V. 2. 0 < V(x) < s In this case x e Ee and Ae(x) = [V(x)/s]desc(Z, V)(x) + [1 - V(x)/s]descZ(x) is again non-zero as descZ(x) is non-zero and desc(Z, V)(x) is never a direction in which Z ascends. Here following As(x) reduces Z maintaining V < s. 3. V(x) = s and desc(Z, V)(x) * 0 In this case x e Ee and Ae(x) = desc(Z, V)(x) is non-zero and so is a simultaneous descent direction for both V and Z. Thus As(x) is an Efeasible Z-descent direction at x so x is not s-linearly-optimal. Here again following As(x) reduces Z maintaining V < s.
Bilevel optimisation of prices in a variety of transportation models 11 4, V(x) = s and desc(Z, V)(x) = 0 In this case also x e Es. Now desc(Z, V)(x) = 0 and so descV(x) = - descZ(x). Consider any Z-descent direction u. Then u-[descZ(x)] > 0 and so u-[descV(x)] = u-[- descZ(x)] < 0, and u is not an s-feasible direction at x. Thus there is no s-feasible Z-descent direction from x and also V(x) < s, so x is s-linearly-optimal. In this case As(x) = 0. Thus we have shown that (at least for x e intH) zeros of A8(x) coincide with points x e Es at which there is no s-feasible descent direction for Z at x. Such points are e-linearly-optimal. We have also shown that A6(x) is an H-feasible descent direction for V if x is not in Es and that Ae(x) is an Es-feasible descent direction for Z if x is in EE and is not s-linearly-optimal. Thus, at least for x in the interior of H, As(x) is an excellent arbiter of s-linear-optimality at x; and for those x which are not s-linearly-optimal indicates a sound direction for moving x. An (xn, tn.i)-updating dynamic Armijo-like optimisation algorithm Here we change the previous equilibration algorithm to create an optimisation version. Now we suppose that if we are at iteration n; at a non-s-linearly-optimal xn e H where the search direction is Ae(xn) and the step length actually used at xn is un then our next x will be xn+i = Proj(xn + unA(xn)) where Proj now denotes projection onto H. Initially we suppose that if un is any used step length then Proj(xn + unAe(xn)) = xn + unAe(xn). That is, we suppose that the projection operator does not actually do anything; and so the boundary of the feasible set H is here having no effect. Let Gi(x) = - gradV(x)-Ae(x) and G2(x) = - gradZ(x)-Ae(x). These are continuous functions of x defined for all x e H. Both must be estimated using a two-point estimation where the second point lies in the direction A6 from the first. For our purposes here we specify a simple dynamic Armijo-like optimisation scheme based on the previous dynamic Armijo-like equilibration scheme but now taking account of the two objectives V and Z and the continuous functions Gi and G2 above, instead of just the previous V and the previous G. As before we update (xn, tn.i). To be specific, we start at an arbitrary xi e H and to = 1. Then if we are at a current non-s-linearly-optimal point xn and the previous possible step length was tn-i then we are to update xn and tn_i (for n > 1) as follows. To be most general we will, in this algorithm statement, let V[y] = V(ProjH(y)) for all y e RN + K. Let V(Xn) > e. In this case we follow the equilibration algorithm above with G replaced by Gi.
12
Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Let V(x^ < e. Firstly, x n is kept fixed and V i is halved to obtain the sequence tn_i, (54)tn.i, ('/2) 2 t n .i,...., (Vytn.i where the halving ceases as soon as: Z[x n + (MOV.AeCx,,)] - Z(x n ) < - (l/8)C/ 2 ) p t n .iG 2 (x n ) and V[x n + (>/2)ViAE(xn)] < s for the first time, p = 0 is allowed here as before. The halving surely ceases by definition of G2 and the Z-descent property of Ae maintaining V < s, because xn is not s-linearly-optimal. Then let un = (Viftn-i for this p (this is to be the used step length at x n ) and xn+i = x n + u n A s (x n ). Finally update tn_i as follows: if Z[x n + unAE(xn)] - Z(x n ) < -3/4UnG2(xn) put tn = 2u n ; if-3/4UnG2(xn) < Z[x n + unAs(xn)] - Z(x n ) < -1AunG2(xn), put tn = un; and if-'/4UnG2(xn) < Z[x n + unAE(xn)] - Z(x n ) < - (l/8)u n G 2 (x n ) put tn = Vox*. These are three mutually exclusive possibilities and they together exhaust all eventualities since, by choice of u n = (Vi)ptr,--\, Z[x n + unAE(xn)] - Z(x n ) > - (l/8)u n G 2 (x n ) is not possible. The algorithm is terminated as soon as V(x n ) - s and G 2 (x n ) are both less than preassigned tolerances.
CONVERGENCE TO A STATIONARY POINT We assume that our control-enhanced basic condition holds.
Convergence preliminaries For any starting point xi e H and with an initial step length to = 1 we suppose that the algorithm specified above generates an infinite trajectory: xi, x 2 , X 3 , . . . , xn> . . . . and an infinite sequence to, ti, t2, t 3 , . . . , tn, . . . . of possible step lengths. To prove convergence in this case we will use proof by contradiction. So we suppose that {xn} is a given infinite sequence generated by our algorithm which does not converge to the set O e of slinearly-optimal points. Then not all limit points of the sequence {xn} belong to OE and since H is closed and bounded there is a limit point w which is not in OE. Thus we now make the basic assumption that w is not s-linearly optimal and is also a limit point of {x n }. We will show that this leads to a contradiction. This will show that, in fact, if the sequence {xn} is generated by the algorithm then all limit points of the sequence {xn} are in OE and so (as H is closed and bounded) dist(xn, O6) -> 0 as n -> 00.
Theorem Let our control-enhanced basic condition hold. Let {xn} be the sequence above. Suppose that {xn} lies in the interior of H, let x* be the limit of any subsequence of the above sequence {xn}, and let x* e intH. Then x* is s-linearly-optimal. [Note: these interior conditions may well happen naturally, especially within stochastic assignment models.]
Bilevel optimisation of prices in a variety of transportation models 13 Proof Suppose that x* is the limit of a subsequence of the above sequence and that x* e intH. We will show that none of the following three alternatives in 7.4.2 can occur: (l)V(x*)>s, (2) 0 < V(x*) < s, (3) V(x*) = s and desc(Z, V)(x*) * 0. It will then follow that (4) above holds, and so x* is s-linearly optimal. Ruling out (I) This is essentially as before with equilibration. Ruling out (2) Suppose that (2) does hold or that V(x*) < s. Then Ae(x*) = [V(x*)/s]desc(Z, V)(x*) + [l-V(x*)/s]+descZ(x*) + [V(x*)/e-l]+descV(x*) = [V(x*)/s]desc(Z, V)(x*) + [l-V(x*)/s]descZ(x*) * 0. [l-V(x*)/s]descZ(x*) is a descent direction for Z at x* (and desc(Z, V)(x*) is never ascent) so [gradZ(x*)]-AE(x*) < 0. A small enhancement of the equilibration argument now works in this case too, but with Z instead of V, ruling out (2). Ruling out (3) Suppose that (3) does hold or that V(x*) = s and desc(Z, V)(x*) is non-zero. Then A6(x*) = [V(x*)/s]desc(Z, V)(x*) + [l-V(x*)/s]+descZ(x*) + [V(x*)/e-l]+descV(x*) = desc(Z, V)(x*) * 0, and this (being non-zero) is a descent direction for both V and Z at x*. An enhancement of the equilibration argument embodied in the lemma in section 6 above now works in this case too, but this argument must in this case be applied to both Z and V. See Smith (2005) for the details. This means that x* cannot be a limit point and rules out (3). It follows from the arguments above that if x* is any limit point in the interior of H, (4) above must hold or: V(x*) = s and desc(Z, V)(x*) = 0. So x* is e-linearly-optimal, as we have seen from the s-linearly-optimality conditions above in section 7.4.2. and the proof is complete. Allowing for the boundary of H The boundary of H may be taken account of by re-designing the search direction Ae. We change descV(x), descZ(x) and desc(Z, V)(x) for those x close to the boundary of H. The new versions will be called descHV(x), descHZ(x) and descH(Z, V)(x) and Ae will become AHe. We do not give these details here. They are given in Smith (2005).
14 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
APPLICATIONS TO DIFFERENT MODELS The basic structure exploited above is as follows: there is a function O, defined on the product set FxFcontroi. such that -
0 for all ijr. Xjjo is essentially a slack variable added in to model 0. The rigid demand problem represents the given variable demand problem and is driven by the original costs Cyr(X) and also the new opportunity cost Cij0(X) = D^EeiX^) = D"!(T - Xij0). It is easy to check that the whole new cost function C is monotone if the original C and the original -D are both monotone. Thus we may add a price vector as previously and utilise the same simultaneous descent algorithm to optimise this equilibrium model. Equilibrium model 2: extra route when the inverse demand function is unknown The set of "flows" in this model is the set of all (Xo, X, Y) such that (Xo, X) e {(Xo, X); Er Xijr = Ty for all ij and Xijr > 0 for all ijr} where in the sum here r runs over 0, 1, 2, 3 , . . . Ny, and Y s {Y; 0 < Yy < Uy}. A typical "route-flow" vector is now (Xo, X, Y) where: (Xo, X, Y) e {(Xo, X); Zr Xyr = Ty and Xijr > 0 for all ijr}x {Y; 0 < Yy < Uy}. With this set of feasible "flows" this "rigid demand" model is driven by "costs" as follows: Yy: this cost is felt by each element of the flow Xyo, Cyr(X): this cost is felt by each element of the flow Xyr for r = 1, 2, 3 , . . . , Ny, and Ty - Xyo - Dy(Y): this "cost" is felt by Yy. Assuming for simplicity that all the listed routes are used at equilibrium: Yy and all Cyr(X) are equal so that the flows Xyi,. . ., Xyuy have no incentive to change and also Y represents these OD costs; all Ty - Xyo - Dy(Y) = 0 and so Yy e [0, Uy] also has no incentive to change.
Bilevel optimisation of prices in a variety of transportation models
15
Thus at an interior equilibrium as specified above the Wardrop condition holds, and, since Y does then represent the OD costs experienced on all routes, Ty - Xij0 - Djj(Y) = 0 implies that the total ij flow Tij - Xjjo on the real network does equal Djj(Y) as it should. Monotonicity of C and -D now implies that: (Y, C(X), T - Xo - D(Y)) is a monotone function of (Xo, X, Y). This means that the optimisation method designed for model 0 also works here. This formulation may of course be used to restate, in a more complicated way, a given rigid demand problem; just "reformulate" the given rigid demand problem as a variable demand problem with a flat (zero slope) demand function by making Dy(Y) = a constant Djj for all Y. Equilibrium model 3: A responsive control policy in the Payne-Thompson model In order to study ramp control on freeways, Payne and Thompson (1975) introduced an equilibrium model with queueing delays at bottlenecks. In their model as long as a bottleneck is saturated the queueing delay at the bottleneck is independent of flow, and is represented by an independent non-negative variable determined by the equilibrium conditions; but if the bottleneck is unsaturated then the bottleneck delay must be zero. Bringing in the delays at bottlenecks in this way, as separate variables, allows ramp metering to be modelled sensibly. The "new" independent bottleneck delays are here added to costs arising from more standard cost-flow functions ca which may be thought of as applying to the rest of arc a. We here consider the Payne-Thompson model with capacity constraints and explicit queueing delays. We insert signal green-times as in Smith (1987). There can be great advantages in real traffic situations if the signal controls respond appropriately and automatically to the flows and delays on the network and traffic responsive signal control is so often utilised in practice. This extends the type of equilibrium model which can be considered. Certain subsets of arcs a comprise stages; any stage contains only arcs a terminating at a single node and all arcs in a given stage are given green if the stage is green. The kth stage at node i will be called stage ik. Let va sa ba Qik ca(-)
be the traffic flow along arc a, be the saturation flow at the exit of arc a (both in vehicles per minute), be the bottleneck delay at the exit of arc a (in minutes per vehicle), be the proportion of time stage ik is green and be the cost function for arc a (this excludes the bottleneck delay at the arc exit).
Then we make the following agreements: the flow along arc a — V a ( X ) — 2-those ijr passing through arc a X j j r ;
the non-bottleneck cost of travel along route ijr ~~ ^ i j r ( X ) — 2^arcs a which belong to route r joining OD pair ijC a (V a );
the bottleneck delay on route ijr
16 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
)
Z_iarcs a which belong to route numbered r joining OD pair ijD a ,
the "pressure" felt on stage ik by the responsive signal setting algorithm =
Jik(b) — Z^arcs a which belong to stage ik Sa^ai a n a
the green-time awarded to arc a Qa
^--stages ik which include arc a Wik-
The special responsive policy PO seeks to equalise the pressures felt on the various stages by suitable allocations of green-time. Thus if one stage has a higher value of J than another then PO will reallocate some green-time from the less pressurised stage to the more pressurised stage. At equilibrium all stages with a positive green time have equal values of J and stages with smaller values of J have no green-time. This equilibrium allocation of green-time is similar to the Wardrop allocation of traffic flow to routes and is given by the fourth and fifth condition in the equilibrium condition below. The grand equilibrium flow/cost/queue/green-time equilibrium condition comprises the following conditions. These must hold (for a fixed price vector P): for all nodes i, j , routes ijr, arcs a, and signal stages ik. Yy - Cijr(X) - Bljr(b) - Pijr Dy(Y) - Ty(X) va(X) - saqa Jik(b) - m;
< = < <
0 and Yy - Cijr(X) - Bljr(b) - Pijr < 0 implies Xljr = 0; 0; 0 and va(X) - saqa < 0 implies ba = 0; 0 and J;k(b) - m; < 0 implies that Qjk = 0; and
(All variables must also satisfy non-negativity constraints.) The top three conditions is the equilibrium model introduced by Payne and Thompson. The bottom two conditions represent the PO control-equilibrium condition. It is easy to check that, for each P, - (the left hand side above) is a monotone function of (X, Y, b, Q, m). It follows that the optimisation method described previously in model 0 may be utilised also in this rather different equilibrium setting. A practical observation We assume here that in practice the signal green-times respond automatically according to PO, rapidly. Then we imagine optimising the price vector P in a leisurely long-run fashion. This is to ensure that we feed travellers predictable price information for their travelling decisions. Model 4: a general model embracing the previous five models This model here is a rigid demand model which includes the previous four models as special cases. This may be optimised just as we illustrated with our basic model 0. Let F be the polyhedron of those route-flow vectors X which meet the given rigid demands Ty. Let C(X) be a monotone function of X. Then we may follow Smith (1984a, b, c): firstly let F = niJF1J where the vertices of Fy are the Ny all-or-nothing flows for OD pair ij and a typical one is, say, Wjjr. This Ny vector has T;J in the rth place and zero elsewhere.
Bilevel optimisation of prices in a variety of transportation models 17 We will agree here that for each X, Wljr(X) denotes the vector which has N co-ordinates and is defined as follows: Wijri.jv(X)
= = =
Ty if i1 = i, j ' = j and r' = r; 0 if i' = i,j'=j andr'^r; and Xj]r otherwise.
Thus Wljr(X) leaves all components of X with a different ij unchanged. But the ijr'-component of the vector Wljr(X) becomes equal to Ty (if r' = r) or zero (if r' *'r). Hence if are at X and move to X + Wljr(X) then the flow on all non-ij routes remains the same but the flow on the ij routes is all re-allocated to the single route ijr from i to j . The algorithm (D) search direction is now defined for each route-flow vector X in F by: A(X)
=
Si]r [-C(X)-( Wljr(X) - X)]+ (Wljr(X) - X).
The algorithm (D) objective function is V where, for each X in F: V(X) =
Sljr{[-C(X>(Wijr(X)-X)]+}2.
Smith (1984c) showed that provided the cost function C(-) is monotone and continuously differentiable then, away from equilibrium, this A(X) is a descent direction at X for this V. Using the Armijo-like step length procedure above we surely converge to an equilibrium. In this model we may now add control parameters and the previous optimisation theory works in this general case just as it did with model 0. This model is a generalisation which embraces the previous equilibrium models 0, 1, 2 and 3. The only difference is the precise form of the cost function and the polyhedron F. Model 5: Stochastic equilibrium models To create a model with logit route choice it is now natural to define a new cost function as follows: Cst0Chijr(X) = Cijr(X) + G^lnXr for all ijr. Then a solution to model 4 above will under natural conditions be a stochastic user-equilibrium on a given set of routes with given rigid demands Ty for each OD pair ij. This may be considered as a variable demand stochastic user equilibrium model, following the "extra-route" model 2 above, as suggested by Connors et. al. (2004, 2005). Maher et al. (1999) give a different stochastic model with variable demand. In this model the "interior to H" assumptions in this paper may be expected to hold naturally and so the model seems very suited to the "simultaneous descent" optimisation method here. CONCLUSION This paper has given a method for approximately solving a bilevel optimisation problem within a specific but fairly general equilibrium model (model 0). In this bilevel problem a stationary point of a given objective Z is sought subject to the flow pattern being an
18 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction approximate variable demand equilibrium. If the cost function and - (the demand function) are monotone and smooth and certain other natural conditions hold then the suggested algorithm produces a sequence which converges to the set of points which are approximate equilibrium (at which V < s) and also stationary for the given smooth objective function Z. The method utilises the very simple simultaneous descent direction obtained under certain (interior) conditions simply by bisecting the angle between -gradV and -gradZ. In this direction V and Z simultaneously decline. All directions in this paper, including the simultaneous descent direction, may be modified close to the boundary of the polyhedral feasible region F and this modification allows the approach to work also when the feasibility constraints on the polyhedron F are active during the optimisation process or at a limit point. See Smith (2005) for the details. Finally the paper has shown that the same method will be applicable to a variety of formulations of the variable demand equilibrium model, including one where there is an responsive control system. Of course the optimisation problem here is non-convex so a variety of start points should be taken and the optimisation procedure followed from each.
ACKNOWLEDGEMENT Much of the material central to this paper was presented in the keynote presentation of the "Behaviour hi Networks Symposium", University of Seoul, South Korea, June, 2004.
REFERENCES Aashtiani H and Magnanti T (1983) Equilibrium on a congested transport network. SIAM Journal of Algebraic and Discrete Methods, 2, 213 - 216. Abdulaal M and Leblanc L (1979) Continuous network design problems. Transportation Research, 13B, 19-32. Allsop R E (1974) Some possibilities for using traffic control to influence trip distribution and route choice, Proceedings of the 7th International Symposium on Transportation and Traffic Theory, 345 - 374. Bar-Gera, H (2002) Origin-based algorithms for the traffic assignment problem. Transportation Science, 36, (4), 398-417. Bar-Gera, H and Boyce D (2003) Origin-based algorithms for combined travel forecasting models. Transportation Science, 37B, (5), 405 - 422. Beckmann M, McGuire C B and Winsten C B (1956), Studies in the Economics of Transportation. Yale University Press, New Haven, CT. Chiou S-W (1997) Optimisation of area traffic control subject to user equilibrium traffic assignment, Proceedings of the 25th European Transport Forum, Seminar F, Volume II, 53 - 64.
Bilevel optimisation of prices in a variety of transportation models 19 Clark S D and Watling D P (2002) Sensitivity analysis of the probit-based stochastic user equilibrium assignment model. Transportation Research, 36B, 617 - 635. Clegg J and Smith M J (1998) Bilevel optimisation of transportation networks, in Mathematics in Transport Planning and Control, the Proceedings of the Third International IMA Conference on Mathematics in Transport Planning and Control, Pergamon, 29 - 36. Clegg J, M J Smith, Y Xiang and R Yarrow (2001) Bilevel programming applied to optimising urban transportation. Transportation Research, B, 35, 41-70. Clegg J and Smith M J (2001) Cone projection versus half-space projection for the bilevel optimisation of transportation networks. Transportation Research, B, 35, 71 - 82. Clune, A, Smith M J and Xiang Y (1999), A Theoretical Basis for Implementation of a Quantitative Decision Support System - Using Bilevel Optimisation. Proceedings of the Fourteenth International Symposium on Transportation and Traffic Theory, Jerusalem (Editor: Avishai Ceder), Pergamon, 489 - 514. Connors R, Sumalee A and Watling D (2004) Understanding the variable demand probitbased network design problem. Paper presented at the Universities' Transport Study Group Meeting, University of Newcastle upon Tyne. Connors R, Sumalee A and Watling D (2005) Equitable Network Design. Presented at the Universities' Transport Study Group Meeting, University of the West of England, Bristol. Davis G A (1994) Exact Local Solution of the Continuous Network Design Problem via Stochastic User Equilibrium Assignment. Transportation Research, 28B, 61-75. Evans S P (1976) Derivation and Analysis of some Models for Combining Trip Distribution and Assignment, Transportation Research, 10(1), 37-57. Fisk C S (1984) Optimal signal controls on congested networks. Proceedings of the Ninth International Symposium on Transportation and Traffic Theory, Delft (Editors: J Volmuller and R Hammerslag), VNU Science Press, Utrecht, 197-216. Fletcher R and S Leyffer (2000) Nonlinear programming without a penalty function. University of Dundee Numerical Analysis report NA 171. Gartner N H (1980) Optimal traffic assignment with elastic demands: A review. Part II: Algorithmic approaches. Transportation Science, 14, 192 - 208. Gauvin J and Savard G (1994) The steepest descent direction for the nonlinear bilevel programming problem. Operations Research Letters, 15, 265 - 272. Luo Z Q, Pang J S and Ralph D (1996) Mathematical programs with equilibrium constraints, Cambridge University Press. Maher M J, Hughes P C and Kim K S (1999) New algorithms for the solution of the stochastic user equilibrium problem with elastic demand. Proceedings of the 14th International Symposium on Transportation and Traffic Theory, Jerusalem, Israel (Editor A Ceder). Marcotte P (1983) Network Optimisation with Continuous Control Parameters, Transportation Science, 17, 181-197. Marcotte P (1986) Network Design Problem with Congestion Effects: A Case of Bilevel Programming, Mathematical Programming, 34, 142-162.
20 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Migdalas A (1995) Bilevel Programming in Traffic Planning: Models, Methods and Challenge. Journal of Global Optimization, 7, 381 - 405. Murchland J D (1970) Road network traffic distribution in equilibrium, In Mathematical Models in the Social Sciences, II Oberwolfach, 1969, Anton Hain Verlag, Meisenheim am Glan., volume 8, 145-183. Outrata J and Zowe J (1995) A numerical approach to optimization problems with variational inequality constraints. Mathematical Programming 68, 105 - 130. Patriksson M and Rockafellar R T (2002), A Mathematical model and Descent Algorithm for Bilevel Traffic Management. Transportation Science 36, 271 - 291. Payne H J and W A Thompson (1975), Traffic assignment on transportation networks with capacity constraints and queueing. Paper presented at the 47th National ORSA/TLVIS North American Meeting. Available from the University of York. Rodrigues H S and M T Monteiro (2004) Solving mathematical programs with complementarity constraints (MPCC) with Nonlinear Solvers. Poster at the 12th FrenchGerman-Spanish Conference on Optimization, Avignon. Smith M J (1984a) A descent algorithm for solving a variety of monotone equilibrium problems, Proceedings of the Ninth International Symposium on Transportation and Traffic Theory, The Netherlands, VNU Science Press, Utrecht, 273-297. Smith M J (1984b) A Descent Method for Solving Monotone Variational Inequalities and Monotone Complementarity Problems. Journal of Optimization Theory and Applications, 44, 485 - 496. Smith M J (1987) Traffic control and traffic assignment in a signal-controlled network with queueing. Proceedings of the Tenth International Symposium on Transportation and Traffic Theory, MIT (Editors: N Gartner and N H M Wilson) 319 - 338. Smith M J, Xiang Y, and Yarrow R (1997) Bilevel optimisation of signal timings and road prices on urban road networks. Preprints of the IFAC/IFIP/IFORS Symposium, Crete, 628 - 633. Available from the University of York. Smith M J, Xiang Y, Yarrow R (1998a) Descent Methods of Calculating Locally Optimal Signal Controls and Prices in Multi-Modal and Dynamic Transportation Networks. Selected Proceedings of the 4th EURO Transportation Meeting, University of Newcastle, Editor: M G H Bell, 9 - 34. Smith M J, Xiang Y, Yarrow R and Ghali M O (1998b) Bilevel and Other modelling Approaches to Urban Traffic Management and Control. Paper presented at the 25th Birthday of the Centre de Reserche sur les Transports, University of Montreal (1996), and a chapter in the Proceedings, Equilibrium and Advanced Transportation Modelling, (Editors: Patrice Marcotte and Sang Nguyen) Kluwer Academic Publishers, Massachussetts, 283 - 325. Smith M J (2005) Simultaneous descent: some details. Available from the University of York. Tan H N, Gershwin S B and Athans M (1979) Hybrid optimization in urban transport networks. Laboratory for information and Decision Systems, Technical Report DOTTSC-RSPA-79-7; published by Massachusetts Institute of Technology, Cambridge Massachusetts, USA. Tobin R L and Friesz T L (1988) Sensitivity analysis for equilibrium network flow, Transportation Science, 22, 242 - 250.
Bilevel optimisation of prices in a variety of transportation models 21 Wardrop J G (1952) Some Theoretical Aspects of Road Traffic Research, Proceedings, Institution of Civil Engineers II, 1, 235-278. Yang H, and Yagar S (1994), Traffic assignment and traffic control in general freeway-arterial corridor systems. Transportation Research, 28B, 463 - 486. Yang H (1996a), Sensitivity analysis for queueing equilibrium network flow and application to traffic control. Mathematical and Computer Modelling, 22, 247 - 258. Yang H (1996b), Sensitivity analysis for the elastic-demand network equilibrium problem with applications, Transportation Research, 3 IB, 55 - 70. Yang H (1996c), Equilibrium network traffic signal setting under conditions of queueing and congestion. Applications of Advanced Technologies in transportation Engineering. Proceedings of the 4th International Conference (editors: Y J Stephanedes and F Filippi), American Society of Civil Engineers, 578 - 582.
This Page is intentionally Left Blank
2
A SEQUENTIAL EXPERIMENTAL APPROACH FOR ANALYZING SECONDBEST ROAD PRICING WITH UNKNOWN DEMAND FUNCTIONS Hai Yang and Wei Xu, Department of Civil Engineering, The Hong Kong University of Science & Technology, Hong Kong, P. R. China; and QiangMeng, Department of Civil Engineering, The National University of Singapore, Singapore
INTRODUCTION Road pricing as a way to reduce traffic congestion and raise revenues to fund transportation improvements has received substantial added interest in recent years. Practical implementation has been progressing rapidly; for instance, electronic road pricing schemes have been proposed and implemented worldwide such as in Hong Kong, Singapore, California, and recently in London. With availability of new pricing technology and increasing concern over external cost, it is conceivable that there will be greater use of road pricing as an effective traffic management tool over the next few years. There has been a vast accumulation of literature that deals with the theoretical and empirical aspects, policy experiences, and environmental issues of road congestion and road pricing. In particular, the first-best and second-best congestion pricing have been widely discussed ranging from a single highway or bottleneck to a general transportation network. Moreover, there has been a great need for the development of practical and efficient methods for the actual design and implementation of road pricing. A fundamental question is how to choose the optimal congestion tolls in a simple yet practical manner. To this end the travel demand function tailored for road pricing is of special importance. Unfortunately, the demand curve is usually unknown and difficult to estimate in practice even with advanced transport modeling
24 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction techniques. To resolve this dilemma, Li (2002) proposed a practical iterative experimental procedure to derive the optimal congestion toll in the absence of a demand function and applied it to estimate the congestion toll for the area-licensing scheme and major expressways in Singapore. This enlightening implementation idea dates back to Vickrey (1993) and Downs (1993) who argued that, without necessarily using demand functions, congestion pricing could be implemented on a trial-and-error basis, based on observed behavior change. The basic logic behind the iterative implementation procedure can be summarized as follows (Li, 2002): With information on the underlying speed-flow relationship on the highway and the generalized cost, the optimal congestion toll occurs if and only if the intended speed level or traffic volume that is used to calculate the theoretical congestion toll is exactly equal to the observed speed level or traffic volume after the imposition of the toll. As a result, the exact knowledge of the demand function is not really necessary. The theoretical justification for finding the socially optimal level of congestion toll by Li (2002) is based on a given speedflow relationship and the true, but unknown downward-sloping demand curve. Thus, his method applies the simplified standard case of a homogenous traffic stream moving along a given uniform stretch of road such as an expressway connecting with a given entry and exit point. Li (2002) proposed to use a bisection method for iteratively adjusting the actual tolls, which is convergent and is in fact optimal within the standard demand-supply equilibrium framework for a single road. The above powerful idea of trial-and-error pricing implementation was further explored and extended to a general road network by Yang et al. (2004). hi the same spirit of Vickery (1993), Downs (1993) and Li (2002), Yang et al. (2004) proposed an iterative toll adjustment procedure based on the method of successive averages, and presented a rigorous theoretical proof of its convergence. However, the basic theory and method proposed by Li (2002) and Yang et al. (2004) are strictly valid only for the first-best pricing problem, which requires that a road user using each congested road should pay a toll equal to the difference between the marginal social cost and the marginal private cost. This perfect toll pattern could internalize the user externalities and thus achieve a socially optimal level of traffic flow by charging users of each link of the network equal to the user externality (Yang and Huang, 1998). Nonetheless, it is a rather theoretical construct and of little practical interest in view of the operating cost and public acceptance. Due to the imperfection of the first-best pricing from a political and technical implementation perspective, the second-best charging schemes have received ample attention in recent literature. This paper builds on research by Li (2002) and Yang et al. (2004) and makes a significant step towards efficient implementation of the sequential experimental mechanism for the practical second-best pricing problem. In contrast to the previous straightforward iterative procedure for first-best pricing, we deal with the price experimentation when only a subset of links is tolled and only a subset of link traffic counts is available in each trial. We aim at developing an effective and efficient procedure capable of at least working out a good
Sequential experimental approach for analyzing second-best road pricing 25 estimation or approximation of the relevant congestion tolls with incomplete set of data derived from the limited number of trial experiments. Our objective is achieved by virtue of advanced bi-level programming techniques, which are applied alternately and sequentially for estimating the origin-destination (O-D) demands from link traffic counts and determining the optimal link tolls with user equilibrium constraints on general networks. In what follows, we define some notation and outline the major idea used in the first-best pricing problem. Then, we introduce the trial-and-error implementation method for the second-best pricing problem with sequential price experimentation, and describe the necessary bi-level programming models and algorithms for the sub-problems of O-D demand estimation and link toll selection. After demonstrating the proposed sequential experiment approach with two simple numerical examples, we draw some conclusions and offer some perspectives on future research.
TRAFFIC EQUILIBRIUM AND FIRST-BEST PRICING Consider a road network with a set of directed links denoted by A, the flow on link a is denoted by va and v = (va,a e A) is a vector of all link flows. The travel time associated with traveling on link a is denoted by ta, which is assumed to be a function of flow on that link only (for simplicity, we consider separable link cost functions), ta = ta (v a ). We further use \a to denote the toll charge (in equivalent time unit) on link a e A . Let W denote the set of O-D pairs and Rw the set of all routes between O-D pair w e W. The route costs are given by the link travel time costs and toll charge (if any) as follows: cnv=Yj5l(ta(v)
+ xa), reRw,
weW
(1)
where 8™, = 1 if path r between O-D pair weW uses link a, and 8",. = 0 otherwise. Let cw = minjc^,, reRw]
be the minimum generalized travel cost between O-D pair w eW.
The true demand between O-D pair w e W is denoted by dw and is assumed to be a function of the minimum generalized travel cost between that O-D pair, dw = gw (cj) (for simplicity again we consider separable travel demand functions). Let d = (rfw, w e W)
The following standard assumptions are required throughout this study:
26
Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Al. For each link a s A , the corresponding link travel cost ta (v 0 ) is a strictly increasing, convex and is a twice continuously differentiable function in link flow va. A2. For each O-D pair wsW , the corresponding O-D demand function gw (c^) is nonnegative, strictly decreasing, bounded and continuously differentiable in O-D travel time cw, 0 < gw (cw) < dw, where dw is the upper bound of the demand function g
(c).
A3. The route choice behavior of network users follows the user equilibrium (UE) principle for any given toll charges. Given the above assumptions, the traffic equilibrium problem with elastic demand can be formulated as the following mathematical program (Bell and Iida, 1997):
(2)
where gj (dw) is the inverse of the demand function gw(cw) , Q. is the feasible set of link flows and O-D demands defined by
n = \(v,d)\va = YjJ]frw8war,asA;frw>0,reRw,YJfm=dw
where fm is the flow on route rsRw
(3)
between O-D pair weW .
For any given set of link toll charges and with the assumptions made above, a unique set of link flows and O-D demands can be determined from the UE program (2). The resulting net economic benefit (EB) or social welfare is well defined for the separable demand functions as follows:
^EB (T) = I '"j g~: («)d«, - 2> a (va (*)) v, (T)
(4)
Sequential experimental approach for analyzing second-best road pricing 27 Therefore, the optimal congestion-pricing problem is to determine a set of link tolls to maximize the net economic benefit function (4) subject to the UE constraint (2). The problem is formulated as the following Bi-Level Programming Problem (BLPP) (Yang and Bell, 1997): max FEB (T) , subject to: (v,d) e Q solves UE problem (2)
(5)
where T is the feasible set of link toll charges. If every link is subjected to a nonnegative toll charge, then one immediate solution to the above BLPP is to use link tolls that are based on marginal-cost pricing and are given as (Yang and Huang, 1998): dt (v ) 1a=Va^TJLL
>
a e A
(6)
dv0
where v* = (v*,a e A\ and d" =(d"w,we W\ are the system-optimal solution that solves
max
V fg~'(co)dco-Y;„(¥„)v
(7)
In the iterative procedure developed by Yang et al. (2004) for marginal-cost pricing in the absence of demand functions, link tolls are adjusted with the change in observed link flows or according to the explicit formula (6) using the convergent method of successive averages. The observed link flows are the revealed aggregate result from the reaction to different trial tolls by individual road users, and are readily available in actual implementation. In other words, the socially optimal link tolls can be identified with repeated price experimentation and link flow observations in a straightforward iterative adjustment procedure.
A SEQUENTIAL SECOND-BEST PRICING POLICY Here we are interested in the selection of optimal link tolls in the same spirit of trial and error experimentation in a practical second-best pricing environment where only a subset of links are subjected to toll charge. We also show how a set of second-best link tolls can be obtained
28 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction by applying bi-level programming techniques sequentially for both the 0-D matrix estimation and the toll-pricing optimization sub-problems. Let Ac A denote a subset of links subjected to a toll charge and Ac. A a. subset of links whose flows are observed after a trial for each link toll pattern, A and A are not necessarily identical. The basic iterative estimation and optimization procedure works as follows. Suppose that, after k trials of toll pricing on link a e A, we obtain a set of calibrated, approximate demand functions g£' (c,6), weW where 6 e 0 is a vector of parameters in the demand function and 0 is the feasible set of these parameters. Then based on the updated, approximate demand function, we can determine a new subset of link tolls i*
, ae A for
subsequent price experimentation by solving the following BLPP:
where (V(T),C?(T)) solves the following UE problem for given x E f and 6 e 0 : v
v
d
<0 +x dM+ I } ' » d c o - £ f^1(«,e)dm ( T Q l}('«( ) «)
(v
'
>£
aeA o
aeA.atA o
(9)
weJf o
where g"1 («?w,9),w e W is the inverse function of the currently calibrated, approximate demand function gw (cw,&) and T is the feasible set of the subset of link tolls ia, a e A. After imposition of the newly determined link tolls tj,**1', as A, a subset of revealed link flows vj*+1), a s. A are observed. The observed link flows are the result of distribution of the realized O-D demands on the network, and thus provide useful information about the true but unknown demand functions. Thus we can use the BLPP technique to estimate or update the O-D matrix and the approximate demand functions from the newly available link traffic counts, thereby obtaining anew set ofupdated O-D demand functions gw(cw,6(*+1> j , we W . There are two ways to update the demand functions: one is updating the O-D matrix obtained in the last iteration from traffic counts, and then using the new O-D matrix to tune the
Sequential experimental approach for analyzing second-best road pricing 29 approximate O-D demand functions; the other is calibrating and updating the parameters of the assumed O-D demand functions directly from the observed new trial results. The O-D matrix-updating problem from traffic counts can be formulated as the following BLPP (Yang et al., 1992; Yang, 1995): mm F0D{d) = Fl(v(d),v) + F2(d,d)
(10)
where v(
V
r co +x dco+
™% E |( «( ) «) v
~
aeA o
fc(°>)dffi
Z
(n)
aeA.aeA Q
where
(12)
&d={(dw,weW)\0
Q
, (d) = \(Va>a
e A
) Va = E Z frX,'0
S
^ / ™ ^ 0, r E i?w, ^ / „ = dw, W E W\ (13)
In this model, v = (ya,a E ^4) represents the vector of link flows observed in the last trial; d = tdw, w e Wj is the O-D matrix (rearranged as a vector) obtained in the last trial; Ft (v,v) and F2(d,d\
are functions of the generalized distance or error measurement between v and
v , and d and d , respectively. The following Euclidean distance function (Yang et al., 1992) is frequently used:
(14)
where y, and y2 are two weighting factors reflecting the relative confidence in v and d respectively. Because traffic counts are revealed reliable information collected with a good accuracy in the pricing experiment, a larger y1 (> y 2 ) may be preferred.
30 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction In the case that the approximate O-D demand functions are tuned by updating a set of parameters 0 e 0 directly, the problem is formulated as the following similar BLPP: mm F0D(Q) = Fi(v(Q),v) + F2(d{Q),d)
(15)
where (v(Q),d(6)) solves the following elastic-demand UE problem for given 0 6 0 and
xef: va
r™PQZj('»
+T
va
dw
« ) d ( 0 + £ J<0(a>)dcn-£J|;;1(a,e)d(»
(16)
The same quadratic function in (14) can be used for the objective function (15). The above iterative bilevel O-D demand function estimation and bilevel link toll optimization process is repeated until an appropriate convergence criterion is reached. To sum up, the general iterative trial-and-error procedure through sequential price experimentation for estimating the second-best link tolls is given below. Trial-and-Error Second-Best Toll Adjustment Scheme: Step 0.
(Initialization) Let \gw [cw,Q I, w e W\ be an initial set of approximate demand functions. Set k = 0 .
Step 1.
{Estimate link tolls) Solve the BLPP (8)-(9) to obtain a new set of link tolls
{
(Observe link flows) Observe the revealed link flows denoted by (v ( t ) , a e A\ after the imposition of the new link tolls |x ( t ) , a e A\.
Step 3. (Check convergence) If ( £(x[M) - i[k) f [ x ( £ ( T * f ] ' < s, then stop. \anA
Otherwise, go to Step 4.
)
\an'A
)
Sequential experimental approach for analyzing second-best road pricing 31 Step 4.
{Update O-D demand function) Solve the BLPP (10)-(l 1) or (15)-(16) to obtain a new set ofupdatedO-D demand functions (gw(cw,Q{-k+]) Y wew).
Let k:=k + \
and go to Step 1. In the algorithm, s is a positive number of convergence tolerance. The procedure will be terminated after the difference between two successive trial results is within a given tolerance. Remark 1. To execute the procedure, one needs to assume a specific functional form as an approximation of the true but unknown demand functions, an existing reference O-D matrix, if available, could be helpful for estimating/updating the O-D matrix and the approximate OD demand functions initially. Given a set of limited trial experiments around the optimum solution, the procedure is expected to derive the demand curve for a limited range of traffic levels that is relevant to road pricing together with the estimation of optimal link tolls.
Remark 2. The bilevel O-D matrix estimation and bilevel link toll optimization problems involved above have been studied extensively and significant progress has been made both computationally and theoretically in the transportation literature (Yang et al., 1992; Yang, 1995; Yang and Bell, 1997). Readers may refer to Yang and Bell (2001) and Yang and Bell (1998) for reviews of the various bilevel transportation network optimization problems with UE constraints. Among a handful of rigorous and heuristic algorithms, it is particularly worthy to mention the marginal function approach developed recently by Meng et al. (2001) for solving the transportation BLPPs. By exploring the differentiability property of the marginal function (Gauvin and Dubeau, 1982) associated with the DUE problem, Meng et al. (2001) transformed the transportation BLPPs into a single-level continuously differentiable optimization problem, which are amenable to the analysis and application of standard nonlinear programming problems (Bazaraa et al., 1993). Remark 3. As a special case of the general second-best pricing problem envisioned here, the proposed sequential linear demand function approximation can of course be used to determine socially optimal tolls in a first-best pricing environment without demand functions considered by Li. (2002) and Yang et al. (2004). We may reasonably expect that the Newton-Raphsonlike algorithm based on successive approximation would zone in on the optimal price much faster than the painfully slow process of the method of successive averages (Yang et al., 2004). This is important in practice, since the price experiments are generally limited to a few trials. Thus the proposed approach has an added bonus for the first-best pricing problem studied by Li (2002) and Yang et al., (2004): it involves fewer price changes and thus reduces the cost of implementing the pricing scheme, which is itself a social benefit.
32 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Remark 4. The sequential experimental procedure in general involves an update interval of multiple months, during which multiple or even daily observational values of link flows might be available in practice. In this case, a statistical OD flow or parameter estimation approach such as the generalized least square OD matrix estimation method is preferable by treating link flow observations as random variables, for which variance and covariance matrices can be easily derived from the multiple observation data (Yang et al., 1992, Yang, 1995).
SEQUENTIAL LINEAR APPROXIMATION As assumed throughout this study, we have to specify an approximate (but easily invertible and computable) function gw(cw,Q), weW,
9 G © , to use in place of the true, but unknown,
demand function in the neighborhood of the optimum point of the second-best pricing problem. One favorable choice is an interpolation and extrapolation scheme by a polynomial, including the simple linear and quadratic approximations. Here we adopt the following simplest sequential linear approximation scheme based on successively observed and estimated experimental data: L(cw,^))
= d(wt) + zit)(cw-clt)),
weW, * = 1,2,...
(17)
where 8'j0 = {zf\ ^ " , ^ " } , W E W are the function parameters, {z^\weW^ of the linear demand function approximations, \d^\we
are the slopes
W^ are the O-D demands estimated
from observed link flows at iteration k using the O-D matrix updating model (10)-(l 1), and fc'*', w e W\ are the corresponding equilibrium O-D travel cost inclusive of toll charges if any. By considering the straight line through the latest two experiment points, we have: z ^ S J * ' - ^ - 1 ' ) / ^ * ' - ^ * - 1 ' ) , weW, Jt = l,2,...
(18)
The line slope, jz^', weW}, are updated from iteration to iteration based on the observed results in each trial. This successive linear approximation, if convergent, is expected to become a tangential approximation of the true demand functions and the tangent point is the resulting equilibrium point associated with the second-best optimum toll charge.
Sequential experimental approach for analyzing second-best road pricing 33 Remark 5. When estimating the current O-D matrix d^, w e W via the model (10)-(l 1), the O-D matrix d{j~l), w e W obtained in the previous iteration is used as the reference matrix to ensure the sequence of the O-D matrices that are generated to converge to the final optimum. In this regard an initial seed or reference O-D matrix is used to estimate the initial O-D matrix for the linear approximation and an old matrix from a previous study could be used for this purpose. The quality of the initial seed O-D matrix is immaterial because its impact on the resulting O-D matrix estimates will diminish as the O-D matrix is successively converged. Remark 6. A rational linear approximation of the true demand curve requires that the slope {zf\
w E w) calculated by (18) from the latest two experiment points be negative (property
of a demand function as mentioned in Assumption 2). Nonetheless, this requirement is not always ensured as the iteration continues, particularly when the trial solutions approach near the real optimum. Because the O-D demands, d^
and d^~x), are merely estimates from
traffic counts, the slope z^} may become unstable as d(wk) and d^'
move closer to each
other due to estimation inaccuracy. Thus, a correction has to be made whenever a positive slope emerges by, for example, resetting it to a small negative value.
NUMERICAL EXAMPLES We now present two simple numerical examples to elucidate the applications of the proposed sequential price experimental approach to the first-best and the second-best road pricing problems with unknown demand functions, respectively. Example 1. In this example, we show that the algorithm based on successive linear approximations may involve fewer price changes than the method of successive averages does for the first-best pricing scheme. For simplicity, we consider the standard textbook case; a single O-D pair connected by a single road, with the following true demand and link travel time functions: g(c) = 600 exp (-0.05c)
(
f
Vs)
t(v) = 10 1 + 0.15 — v
'
{
(19)
UooJ j
(2°)
34 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Since a single road is concerned, the revealed or observed flow, v , is always equal to the OD demand, d , and hence the O-D demand estimation process is bypassed here. Now we briefly introduce the bisection method proposed by Li (2002) and the method of successive averages by Yang et al. (2004) for this simple example. Let rf'4'1' (or v'*'1') be the demand or flow used to estimate toll x'*"1' at iteration k -1 and d{k~l) be the observed flow after imposing t"" 1 '. The new intended traffic flow and new trial toll for the next iteration k are determined by:
rfw=^-1)+a(t-1)(rf
T
( 1 1
= V ^ d v
vhere OC
—1/2 for the bisection method and CC
= \jk
(21) v*«>
for the method of successive averages.
Figure 1. Comparison of the convergence rates by the bisection method, the method of successive averages and the sequential linear approximation method in Example 1
Sequential experimental approach for analyzing second-best road pricing 35
By equalizing the true demand function and the following marginal-cost function t (v)
F(v) = f(v) + v ^ £ i = l<)[l + O.75f—1 ] W W dv [ UOOJ J
(22)
the socially optimal level of flow, full trip cost and toll charge can be easily identified to be: v" =d" = 216.898; c =20.350; T* = 8.300 The equilibrium flow and full trip cost without tolling are equal to v<0) = dm = 276.581 and cm = 15.489. Starting with this observed flow with the corresponding initial toll charge t(1) = 21.933 calculated by (21), the results by the three methods are discussed below.
Figure 2. Convergence pattern of the sequential linear demand function approximation in Example 1
36 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction As already mentioned, the bisection method does converge for the simple single road case considered here, and is hence applied here for a comparison. For a given tight convergence criterion s = 0.001, the number of trials required by the bisection method, the method of successive averages and the linear approximation method are respectively 5, 18 and 7 (also refer to Figure 1). For this special example, the bisection method has the quickest convergence (but it does not work for a general network), the proposed sequential linear demand function approximation method outperforms the method of successive averages. Note that the relative convergence of the three methods depends on the degree of curvature of the real demand functions. Clearly, if the true but unknown demand function is linear, the linear approximation method will arrive at the optimum with two iterations only. Achieving a fast convergence of the sequential price experimental approach is important, because one may wish to employ as few trials as possible to obtain an acceptable estimation of the optimal congestion tolls in practical applications. The average private cost and the marginal social cost curves are plotted in Figure 2 together with the true but unknown demand curves (dashed). The linear extrapolation and interpolation lines are drawn through the two most recent experiment points (except the initial point which is the observed point without toll charge or in the do-nothing case). The points are numbered in the order that they are identified in the sequential price experimentation. For this simple single road example, the true O-D demand and O-D cost in each trial are observed directly without an estimation process and thus all trial points are located in the true demand curves. As observed from the figure, the sequence of experimental points converges to the social optimum (the intersection between the true demand curve and the marginal social cost curve). Example 2. In this example we use a small but general network to illustrate the application of the trial-and-error procedure for the second-best pricing problem. The network, as shown in Figure 2, consists of 4 links, 3 nodes and 2 O-D pairs (l->3, 2->3). The true demand functions are given below:
gM{cM)
= 500exP(-0.03cM)
ft-, (cM) = 400exp(-0.05c^3) The following link travel time functions are used for the 4 links respectively:
Sequential experimental approach for analyzing second-best road pricing 37
=12 1+0 15
10 1+0 15 4
^> ( - &J} ^>= ( - fe) ) The set of tolled links and observed links are assumed to be identical with two links: A = A = {3,4}-
Figure 3. The network used for Example 2
For given toll charges in each trial experiment, the observed link flows are simulated (generated) by using the elastic-demand traffic assignment method with the true nonlinear demand functions. In view of the small size of the example network, we used an extensive direct search method without derivatives (Hooke-Jeeves pattern search method, see, for example, Bazaraa et al. (1993)) for finding the global optimal solutions of both the bilevel OD estimation and toll optimization problems in each trial. For the purpose of validation, we identified the true optimum solution (but never known in reality in the absence of demand functions) by extensive direct search using the true O-D demand functions. With the known optimum toll solution, we can test whether or not the sequential alternate bilevel O-D estimation and toll optimization algorithm converges to the real optimum. To start the iterative procedure, the initial observed link flows are given as the equilibrium link flows without toll charge (do-nothing case), the initial O-D demand and O-D cost for the first linear approximation of demand function are estimated from the initial observed flows with an initial seed O-D matrix: d^3 = d2^i = 200. The starting point of the toll charge is (T3 0) ,T 4 0) ) = (4.0,4.0). The two weighting factors for the O-D matrix estimation problem
38 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
(14)are set to be (Y 1 ,T 2 ) = (1000.0,1.0), with the directly observed link flows carrying much higher weight. The convergence tolerance is set to be s = 0.01. Figure 4 plots the true optimum for the second-best pricing problem and the convergence pattern of the link tolls identified through the sequential price experimentation using the sequential BLPP methods. The true or exact optimum occurs at (i\,i\ J = (7.95,5.95). The algorithm converges after 6 iterations with a convergent point (T36),T(46)) = (7.84,5.80) which is sufficiently close to the exact optimum.
Figure 4. Convergence pattern of the sequential trial-and-error toll adjustment scheme for the second-best pricing problem in Example 2
Sequential experimental approach for analyzing second-best road pricing 39
Figure 5. Convergence pattern of the sequential linear demand function approximation in Example 2
Figure 5 displays the successive linear approximation to the true, but unknown, nonlinear demand functions. It is observed that, as the trial experiment continues, the linear approximation does become more tangential to the true demand curve near the true optimum points on the demand curve. In contrast to Figure 2 in Example 1, it is observed in this figure that the trial points are not necessarily located on the true demand curves, which are the direct results of the imperfection of the O-D demand estimation sub-problem mainly arising from the incomplete set of link traffic counts. As acknowledged in Remark 5, the instability problem including the positive slope estimates of the linear demand function approximation was indeed encountered when commencing the trial experiments with alternative initial toll charges. It is thus suggested that flow observations should be made on as many links as possible to enhance the accuracy and reliability of the O-D demand estimation, thereby leading to better linear approximations of the true demand curves.
40 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
CONCLUSIONS AND FUTURE EXTENSIONS We developed an encouraging procedure for the trial-and-error implementation of the secondbest congestion pricing on a general road network with unknown demand functions. The procedure involves sequential alternate solutions of the bi-level O-D demand estimation and the bi-level toll optimization problems. The technique presented here has the potential to allow a traffic planner to easily estimate the second-best link tolls from readily available traffic counts without resorting to the demand functions, and thus overcome the practical difficulty in designing a realistic second-best road pricing scheme. What is more, the estimation of the demand functions is in itself meaningful if one wishes to tackle the welfare and the re-distributional effects, both of which are critical to resolve the political issues of congestion pricing. A few interesting extensions are worthy of further exploration to address some behavioral and political issues in the actual implementation of the proposed sequential price experimentation approach. Here we provide a few meaningful examples. The trial-and-error experimental procedure obviates the explicit use of the demand functions. Nevertheless, it does require an accurate estimate of the generalized travel cost and hence the users' value of travel time saving, which is important to calculate the toll amount in actual dolls. Even though it might be easier to estimate users' value of time than to estimate the demand functions and there is indeed much published literature in this area, it is certainly meaningful to simultaneously estimate the optimal link tolls and the users' value of time through the proposed sequential price experimentation, particularly on networks with heterogeneous users. In this regard, the bi-criterion equilibrium models with either a discrete or a continuously distributed value of time over the user population should be useful (Leurent, 1996; Marcotte and Zhu, 2000; Yang and Huang, 2004). Throughout this study we have adopted the simplest functional approximation scheme: a successive linear demand function approximation, which may, as indeed observed in our study, encounter instability problem near the optimum point. It is expected to improve the stability and convergence of the successive function approximation by utilizing a more accurate high-order polynomial with more observed experiment points. For example, it is straightforward to use a quadratic approximation function, which is unique through the latest three experiment points. From an alternative perspective, one may also consider the methods of non-parametric curve estimation well established in econometrics (Efromovich, 1999) to derive the demands from the observed experiment results without the knowledge on the form of the demand function. In addition, as shown in our simple network example, the proposed sequential experimental procedure involves both upward and downward adjustment of the starting and intermediate toll levels, which might be politically unacceptable. It is thus desirable to design a procedure that optimally considers some plausible bounds for the trajectory of realistic toll evolution over time.
Sequential experimental approach for analyzing second-best road pricing 41 Our sequential experimentation procedure to uncover the demand curve is built upon the assumption that changes in demand are provoked by short run changes in price along the same demand curve. The demand revelation mechanism thus requires a series of price changes to derive the demand functions properly. Politically speaking, it is clear that a series of quick changes to a toll system are an unlikely social event, as it would make the newly introduced system unsustainable. A plausible toll adjustment by a willing authority would be in annual, semi-annual or at most quarterly intervals like the situation in Singapore. Nevertheless, such a socially acceptable long inter-trial period could create a behavioral dilemma for the analysis envisioned here. On the one hand, it would allow travelers to have sufficient time to learn and adjust their trip-making decisions in a new pricing environment, although this might not be a critical issue, as advanced information technology is nowadays available and travelers can be quickly informed of altered toll charges. On the other hand, the background variables such as the inflation and real income growth are changing over such length of time. The above issues suggest that the short run - long run differences in behavior as well as the time lag of user responses should be considered carefully in formulating a practical pricing mechanism. The political and behavioral limitations mentioned above could be mitigated in two different manners. First, albeit the price experiments are limited to a few trials and the inter-trial period could be considerably long, the traffic counts are relatively inexpensive to collect with automatic devices, even on a daily basis with good accuracy. These readily and frequently available traffic counts can be utilized effectively to update O-D demands and thus capture the long run demand shift prior to the next price trial. Second, apart from the actually observed behavioral changes, a set of stated preference experiments such as the travel behavior experiments initially suggested by Mahmassani and Chang (1986) can be conducted to analyze the repeated reactions of a set of respondents to price changes, thereby complementing the limited revealed preference experiments.
ACKNOWLEDGMENTS The authors would like to thank three anonymous referees for their helpful comments on an earlier version of the paper. This research described in this paper was substantially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. HKUST6033/02E).
REFERENCES Bazaraa, M.S., Sherali, H.D. and Shetty, CM. (1993) Nonlinear Programming: Theory and Algorithms. John Wiley and Sons, Inc., New York. Bell, M.G.H. and Iida, Y. (1997) Transportation Network Analysis. John Wiley & Sons, Inc., New York. Downs, A. (1993) Point of view: implementing peak-hour road pricing at fullscale: finding solution to practical problems. TR News 167, 7-9. Efromovich, S. (1999) Nonparametric Curve Estimation: Methods, Theory and Applications. Springer, New York.
42 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Gauvin, J. and Dubeau, F. (1982) Differentiable properties of the marginal function in mathematical programming. Mathematical Programming Study 9, 101-119. Leurent, F. (1996) The theory and practice of a dual criteria assignment model with a continuously distributed value-of-time. hi Transportation and Traffic Theory, ed J. B. Lesort, pp.455-477. Pergamon, Exeter. Li, M.Z.F. (2002) The role of speed-flow relationship in congestion pricing implementation with an application to Singapore. Transportation Research 36B, 731-754. Mahmassani, H.S. and Chang, G.L. (1986) Experiments with departure time choice dynamics of urban commuters. Transportation Research 20B, 297-320. Marcotte, P. and Zhu, D.L. (2000) Equilibria with infinitely many differentiated classes of customers. In Complementarity and variational problems—State of the Art, eds M.C. Ferris and J.S. Pang. SIAM, Philadelphia, PA. Meng, Q., Yang, H. and Bell, M.G.H. (2001) An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transportation Research 35B, 83-105. Vickrey, W. (1993) Point of view: principles and applications of congestion pricing. TR News 167, 4-5. Yang, H. (1995) Heuristic algorithms for the bilevel origin-destination matrix estimation problem. Transportation Research 29B, 231-242. Yang, H. and Bell, M.G.H. (1998) Models and algorithms for road network design: a review and some new developments. Transport Review 18, 257-278. Yang, H. and Bell, M.G.H. (1997) Traffic restraint, road pricing and network equilibrium. Transportation Research 31B, 303-314. Yang, H, and Bell, M.G.H. (2001) Transport bilevel programming problems: recent methodological advances. Transportation Research 35B, 1-4. Yang, H., H. J. Huang. 2004. The multi-class, multi-criteria traffic network equilibrium and system optimum problem. Transportation Research 38B, 1-15. Yang, H. and Huang, H.J. (1998) Principle of marginal-cost pricing: How does it work in a general network? Transportation Research 32A, 45-54. Yang, H., Meng, Q., Lee, D.H. (2004) Trial-and-error implementation of marginal-cost pricing on networks in the absence of demand functions. Transportation Research 38B, 477-493. Yang, H., Sasaki, T., Iida, Y. and Asakura, Y. (1992) Estimation of origin-destination matrices from link traffic counts on congested networks. Transportation Research 26B, 1-18.
3
HIGHWAY SPACE INVENTORY CONTROL SYSTEM
Dusan Teodorovic and Praveen Edara, Charles E. Via Jr. Department of Civil and Environmental Engineering, Virginia Polytechnic Institute and State University, Falls Church, Virginia, USA
INTRODUCTION The number of trips by private cars has significantly increased in recent decades. At the same time, road network capacities have not kept up with this increase in travel demand. This imbalance of demand and supply has resulted in increased travel times, increased number of stops, unexpected delays, greater travel costs, inconvenience to drivers and passengers, increased air pollution and noise level, and increased number of traffic accidents. Expanding traffic network capacities is extremely costly, as well as environmentally damaging. Planners, engineers, and economists have introduced various demand management methods in an attempt to reduce the fast growing traffic congestion (park-and-ride, high occupancy vehicle lanes (HOV) (Giuliano et al., 1990; Yang and Huang, 1999; Dahlgren, 2002), high occupancy toll lanes (HOT) (Abdelghany et al., 2000; Murray et al., 2001), congestion pricing (Vickrey (1963, 1969, 1994), de Palma and Lindsey, 2002; Verhoef, 2002; Yang and Huang, 1999; Yang and Zhang, 2003; Zhang and Yang, 2004; Phang and Toh, 2004)). Successfully planned and implemented demand management strategies can result in significant toll revenues, decrease in total number of vehicle trips, decrease in total number of vehicle trips during peak periods, increase in number of vehicle trips during off-peak periods, increase in ridesharing, rise in public transit ridership, and in some cases increased cycling, walking, and telework. In this paper, a new demand management concept, Highway Space Inventory Control System (HSICS), is proposed and modelled. The basic idea of HSICS is that all road users have to make reservations in advance to enter the highway. The system allows highway operators to make real-time decisions whether to accept or reject travellers' requests to use the highway system in order to achieve certain system-wide objectives. The proposed HSICS model
44 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction consists of two modules - Highway Allocation System (HAS) and the Highway Reservation System (HRS). The HAS is an off-line module and determines the maximum number of trips from each user class (categorized based on time of departure, vehicle type, vehicle occupancy, and trip distance) to be accepted by the system given a pre-defined demand. It develops the optimal highway allocations for different traffic scenarios. The "traffic scenarios-optimal allocations" data obtained in this way enables the development of HRS. The HRS module operates in the on-line mode to determine whether a request to make a trip between certain origin-destination pair in certain time interval is accepted or rejected. The Highway Allocation System is modelled in the form of an integer program with the objective to maximize total travelled passenger miles. A neural network approach is used to model the online HRS. The paper is organized in the following way. Section 2 will present the literature review on highway booking, section 3 will explain in detail the concept and basic characteristics of the proposed HSICS, section 4 discusses the possible impacts of the proposed system, section 5 will present the modelling aspect of the HSICS, section 6 describes the numerical example and the obtained results, and sections 7 and 8 discuss the future research issues and conclusions.
LITERATURE REVIEW Highway booking concept is not a well explored topic in the area of travel demand management. Akahane and Kuwahara (1996) have studied the benefits of trip reservation systems that manage highway traffic demand on holidays based on a stated-preference survey. Wong (1997) proposed a qualitative approach for the highway booking problem. In the paper, he developed a conceptual framework of a highway booking system and discussed the advantages of such a system. Koolstra (1999) studied the potential benefits of slot reservation on highways by analyzing the difference between user equilibrium departure times and system optimal departure times, de Feijter et al. (2004) have proposed trip booking as a method for improving the travel time reliability and increasing the effective usage of road capacity. The proposed system aims at open dedicated infrastructure, such as bus lanes and dedicated freight lanes. Using simulation experiments they further prove the advantages of such a booking system. While all these papers have discussed the advantages and issues related to trip reservation systems, none of them have developed a comprehensive model of highway booking system that will allocate the highway space to potential users during different time intervals and accept/reject user travel requests. In this paper, we make an attempt to formulate the highway booking problem as a combination of offline optimization and online reservation problem.
HIGHWAY SPACE INVENTORY CONTROL SYSTEM: BASIC CHARACTERISTICS The basic idea of the highway-booking concept is that all road users have to book in advance. Airline industry, hotels, car rental, rail, and many other industries are utilizing reservation systems and revenue management concepts when selling their products (Littlewood, 1972; Belobaba, 1987; Brumelle and McGill, 1993; Cross, 1997; and Teodorovic et al., 2002).
Highway space inventory control system 45 Internet provides information on ticket prices to millions of users, and together with ecommerce, it has opened a new stage in the revenue management concepts and practice. The era of dynamic ticket pricing has already begun, opening a lot of complex problems to practitioners and transportation researchers. Revenue management could be described as a group of different scientific techniques of managing the company revenue when trying to deliver the right product to the right client at the right price at the right time. The basic characteristics of the industries to which different revenue management concepts were successfully applied are: (a) variable demand over time; (b) variable asset utilization; (c) perishable assets; (d) limited resources; (e) market segmentation; (f) adding new capacity is expensive, difficult, or impossible; (g) direct cost per client is negligible part of the total cost of making service available; (h) selling products in advance. Revenue management concepts that have been developed in various industries could be used in the development of highway flow management concepts. Let us elaborate on the abovementioned characteristics in more detail in the case of highways. It is well known that transportation flows change over time {variable demand). Changes are noticed by month, by week, by day in a week, and finally by hour in a day. Transportation flow changes over time can be determined by collecting appropriate statistical data, as well as by conducting passengers'/drivers' surveys. The highway space inventories are also perishable. Highway spaces not utilized during some time interval are lost. Highways also have limited resources. The available highway capacity is limited and cannot be expanded in a short time period. There is also market segmentation associated with the highway usage. Possible categories of potential highway users include private cars, transit vehicles, carpools, trucks, low emission vehicles (LEV), vehicles equipped with electronic toll collection, and others. The highway operator could offer to potential users during the same time interval a large number of different tariffs (or assign different priorities) based on a set of defined criteria. This is due to the highway operator's potential desire to achieve the greatest possible number of passenger-miles along the highway, to spread peak over time and space, to accept the greatest possible number of low emission vehicles (LEV) and/or vehicles equipped with electronic toll collection units, to achieve the highest possible total revenue, etc. Highway tariffs could be fixed or they could vary all the time (on an hourly basis). Highway operator would practically face the following dilemma all the time: Will I accept an early reservation from the user making low number of passengers-miles, and/or paying low tariff; or will I wait for a user who will make high number of passenger-miles and/or who is ready to pay higher highway tariff?
46 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction In years to come, as the traffic congestion keeps growing, and with the progress made by Intelligent Transportation Systems (ITS), we believe that the highway space inventory control systems will be developed and implemented to manage the highway traffic flows effectively. Reservation requests can be made via telephones or electronically. Driver should specify entry time (within time interval whose width could be 5-10 minutes) on ramp, trip, and off ramp and inform the highway operator (by telephone or electronically). Requests would be usually made several days, hours, or minutes (last-minute request) before the planned trip. In this way, highway operator would know planned driver itineraries, as well as planned departure times. HSICS should explore in real- time, the possibility to accept driver's request. In such a system, drivers making reservations in advance would be protected from unexpected high traffic volumes that often result in increasing the travel time significantly. The assumption is that the highway operator would always accept limited number of driver requests, and in this way keep traffic flows within prescribed limits. When a driver's request is accepted, it means that a space on the highway, during a certain time interval is reserved for the driver.
IMPACTS OF THE PROPOSED SYSTEM Practical implementation of the proposed concepts depends on the reaction from various interest groups. Highway users are not a homogeneous group. They have different socioeconomic characteristics, as well as different reasons to enter the highway at a specific location at a specific time point. Income level, age, educational level, trip purpose, daily commuting, geographical location, and existence of transportation alternatives are the dominant factors leading to the heterogeneity of highway user groups. These groups, depending on their interests, will try to commend or condemn the proposed demand management strategy, debating on concepts of justice, fairness, ethics, traditional societal norms and tradition. Effectiveness of our proposed system can be measured exactly. On the other hand, there is always effectiveness perceived by public. Positive perceived effectiveness is one of the crucial factors for the successful implementation of the highway space inventory control system. Positive perceived effectiveness is among other things, influenced by successfully resolved issues of fairness and equity. One should expect that fairness issues could be the most preferred media's topic. One of the most important tasks in the implementation of the proposed strategy would be to convince various interest groups that highway reservation system is designed to partially mitigate traffic congestion, and not to collect additional taxes and additional revenue for the government and traffic authorities. The strongest opponents of the proposed concepts would be probably the advocates of the "tollfree highways". Members of this interest group claim that the government has the responsibility to supply free service of highways. It has been well known that "toll-free highways" also generate the controversy over equality between highway users and non-users. It is also probable that the public opinion would improve as the highway users experience the real system, as it was the case with the introduction of other well-known demand management strategies. We are not able, in this initial research, to fully answer all political, ethical, and economical issues regarding the implementation of the highway reservation system.
Highway space inventory control system 47
MODELLING OF HIGHWAY SPACE INVENTORY CONTROL SYSTEM The proposed HSICS model consists of two modules - Highway Allocation System (HAS) and the Highway Reservation System (HRS). HAS is an offline module that allocates the highway sections (different Origin-Destination pairs) to various vehicle types (single occupant cars, car pools, public transit, trucks) during different time periods with the goal of optimizing the objective function(s) value(s) subject to the existing supply and demand constraints. It develops the optimal highway allocations for different traffic scenarios. The "traffic scenarios - optimal allocations" data obtained in this way enables the development of HRS. HRS is the on-line system that makes on-line decisions regarding the possibility to accept driver requests. The developed HRS is able to generalize, adapt, and learn based on new knowledge and new information. Proposed HRS is based on neural network training. The neural network learns from the optimal solutions of the analyzed past traffic scenarios. For every vehicle class a separate neural network is trained for making decisions about accepting/rejecting driver requests. The algorithm to model the proposed HSICS consists of the following steps: Step 1: Generate various traffic scenarios. (Collect cumulatives that are based on a large number of drivers' requests on the highway in question). Step 2: Highway Allocation System: Formulate a corresponding integer programming problem and find the optimal allocation for each traffic scenario. Step 3: Highway Reservation System: Based on the statistical data resulting from Steps 1 and 2 train neural networks that will be capable to accept/reject driver's requests in real time. In the following section, the HAS module will be explained in detail. Highway Allocation System (HAS) The Highway Allocation System can be formulated as an integer program. One possible objective of the proposed HAS could be 'maximization of the total passenger miles over a defined time period, for a defined length of the highway'. It is possible to prioritize vehicle types based on some criteria. For every trip, it is possible to calculate the passenger miles travelled during that trip, by knowing the vehicle occupancy and distance covered in the trip. When summed over all the O-D pairs and all time intervals, the total passenger miles travelled on the highway can be calculated.
48 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Figure 1: A typical highway section Different sections of a highway have different utilization percentages, some sections can be heavily congested while some others could have free flow conditions. It is vital for any allocation procedure to check for the time-varying capacity (vehicles/time) of different highway sections while allocating traffic. To carry out such an allocation procedure, the time period is divided into smaller time intervals, and the highway network is divided into a series of links (Figure 1), the road capacity remains same through out the link though it could vary with time. Also a 'trip' is defined as any combination of O-D pair, and Vehicle class. Each possible combination of these two attributes is a unique trip. In the HAS formulation, the objective function is to maximize the weighted (prioritized) total number of passenger miles over a defined time period and a defined length of the highway (Relation (1)). In this model, priorities can be assigned based on trip type (O-D pair and vehicle type). In a more general case, the users can be classified based on time of reservation requests and priorities assigned accordingly. However, in this model we do not consider that aspect. The allocation should be done in such a way that the total number of vehicles using a link during any time interval should not exceed the link capacity (Relation (2)). During any time interval, the traffic on a link consists of vehicles belonging to trip allocations in the current interval and vehicles belonging to trip allocations during earlier intervals that will be travelling on the link during the current interval. We define reserve capacity for every link in order to account for, a) providing access for emergency vehicles that cannot make reservations in advance, and b) uncertainty related to incidents or bad weather conditions. Also, the allocations for any trip should not exceed the corresponding demand value during that interval (Relation (5)). Based on these assumptions the HAS can be formulated as an integer program as shown below.
Maximize F = ^ ^ pru pmt- xu <=i i=i
subject to
(1)
Highway space inventory control system 49
^0^-x^C^R^aeAytET
(2)
;=i 1=1
6i
(1, if Posilt e a '"' \0,tfPosllt*a =
(3)
Posm = Posi0 + vme -St-{t-l)
(4)
xu
(5)
x,v>O,Vie/,V/er
(6)
xu are integer V? e / , V / e T
(7)
where: A 'trip' is defined as any combination of O-D pair and Vehicle class. Each possible combination of these two attributes is a unique trip. i - Trip index value / - S e t of all trips / - Time interval at which vehicles enter the highway t - Current time interval St - Size of time interval T - Set of all time intervals pru - Priority of/01 trip type during time interval' / ' pmi - Passenger miles traveled in the z'th trip xa - Number of vehicles of the f° trip type that can be accepted to enter the highway during time interval' / ' Da - Demand for ith trip to enter the highway during time interval' / ' A - Set of all defined links
50 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Ca - Maximum capacity of link ' a ' Ra - Reserve capacity of link ' a ' Posm - Current position (beginning of time interval 7') of vehicles belonging to i'h trip that entered the highway during time interval 7' Posia - Entry position of vehicles belonging to i'h trip vme- Average speed on the highway The assumption of average speed in the above formulation (Relation (4)) is very simple and does not take into account the traffic flow characteristics; speed does not vary with the current density on the link. This assumption limits the model accuracy in terms of determining the number of vehicles on each link in each time interval. A complex, but more accurate, update of the vehicle positions can be obtained as follows: Posilt=Posi0+
j^vUJ-St
(8)
H
where: j - index for an arbitrary time interval^' > / \/j,l e T (introduced mainly for usage in position calculations) vUj -j'h time interval speed of vehicles belonging to i'h trip that entered the highway during time interval '/' Speed vaj can be expressed in terms of the space mean speed of link 'a', uaj , as:
v w =i^-^
(9)
0=1
The space mean speed on link 'a', uaj, can be expressed as a function of the density on link 'a' using the Greenshields model as:
Kj=ufa\l-^-\
where:
(10)
Highway space inventory control system 51
uaj - Space mean speed of link 'a' during time interval 'j' ufa- Free flow speed of link ' a ' La - Length of link ' a' ^ - D e n s i t y of link ' a ' during time interval 'j' Ka{jam)- Jam density of link 'a' Density of link ' a ' during time interval ' j ' is: I'. ./ / ( / j imaj
im
(11)
Substituting for KaJ in relation (10) we get: I7! '
f
"l
YYfl -x 'maJ
L-^ L-i
(12)
!m
V
)
Using relation (12), relation (9) can be rewritten as:
v
=V
U
. 1 '=' "-1 L
«=1
.ft
(13)
«' A < 1 a«™) )
V
Substituting for vUJ in relation (8) we get: (
PoslU=Posl0+ X E ">
J
1 - ^
)
-O^St
(14)
In the HAS formulation, relation (4) could be replaced by relation (14). All other constraints remain the same.
52 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Speed estimation using density-speed relationship (similar to Greenshields model shown in relation (10)) has been used in the past by Mahmassani and Peeta (1993), and Jayakrishnan et al. (1995), while developing framework for dynamic traffic assignment. Mahmassani and Peeta (1993) have developed a discrete macroparticle traffic simulation model as a part of their dynamic assignment framework. In the simulation model, they assume that all vehicles on a link move at the same speed during a given time interval. Density and speed on each link are updated every time interval, as vehicles enter and leave a link. A similar approach is used by Jayakrishnan et al. (1995) in an optimization framework. They present additional insights into the usage of density-speed relationship rather than flow-speed relationship, including the fulfillment of first-in-first-out requirement and others. The formulated integer program is solved, and the allocations for all trips for all time intervals are obtained. Before we proceed to the next step of modeling the HRS, let us introduce the following notations (Figure 2) which will help for easier understanding of the HRS: Te - Time at which the user wants to enter the highway To- Time at which the advance booking opens (e.g.: 5 days before the scheduled trip departure) Tr - Time at which an user requests a reservation to enter the highway at time Te Tc - Time at which the advance booking closes and no more requests for that trip-departure time combination can be accepted by the reservation system (the time at which all the HAS allocations for that trip-departure time combination have been reserved). T - Advance booking interval is divided into smaller intervals of size 7 each AT = Tc - Tr, the amount of time after which the reservation system will be closed and no more travel requests from users of this trip type will be accepted. Positive value of AT means that the request can be accepted, and negative AT means that the request cannot be accepted. Dr - Cumulative number of requests by Tr Dc - Cumulative number of requests by Tc. It is the total number of HAS allocations for this trip-departure time combination (obtained from the integer program's optimal solution) D, - total number of requests from users willing to depart by Te The above defined variables can be better understood graphically. In Figure 2, the cumulative user requests over time are plotted for the demand related to one trip-departure time combination. The maximum number of allocations that can be done for this trip-departure time combination, Dc, is obtained from the HAS. From the plot, Tc can be obtained (the time corresponding to Dc), which is the time after which no more reservation requests for this trip-
Highway space inventory control system 53 departure time combination can be accepted. Users continue to make requests even after Tc until the trip's departure time Te, though they will be rejected.
Figure 2: Cumulative number of travel requests over time Brief Description of Artificial Neural Networks Artificial neural networks are inspired by biology i.e., they are composed of elements that function similarly to a biological neuron. Neural networks are able to learn from experience, to apply to new cases generalizations derived from previous instances, and to abstract essential characteristics of input data that often contain irrelevant information (Teodorovic and Vukadinovic, 1998). The model of an artificial neuron copied the properties of a biological neuron. The input signals y\, yi, ..., yn, representing the output signals of other neurons, are multiplied by associated connection strengths, w\, w^,..., wH. Each connection strength (weight) corresponds to the strength of a biological synaptic connection. The output signal (NET) is equal to the weighted sum of input signals. The range of the weighted sum of input signals, NET, is compressed by an "S" curve such that the value of the output signal, OUT, never exceeds a relatively low level regardless of the value of NET. The strength of a neural network is obtained as a result of the connectivity and collective behaviour of the neurons. Neural networks store the strength of synaptic connections (weights of the network's branches) by which the required data are reproduced. Learning refers to
54 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction estimating the appropriate weights in order to reproduce certain decisions under particular conditions. In other words, neural networks can be trained by adjusting the connection strengths in order to abstract the relations between the presented input/output data. Training algorithms are very simple mechanisms for adapting the weights of a network's branches. Highway Reservation System (HRS) The Highway Allocation System (HAS) allocates the highway space, off-line, to vehicles belonging to all trip-departure time combinations. This is the supply that is allocated. Users who wish to travel on the highway during any time interval should make reservations in advance. The reservation center could be opened several days before the trip's scheduled departure time, and the users can make requests for reservations either by calling or via internet. When the user makes a request, he/she has to furnish trip details including the preferred departure time, vehicle class used for the trip (single occupant car, carpool, transit, etc.), and the desired origin and destination for the trip (highway entry/exit locations). Using this trip information and the time at which the user is making the request, the operator has to make a decision whether to accept or reject the user request. This task of decision making is trivial in the event that the demand for travel during some time in the future is deterministic. However, it is difficult to predict the future demand patterns in an accurate manner. The operator has to make real-time decisions based on the cumulative requests at that instant, as he is unaware of the future requests. When a user makes a request at time Tr, the cumulative plot is known only until time Tr, so time Tc and time AT can not be calculated. To calculate these values we propose a Highway Reservation System (HRS) that uses data related to past demand patterns in training a group of artificial neural networks (ANNs) that will be used for real-time decision making. We propose one neural network for each vehicle class (see Figure 3). Let us illustrate using an example the procedure of defining the inputs/outputs of the neural network for any one vehicle class (say vehicle class 1). Using vehicle class 1, many trip-departure time combinations are possible. For each such trip-departure time combination there exists a cumulative requests plot as shown in Figure 2, that can be obtained from past data (there is no uncertainty in past data, the operator knows it). Using the HAS module, the maximum number of allocations, Dc, that can be done during any time interval can be obtained. From the cumulative requests plot, the closing time Tc corresponding to demand Dc is obtained. Also, the 'advance booking interval' is divided into 'n' smaller time intervals of size '? each. Assuming that the requests are made at the end of each small time interval (of size 'T'), for each of these requests, the AT value and the corresponding cumulative requests value Dr can be read from the cumulative plots (Figure 2). The inputs for the neural network are the cumulative requests Dr, and the corresponding outputs are the AT values (Figure 2). The number of inputs is equal to the number of trip-departure time combinations for this vehicle class (see Figure 3). Also, the number of outputs is equal to the number of inputs. The same procedure is repeated for several "traffic scenarios" and corresponding cumulatives are generated, this statistical data enables neural network training. Once the trained network is obtained, it can be used for real-time decision making. When the user makes a request at time Tr, then the Dr value is obtained from its cumulative plot (user specific trip-departure time
Highway space inventory control system 55 combination plot), and the Dr values for other trip-departure time combinations (but same vehicle class) are also obtained from their respective cumulative plots. Now this data is entered into the trained neural network and the output A rvalues are obtained. If the output AT value is positive then the operator will accept the user request, else rejects it. In this way, past data can be used for training the neural networks and solve the problem of uncertainty in future demand, and real-time decisions can be made. Same procedure is followed for developing neural networks for the remaining vehicle classes. Since the proposed HRS currently does not exist, the data related to reservation request rates has to be assumed for now, and later on once the system is in place and users start making requests for daily travel, the data can be collected and used in the future.
Figure 3: Neural network for one Vehicle Class
NUMERICAL EXAMPLE The proposed HSICS is illustrated using a numerical example. A three lane highway section consisting of three entry ramps and three exits as shown in Figure 4 is considered.
56 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Figure 4: section of J lane highway considered in the numerical example Let us consider four vehicle classes - Single Occupant Vehicles, Car Pools (vehicle occupancy>l), Transit Vehicles, and Trucks. All the vehicle classes are assumed to have equal priority. The time period for which allocations are done is 7:00 am to 8:00 am. This one hour period is further divided into 15 minute intervals - 7:00 am to 7:15 am, 7:15 am to 7:30 am, 7:30 am to 7:45 am, and 7:45 am to 8:00 am. Four Origin - Destination pairs are considered - (entryl, exit2), (entry 1, exit3), (entry2, exit3), and (entry3, exit3). This means that there are vehicles belonging to 16 different trips that enter the highway during one time interval. Maximum capacity (Ca) and Reserve capacity (Ra) for all links of the highway section are assumed to be equal to 2200 vphpl and 500 vphpl respectively. Capacity available for allocation (Ca - Ra) for 15 min interval for 3 lanes is 1275 vehicles. In this numerical example, for the sake of simplicity, we use a constant speed value for position update calculations (Relation (4)). In the future, we will be developing a numerical example using position update calculation shown in Relation (14) that uses density-speed relationship. Relation (2) consists of variable 0tlal in the summation, which takes binary values based on whether Posm belongs to link 'a' or not. The position Posm as expressed in Relation (14) is a function of the allocations in earlier intervals, meaning that the position Posm cannot be calculated unless the previous intervals' allocations are known. Therefore, the problem turns out to be an implicit, constrained optimization model which is most likely very noisy and has many local optima. It is very difficult to solve the formulation using any of the available optimization algorithms, instead it would be more appropriate to abandon the search for optimal solution and seek a good solution using heuristics. We propose, in the future research, using meta-heuristics such as genetic algorithms or simulated annealing to solve the proposed formulation. In solving this numerical example, first the HAS is formulated as an integer program, and then it is solved to obtain the optimal allocations. This procedure is repeated for several traffic scenarios and the corresponding "traffic scenarios-optimal allocations" are obtained. This statistical data is used to develop the HRS. The HRS consists of four distinct neural networks - single occupant car network, car pool network, transit network, and truck network. As there are four time intervals, four O-D pairs, and four vehicle classes there will be 64 tripdeparture time combinations. For each vehicle class, there exist 16 trip-departure time combinations that will be used in building the neural networks. Several traffic scenarios (the total demand D, for all trips during all four time intervals) are randomly generated using
Highway space inventory control system 57 normal distribution (mean and variance are shown in Table 1). For each scenario, we also need to know the exact time points at which the reservation requests will be made in order to obtain the cumulative requests plots for each trip-departure time combinations. It is assumed that the two successive reservation requests have a time headway that is exponentially distributed (mean value 'X' is calculated using the demand D,, assuming that the advance booking system is opened 5 days before the trip's departure time, and is open for 12 hrs a day). For each scenario, we run the HAS and obtain the optimal allocations Dc and hence the closing time Tc for each trip-departure time combination. In this way we have the complete cumulative plots for all trip-departure time combinations for each scenario. As discussed in the methodology earlier, the 'advance booking interval' in the cumulative requests plot of all trip-departure time combinations is divided into smaller time intervals. In the numerical example used for illustrating HAS, 'advance booking interval' is divided into 25 smaller intervals (reservation system is assumed to be opened 5 days prior to the trip's departure time, and each day is divided into 5 intervals of 2.4 hrs each, starting at 7 am and ending at 7 pm). For each time point Tr, the corresponding cumulative demand Dr (neural network input) and time AT (neural network output) can be obtained from the cumulative plot. Table 1: Mean and standard deviation of demand Interval 7:00-7:15
7:15-7:30
7:30-7:45
7:45-8:00
Vehicle Class
(entl,ext2)
Single Occ Car Car Pool Transit Vehicle Truck Single Occ Car Car Pool Transit Vehicle Truck Single Occ Car Car Pool Transit Vehicle Truck Single Occ Car Car Pool Transit Vehicle Truck
V800 100 20 75 875 110 25 80 950 120 30 90 1000 130 35 100
a 75 20 5 15 75 20 5 15 75 20 5 15 75 20 5 15
(entl,ext3) V1000 75 25 100 1075 85 30 110 1150 100 35 120 1200 110 40 125
a 75 20 5 15 75 20 5 15 75 20 5 15 75 20 5 15
(ent2,ext3) a V750 75 100 20 30 5 75 15 825 75 110 20 35 5 85 15 900 75 120 20 40 5 95 15 950 75 130 20 45 5 110 15
(ent3,ext3)
a 900 75 25 80 975 85 30 90 1050 100 35 105 1100 110 40 115
75 20 5 15 75 20 5 15 75 20 5 15 75 20 5 15
For neural network training, 500 different traffic scenarios are randomly generated using the mean and standard deviation values shown in Table 1. Based on this data, a multilayer perceptron (MLP) network with low level of complexity (only one hidden layer) and full connectivity is developed using Neuro Solutions tool. MLP consists of 16 processing elements (PEs) in the input layer, one hidden layer with 10 PEs, and 16 PEs in the output layer. The number of epochs for which the training is done is 1000, and the transfer function used is tanhaxon. The calculated error backpropagates and the weights are adjusted using gradient descent rule. The learning rule used between the input layer and the hidden layer is based on momentum, with a normalized step size of 0.1, and momentum rate of 0.7. The
58 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction learning rule used between the hidden layer and the output layer is also based on momentum, with a normalized step size of 0.02, and momentum rate of 0.7. The trained network is tested using data that was not used for training (250 new scenarios are randomly generated from the data shown in Table 1); the results of testing are shown in Figures 5, and 6. For every vehicle class two types of plots are plotted (only plots of single occupant cars are shown in this paper). The first type of plot, 'Neural network model output vs Desired output', plots the neural network's predicted output on the Y axis against the desired output of the testing data (desired output is obtained from the optimal solution of the HAS) on the X axis. The data points (driver requests) in the first quadrant have positive value of'AT' for both the neural network model and the desired solution, which means that all these requests will be accepted by the HRS. Same is the case with data points in third quadrant, all these requests will be rejected by the HRS. So, if we view this plot as a way to check the HRS's accuracy in making decisions, then only the data points in second and fourth quadrant are the wrong decisions (see Table 2). The second type of plot shown is the 'Error frequency plot' which is a mere depiction of the frequency of the error in A T value (neural network predicted AT - desired AT). On X axis the error value is shown and on Y axis the frequency of this error is plotted. The results shown in Figures 5, 6, and Table 2 illustrate that the HRS is capable of achieving a very high percentage of correct predictions of the decisions (acceptance/rejection of the user reservation requests).
Figure 5: Neural network model output vs optimal desired output - Single occupant cars
Highway space inventory control system 59 Table 2: Percentage of correct predictions by the Highway Reservation System Vehicle Class Single Occ Car Car Pool Transit Vehicle Truck
Percentage of Correct Decisions (Acceptance/Rejection) 96% 94% 87% 93%
Figure 6: Error frequency plot - Single occupant cars
FUTURE RESEARCH There are still a lot of open questions that should be answered in the future research. The most important of them include, treatment of emergency trips, identification of all market segments, issues of privacy, consequences of rejections on the backgrounds of equity, responses of rejected travellers such as re-requests, and definition of fair pricing/priority mechanisms for various countries and various rural and urban geographical areas. In the current system, a person who does not reserve cannot use the highway. The person then may shift the time of departure, shift the mode, change the route, or completely quit the trip. Including such behaviour shifts in the model, could further assert the validity of the proposed HSICS.
60 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction It would be interesting to model the HSICS in combination with time-varying pricing strategy. For example, a driver needs to pay more if he or she wishes to use the highway facility in most preferable time. Daily commuters who know that they are going to work during every week day might want to reserve the highway space for the entire year in one day. Such trips may be given more priority as they are helping in decreasing the uncertainty in the travel demand for a year. Research related to the amount of priority that needs to be given to the commuters is also an important area for future research.
CONCLUSIONS In this paper, a new demand management concept - Highway Space Inventory Control System (HSICS) is proposed and modelled. The basic idea of the HSICS is that all road users have to make advance reservations to travel on the highway. Such a reservation system is flexible and could be applied during peak hours throughout the highway or only on highly congested sections of highways, or through out the day on highways depending on the requirements and considerations of road users, policy makers, and other relevant stakeholders. The proposed HSICS model consists of two modules - Highway Allocation System (HAS) and the Highway Reservation System (HRS). HAS is an offline module that allocates the highway sections to various vehicle types (single occupant cars, carpools, public transit, trucks) during different time periods with the goal of optimizing the objective function(s) value(s) subject to the existing supply and demand constraints. It develops the optimal highway allocations for different traffic "scenarios". The "traffic scenarios - optimal allocations" data obtained in this way enables the development of HRS. HRS is the on-line system that makes on-line decisions regarding the possibility to accept driver requests. The proposed model is illustrated using a numerical example of a highway section. The optimal allocation is obtained offline for a particular arrival pattern (the solution from the integer programming) and the performance of the proposed neural network can be checked against the optimal allocation. Many tests show that the outcome of the proposed neural network that is making real-time decisions to accept/reject the driver requests is nearly equal to the optimal solution. Further exploration of other objective functions will be necessary for specific application of the proposed procedure. On one hand, problem solving by optimization (or heuristic) technique and neural network training are time consuming procedures. On the other hand, the response time for the trained neural network is practically negligible. In other words, creation of the proposed Highway Space Inventory Control System might be time consuming, but once the system is created, it can be effectively used in real-time decision making. One of the goals of this research is also an attempt to develop new approaches for solving a class of complex real-time problems that are characterized by uncertainty. The proposed system could be treated as an "intelligent" system, because of its ability to recognize different
Highway space inventory control system 61 situations, as well as its ability to make the appropriate decision without knowing the functional relationships in effect between individual variables. The developed system is able to generalize, adapt, and learn based on new knowledge and new information. There are numerous transportation and logistic problems where this research could apply. The proposed concept is especially important for research activities whose unified themes are uncertainty (randomness, stochasticity, and fuzziness) and time-dependence (dynamic, real-time).
ACKNOWLEDGMENT Authors are grateful to the reviewers for their valuable comments and suggestions for the improvement of the paper.
REFERENCES Abdelghany, A. F., K. F. Abdelghany, H. S. Mahmassani and P. M. Murray (2000). Dynamic traffic assignment in design and evaluation of High-Occupancy Toll lanes. Transport. Res. Rec, 1733, 39-48. Akahane, H. and M. Kuwahara (1996). A basic study on trip reservation systems for recreational trips on motorways. In: Proceedings of the 3rd World Congress on Intelligent Transportation Systems, pp. 1-7, ITS America, Washington D.C. Belobaba, P. P. (1987). Airline Yield Management: An overview of seat inventory control. Transport. Sci., 21, 66-73. Brumelle, S. L. and J. I. McGill (1993). Airline seat allocation with multiple nested fare classes. Oper. Res., 41, 127-137. Cross, R. G. (1997). Revenue Management. Broadway Books, New York. Dahlgren, J. (2002). High-occupancy/toll lanes: where should they be implemented. Transport. Res. A-Pol, 36, 239-255. de Feijter, R., J. M. Evers and G. Lodewijks (2004). Improving travel-time reliability by the use of trip booking. IEEE T. Intell. Transport. 5, 288-292. de Palma, A. and R. Lindsey (2002). Private roads, competition, and incentives to adopt timebased congestion tolling. J. Urban. Econ., 52, 217-241. Giuliano, G., D. W. Levine and R.F. Teal (1990). Impact of High Occupancy Vehicle lanes on carpooling behavior. Transportation, 17, 159-177. Jayakrishnan R., W.K. Tsai and A. Chen (1995). A dynamic traffic assignment model with traffic-flow relation ships, Transport. Res. C-Emer., 3, 51-72. Koolstra, K. (1999). Slot allocation on congested motorways: An alternative to congestion pricing. In: Proceedings of Seminar D at the AET European Transport Conference, pp. 343-353, Cambridge, U.K. Littlewood, K. (1972). Forecasting and control of passengers bookings. In: AGIFORS Symposium Proceedings, Vol 12, pp. 95-117. Mahmassani, H. S. and S. Peeta (1993). Network performance under system optimal and user equilibrium dynamic assignments: Implications for ATIS. Transport. Res. Rec, 1408, 83-93.
62 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Murray P. M., H. S. Mahmassani and K. F. Abdelghany (2001). Methodology for assessing HOT lane usage and network performance. Transport. Res. Rec, 1765, 8-15. Phang S. Y. and R. S. Toh (2004). Road congestion pricing in Singapore: 1975 to 2003. Transportation, 43, 16-25. Teodorovic, D. and K. Vukadinovic (1998). Traffic Control and Transport Planning: A Fuzzy Sets and Neural Networks Approach. Kluwer Academic Publishers, Boston. Teodorovic, D., J. Popovic, G. Pavkovic and S. Kikuchi (2002). Intelligent airline seat inventory control system. Transport. Plan. Techn., 25, 155-173. Verhoef, E. T. (2002). Second-best congestion pricing in general networks: Algorithms for finding second-best optimal toll levels and toll points. Transport. Res. B-Meth., 36, 707-729. Vickrey, W. (1963). Pricing in urban and suburban transport. Am. Econ. Rev., 53, 452-465. Vickrey, W. (1969). Congestion theory and transport investment. Am. Econ. Rev., 59, 251261. Vickrey, W. (1994). Statement to the joint committee on Washington, DC, Metropolitan Problems. J. Urban. Econ., 36, 42-65. Wong, J. T. (1997). Basic concepts for a system for advance booking for highway use. Transport Policy, 4, 109-114. Yang, H. and H. J. Huang (1999). Carpooling and congestion pricing in a multilane highway with high-occupancy-vehicle lanes. Transport. Res. A-Pol., 33A, 139-155. Yang, H. and X. N. Zhang (2003). Optimal toll design in second-best link-based congestion pricing. Transport. Res. Rec, 1857, 85-92. Zhang, X. N. and H. Yang (2004). The optimal cordon-based network congestion pricing problem. Transport. Res. B-Meth., 38B, 517-537.
4
PATH SIZE AND OVERLAP IN MULTIMODAL TRANSPORT NETWORKS Sascha Hoogendoorn-Lanser, Rob van Nes, and Piet H.L. Bovy, Delft University of Technology, Faculty of Civil Engineering and Geosciences, Transport & Planning, The Netherlands
INTRODUCTION Overlap in route choice is a well-known problem in travel analysis. Due to overlap, alternatives are no longer independent, while it is unknown how overlap influences traveler's choice behavior. Having overlapping alternatives might be seen as an attractive phenomenon, since travelers have the opportunity to switch between routes during their trip, e.g. in case of incidents. In contrast, the fact that alternatives overlap leads to a statistical correlation between alternatives which should be accounted for modeling route choice behavior. Theoretically, the Probit model is able to model overlapping routes correctly (Bovy 1990; 1996). However, the fact that the Probit model cannot be solved analytically makes Logit models the most used tools for modeling travel behavior. The disadvantage of the basic Logit model, i.e. the Multinomial Logit model (MNL), is that all alternatives are assumed to be independent (IIA-property). Overlapping routes certainly do not meet that requirement. Therefore, in literature different extensions of the MNL model are proposed, ranging from methods focusing on the statistical correlation (e.g. Logit-Kernel) to methods that take overlap into account while maintaining the simplicity of the MNL (e.g. C-Logit and Path Size Logit). In this paper we focus on the Path Size Logit as proposed by Ben-Akiva & Bierlaire (1999) and Ramming (2002). Path Size Logit has a theoretical basis in discrete choice theory, while Ramming showed interesting results for route choice in uni-modal (road) networks. In our study we used Path Size Logit for analyzing pre-trip route choice in multi-modal transport networks under recurrent conditions. We found that in a multi-modal context the units, in which the Path Size is measured, require special attention. Furthermore, the interpretation of the results and a comparison with the results of Ramming, give reasons to review the way the
64 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Path Size is formulated and should be interpreted. A distinction should be made between a Path Size definition that is an approximation for the overlap in a choice set, and a definition that adds an additional behavioral element in the choice model. In the latter case, there appears to be strong asymmetry in the way the overlap between two routes is accounted for. This new component might be seen as an additional decision mechanism in the choice model. An alternative interpretation might be that specific Path Size definitions capture non-linear characteristics in choice behavior. The distinction in two types of Path Sizes also sheds new light on the findings presented by Ramming (2002) and Bekhor et al. (2002). The paper is structured as follows. First a brief classification of methods to account for overlap in route choice models is presented, with special attention to the way Path Size is defined. Next, an analysis of overlap characteristics in multi-modal networks is given, leading to additional measurements of the Path Size. This is followed by an analysis of Path Size Logit models for multi-modal route choice, using various definitions and measurements for the Path Size. The results will be compared with those found by Ramming (2002) for uni-modal networks. The new interpretation of the Path Size will be presented next, followed by a summary of the main conclusions.
MODELING OVERLAP MNL is a useful modeling approach for all kinds of choice processes. With respect to route choice, MNL has a serious drawback: it is assumed that error terms are independent and identically distributed (i.i.d.) Gumbel, leading to the Independence from Irrelevant Alternatives (IIA) property. In route choice, however, alternatives are often correlated. This limitation does not apply to the Probit model in which the error term covariance matrix allows to account for all kinds of correlations. The covariance matrix for a choice situation having n alternatives can be written as:
cov( e )= °» <7Bl
a
*
"
(1)
a]
with £=(Sl,...,Sn)
Gi = variance of route i ay = covariance of routes i undj Since this matrix is symmetrical, this description yields n(«+l)/2 additional parameters to be estimated. In order to simplify the estimation of Probit models the structure of the covariance matrix is often defined beforehand, based on characteristics of the choice situation. Bovy (1990, 1996) suggests that by assuming that
Path size and overlap in multi-modal transport networks 65 the correlation between alternatives only results from physical overlap, the overlap is independent of other route parts, the variance corresponds with the length of the overlap, Equation (1) can be replaced by the following expression, having only a single parameter &.
cov(s)«0-
7
7
7
Za
Zl
'
2
\n
'
(2)
Z
n
With Zt = length of route i Zy = length of overlapping route parts between routes i andy In this case the covariance matrix is indeed symmetrical, since the covariance is defined by the length of the overlap between two routes, which is independent of the order of the routes that are considered. It should be noted that although overlap is intuitively related to distance, the length of overlap might also be measured in different units, such as travel time. In the following section the measurement of overlap in case of multi-modal transport networks will be discussed in more detail. Looking at the extensions of the MNL we observe that all approaches borrow some properties from the way the Probit model deals with overlap. Three types of extensions can be distinguished: 1. models that apply a covariance matrix (e.g. Logit-Kernel); 2. models using a nested choice structure (e.g. Link-Cross-Nested, Paired Combinatorial Logit); 3. models including an overlap factor in the utility function (C-Logit, Path Size Logit). These basic types will be briefly discussed in the following subsections. Including covariance information The Logit-Kernel model was proposed by Walker (2001). Bekhor et al. (2002) and Ramming (2002) describe an application to real size road networks. The error term in the utility function is split into a part related to the correlations, based on i.i.d. random variables with zero mean and unit variance, and a Gumbel distributed error term, as follows: U = PTX + S = PTX + FT^ + U (3) where U = vector of utilities P = vector of unknown parameters X = matrix of explanatory variables F = factor loading matrix T = lower triangular matrix of unknown parameters 4" = vector of i.i.d. random variables with zero mean and unit variance v = vector of i.i.d. Gumbel variables with scale parameter ju
66 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction This division in two parts yields the following formulation for the covariance matrix: cov(s) = FTTTFT+
-^ /
(4)
with g = variance of a standard Gumbel variable (n2/6) I = identity matrix In the applications of Bekhor et al. (2002) and Ramming (2002) matrix F is defined as the link-path incidence matrix, while matrix T describes the error variances of the link attributes, which are based on the length of the links. Given these assumptions the first part of the covariance matrix in Equation (4) becomes identical to the matrix defined in Equation (2). This approach has been applied to analyze uni-modal route choice in the Boston area, using choice sets for 188 respondents each having at most 51 alternatives. Results showed that the LogitKernel model based on this specification outperforms the MNL model, and even all other extensions of the MNL analyzed by Ramming: the log likelihood was improved by more than 5%. However, it should be noted that the values and significance of many parameters of the original MNL dropped substantially, hampering the interpretation of the resulting model. Furthermore, the estimation process required substantial computation time (up to 2.5 days), while the stability of the solutions is a point of concern. It can therefore be concluded that the Logit-Kernel model certainly is promising, but needs further research to be applicable for route choice problems.
Nested approaches The second approach uses the concept of choice hierarchy: travelers are assumed to choose first a set or nest of alternatives and subsequently choose an alternative within that set. In route choice problems, however, it is usually not possible to distinguish crisp sets of routes: routes overlap with many other routes (complex overlap patterns). Two approaches suited for route choice modeling can be found in literature: Cross Nested Logit (CNL) and Paired Combinatorial Logit (PCL). CNL allows an alternative to belong to multiple nests by using a weight factor describing the extent to which it belongs to a certain nest. Vovsha & Bekhor (1998) present CNL for route choice problems, where choice probabilities are given by:
XK-exp(^))i(EK.-exp(^))-f p
P(i\C.) = Z (i\C~YP(C~.\C,) = -
7
—
fy
—
t Z(v«p(»o)H »=i UeC™
)
with P(i\Cn) = probability of alternative i given choice set Cn Cn = set of alternatives Cmn = subset of Cn of alternatives that are included in nest m ami = allocation parameter expressing extent to which route i belongs to nest m jum = scale factor for nest m
(5)
Path size and overlap in multi-modal transport networks 67 M = number of nests Vovsha & Bekhor (1998) define a nest for each links in the choice set (upper level) with the routes being at the lower level. The allocation parameters for a nest are then defined as: a*=~** z
(6)
i
with za = length of link a Zj = length of route i Sai = link-route incidence indicator (1/0) It should be noted that this formulation for aai implies a kind of asymmetry: in case of two routes having one link in common the weight attached to each of these routes differs because of differences in route length. In case that the routes have similar lengths, the impact of asymmetry will be limited. It is obvious that the resulting nesting scheme is very large and complicated, making the estimation of CNL models computationally cumbersome. Application to the Boston area dataset showed that CNL model significantly improves the MNL model: an increase in log likelihood by 1.6% (Ramming 2002). Finally, it should be noted that from the traveler's perspective, the nesting does not look very realistic. It is not likely that travelers choose links prior to the decision which route to take. The PCL model defines all possible pairs of routes within the choice set (Koppelman & Wen (2000)) to be nests. The probability of route i thus depends on the attractiveness of route i and that off all pairs containing route /:
with rjij = similarity index between alternatives i andj The similarity index can be defined as: y]zi+zi
Please note, that the definition for rjy is symmetric for each pair of routes. Just as the CNL, the nesting structure is excessive, making it difficult to estimate. The PCL model is simple to implement, as can be seen by the application of PCL to multi-modal route choice by Benjamins (2001) and Benjamins et al. (2002). Finally, the behavioral perspective of PCL is unclear. In case of large numbers of alternatives, travelers are not assumed to be able to compare all pairs of alternatives systematically.
68 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Additional utility component The third category of extensions known to cope with overlap tries to maintain the simplicity and effectiveness of the MNL model. This is done by adding a component to the utility-function describing somehow the overlap with the other alternatives in the choice set. Cascetta et al. (1996) propose the C-Logit model in which a commonality factor CF is introduced: exp(F.+CF. ) J£Cn
Cascetta et al. (1996) present four definitions of the commonality factor, and used the second one to model intercity route choice for truck drivers. These definitions are:
f zY CFin = -Po In Y — ^ -
(10-1)
CFb=-0o-\1iY.TN»
(10 2)
"
aeT, A'
CFL—yVZ^rM^)
CF
"-PA1+
ihfrlf^]]
(10-3)
(104)
-
where Po, Y = coefficients to be estimated Pi = set of links in path i Nan = number of alternatives of set n using link a Only the formulation given in Equation (10-1) is symmetric, that is, the order routes i and/ are considered does not influence the value of the commonality factor. In the other cases differences in route length will lead to an asymmetry. The lack of theoretical guidance on the definition of the commonality factor, is reason for Ben-Akiva & Bierlaire (1999) to propose the Path Size Logit (PSL). The notion of Path Size is based on the application of discrete choice theory for aggregate alternatives, such as might be used for destination choice modeling (Ben-Akiva & Lerman (1985)). Ramming (2002) presents the basic Path Size model as:
exp(K. +p-\n(PS. ))
Xexp^.+ZMn^,)) where P
Sin=Y(— ] —
(12)
<«r, Vz i J 7V ™
The Path Size factor (PS) varies between 0 (full overlap) and 1 (no overlap or unique route), which makes it easy to interpret. Please note that compared to the commonality factor the natural logarithm and the weight /? are switched from the factor definition to the Logit speci-
Path size and overlap in multi-modal transport networks 69 fication. The Path Size factor also is asymmetric, because its value depends on the length of each route. Ben-Akiva & Bierlaire (1999) and Ramming (2002) propose an extension to the Path Size factor in order to prevent long routes having a low probability yielding a large amount of overlap for attractive short routes, which would make them less attractive. The Extended Path Size factor is defined as: EPS- = Y —
(13)
5z
' 'x(ff. with EPS = extended Path Size factor X = Size Assignment Parameter (SAP) The SAP works as follows. If route i is the shortest route, the ratio of the route lengths will be smaller than 1 for all routes except itself. If the SAP is high, the summation of the ratios will tend to go to 1, thereby assigning the size of the overlap related to link a fully to the shortest route. For all longer routes using link a, the ratio of the route lengths will be larger than 1. Combined with a high value of the SAP, this will result in assigning no size at all. Ramming (2002) found that for the Boston area data, high values of the SAP (his analysis suggested infinity) yielded best results and outperformed the C-Logit models: a log likelihood improvement of 4.3%. Discussion There appears to be two characteristics in which the methods differ: whether the overlap is expressed at route level (Zy) or at link level (za); whether there is symmetry in the overlap factors or not. Table 1: Summary of modeling approaches dealing with overlapping alternatives Category
Modeling approach
Covariance information
Probit Logit kernel Cross Nested Logit Paired Combinatorial Logit C-Logit
Nested approaches Additional utility component
Path Size Logit Extended Path Size Logit
Overlap expressed at route or link level Route level Route level Link level Route level Route (10-1,10-4)/link (10-2,10-3)level Link level Link level
Symmetry Yes Yes No Yes
Yes (10-1)/No No No
Table 1 summarizes these characteristics for the methods described. If overlap is expressed at route level, there is usually symmetry in the corresponding overlap factors. The only excep-
70 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction tion to this rule is fourth definition of the commonality factor of the C-Logit model (Equation 10-4). For the link-based methods, the overlap factors usually depend on the length of the route that is considered. In case of overlap, the same link may therefore lead to different overlap factors for the routes involved. However, when the differences in route lengths are small, the asymmetry will be of minor importance. Furthermore, link-based methods may include a weight for the number of routes using the link, which is not relevant for route-based methods. All methods described use the length of overlapping route parts as the basis in their analyses, be it as an estimate of the covariance matrix, as the weight of the nests, as the similarity parameter, as the commonality factor, or as the Path Size factor. The latter factors can be seen as a kind of summation of the rows of the covariance matrix given in Equation (2), while the weighing with the number of alternatives containing the same route parts is a proxy for the information in the column of the covariance matrix. Both methods can thus be seen as approximations of the information in the covariance matrix. The inclusion of the overlap reduces the attractiveness of routes having an overlap. For C-Logit and Path Size Logit this mechanism is obvious. In the CNL model the inclusion weight aai reduces the probability of route i in a similar way as the Path Size factor, as can be seen from the following equation: « o ,.-exp(^) = exp(^+In («„,.))
(14)
Similarly, in case of overlap the similarity index rjy in the PCL model also reduces the attractiveness of both alternatives i and_/. The introduction of the SAP in the Extended Path Size factor (Equation (13)), however, requires additional attention. First of all, the argument that long routes might excessively penalize shorter routes with respect to the Path Size factor, is also an assessment of the quality of the choice set. It might be argued that properly constructed choice sets should not contain routes that are substantially longer with respect to important variables in the utility function, since these are likely to be fully dominated routes. Second, and more important, the use of the SAP essentially changes the way the Extended Path Size factor works. Whereas the basic definition of the Path Size factor may be seen as an approximation of the covariance matrix, in the extended version this is no longer true. It is generally assumed that the structure of the covariance matrix is symmetric. The fact that in the Extended Path Size factor the size of the overlap is primarily, and if SAP equals infinity even fully, assigned to the shortest route, suggests an asymmetric covariance structure, or, more likely, a different mechanism related to overlap that explicitly favors the shortest route. In the following sections we will explore both the original Path Size factor as well as the Extended Path Size factor for route choice modeling in multi-modal networks, and show that the Extended Path Size indeed incorporates a different mechanism related to choice behavior and overlap.
OVERLAP IN MULTI-MODAL NETWORKS
Defining and measuring overlap In road networks the definition of overlap appears to be straightforward. Usually it is based on the 'length' of overlapping paths, either in time or in distance. In contrast to road networks,
Path size and overlap in multi-modal transport networks 71 however, route choice in multi-modal trip making has multiple dimensions, such as the time dimension due to the inclusion of scheduled transport services, and the distinction of the various modes and services that might be used. Furthermore, the nodes themselves, such as boarding, alighting and transfer nodes, may have important properties of their own, e.g. shops and travel facilities. Therefore, there are many possibilities for defining overlapping components relevant for route choice modeling: nodes (boarding and alighting stops and transfer locations); modes (private (walk, bicycle, car) or public transport modes (bus tram, metro, train)); services (local, express, intercity trains); paths (common public transport lines); links (roads, railways); runs (including the time dimension). From a behavioral perspective, routes having one or more of these components in common are not independent of one another. They share common unobserved aspects that are related to those specific components. Each option leads to different consequences for route choice modeling. Since travelers usually describe multi-modal routes as a set of legs, e.g. bike and train, we will apply a similar definition in our study. A leg then is defined as a part of a trip between two nodes in which a single mode or service type is used (without transferring). The only exception to this rule are walk access and egress to and from urban public transport, which are considered to be part of a urban public transport leg. Please note that this definition of a leg incorporates the first three options for overlapping components mentioned above: nodes, modes and services. More detailed descriptions, such as based on links and runs are left for further research. Compared to the formulae above, such as Equations (12) and (13), link a should be replaced by leg a. For the way the length of a leg is measured we will analyze three different measurements: occurrence of a leg in an alternative; travel time; i.e. expected (private modes and waiting) or scheduled travel time (invehicle times public transport). Using actual travel times would have the theoretical disadvantage that overlap might vary as travel times vary over time for instance due to congestion or to service irregularities; distance. Overlap characteristics of multi-modal route choice sets For the analysis of multi-modal travel behavior a survey has been conducted for train travelers in an urbanized corridor in The Netherlands (Hoogendoorn-Lanser (2005)). The survey focused on a (multi-modal) trip (modes used, transfer nodes, boarding and alighting nodes) and the alternatives known by the traveler. The survey data was extended with detailed data on all trip components, such as travel time and costs, as well as with similar data for all other reasonable non-reported alternatives for the same trip. In total, the dataset contains detailed trip data for 708 respondents. The number of legs of an alternative ranges from 3 to 6. The number of alternatives known by the traveler is limited, often only 1, while the maximum
72 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction number is 7. The number of reasonable alternatives, however, is very large. For one respondent even a total of 278 alternatives was generated. These reasonable routes were generated using a choice set generation algorithm that is combinatorial and generates an exhaustive set of alternatives, albeit within a set of temporal and behavioral constraints. Temporal constraints define the time band for alternatives relative to the timing of the chosen trip, whereas behavioral constraints refer to minimum and maximum values for distances, travel times, modal combinations, transfer characteristics and the like are derived from the Dutch National Travel Survey1. These constraints are further optimized using observed trips and reported subjective choice sets. As a result, generated choice sets include both chosen trips and reported non-chosen alternatives. A more detailed description of the data collection and the dataset can be found in Hoogendoorn-Lanser & Van Nes (2004) and in Hoogendoorn-Lanser (2005). For this data the overlap was determined according to the definitions given above: legs, travel time, and distance. For computational reasons, the maximum number of alternatives considered in this analysis is limited to 50 alternatives (that is 49 random draws from the full set of alternatives plus the chosen alternative). The average choice set size is 33 alternatives. The number of alternatives with which an alternative overlaps appears to be quite large. On average an alternative overlaps with 23 other alternatives with 16.5 alternatives having a single overlapping leg and 5.5 alternatives having two overlapping legs. These high numbers of overlapping alternatives suggest that the number of unique alternatives is relatively small. The number of overlapping legs thus is often restricted to one or two legs. Given the fact that most trips consist of three legs, the overlap is usually 1/3 or 2/3 of an alternative. Figure 1 shows the cumulative distributions of the number of overlapping alternatives for the main trip parts and for the main modes and services. The steeper the curve, the more unique that part or that mode or service is. With respect to overlap patterns it thus appears that: home-end legs are more frequently common in alternatives than activity-end legs and train legs: especially car legs are more often common than cycling and walking legs, while tram, bus and metro legs have equal degrees of commonality; Intercity train service legs are more common in alternatives than express train and local train service legs. The explanation for this pattern is that 'fast' legs, such as bike and car for access and egress parts and Intercity train services for the train part, offer more possibilities for combinations with alternative legs for the other parts of the trip, without yielding unreasonable alternatives, such as alternatives having excessive travel times. For instance, the total travel time of the combination consisting of urban public transport for the home-end and activity-end parts of the trip combined with local train services, is often too large to be considered as a realistic alternative. The dominant role of the home-end leg results from the fact that at home-ends of trips more 'fast' modes are available than at activity-ends. Please note, that these findings indicate that overlap in a multi-modal route choice set is likely to occur in case of attractive route parts. The differences in overlap among routes are clearest if the overlap figure is based on number of legs. Differences become smaller if other expressions are considered, especially The Dutch National Travel Survey is conducted by CBS, which collects travel data for more than 70.000 households annually, resulting in 600.000 trip records.
Path size and overlap in multi-modal transport networks 73 in case of distance. This suggests that the number of legs might provide the best insight into the influence of overlap on travel behavior. Furthermore, it should be noted that the alternatives vary in length when overlap is measured in terms of number of legs or travel time, while having equal lengths if based on distance. This can be seen in Figure 2, which shows the distribution of the ratio between route length and the median route length of the corresponding choice set. This finding implies that in the latter case only the basic Path Size factor should be used. For the first two definitions the Extended Path Size factor might be appropriate.
Figure 1: Cumulative distributions of number of overlapping routes for trip parts, train service types, private modes and public transport service types respectively (708 respondents and 24,300 alternatives).
74 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Figure 2: Distribution of ratios of route length and median route length of the corresponding choice set, where route length is expressed in number of legs, time, or distance respectively (708 respondents and 24,300 alternatives).
PATH SIZE IN MULTI-MODAL ROUTE CHOICE MODELING
Path Size factor characteristics In this section we will show some characteristics of the Path Size factor, and especially look at the impact of the SAP in the extended Path Size factor. Path Size factors analyzed in this section are computed expressing route length in terms of number of legs. Figure 3 shows the distribution of the mean Path Size value per choice set as a function of the choice set size. As expected the mean Path Size factor decreases with choice set size. A similar effect can be seen for the minimum. For the maximum Path Size value the same type of graph looks scattered, but the there is still a descending pattern. In this case, however, the pattern is less clear due some relatively unique alternatives, which include legs with local train services. In the Extended Path Size factor the SAP influences the Path Size values. The impact on the mean Path Size value, however, is small. An increase of the SAP leads to higher values for the Path Size factor, especially when the choice set size increases.
Path size and overlap in multi-modal transport networks 75
Figure 3: The relationship between mean Path Size (expressed in terms of number of legs) per choice set and size of choice set (708 respondents) (SAP=Q). Table 2: Path Size (expressed in terms of number of legs) statistics of routes for different Path Size definitions.
Mean value
Standard deviation
Chosen routes Subjective non-chosen routes Objective non-chosen routes Chosen routes Subjective non-chosen routes Objective non-chosen routes
Path Size SAP=0 0.202 0.185 0.183 0.145 0.114 0.103
Extended Path Size SAP=infimty SAP=\A 0.252 0.253 0.214 0.213 0.189 0.189 0.165 0.163 0.127 0.126 0.120 0.118
Since the (Extended) Path Size factor is included in the utility function using a logarithm, a higher value of the Extended Path Size factor would imply that its influence would be smaller. However, when we look at the impact for specific types of alternatives, we get a better view of what the influence of the SAP is. Table 2 shows the mean and the standard deviation of the (Extended) Path Size factors for chosen alternatives, non-chosen subjective alternatives (i.e. reported alternatives), and remaining non-chosen objective alternatives (i.e. generated alternatives). Introduction of the SAP leads to an increase of the (Extended) Path Size values: for chosen alternatives the increase is more than 25%, while for the remaining non-chosen objective alternatives the increase is only 3%. The Extended Path Size factor thus tends to favor the chosen alternatives. Furthermore, the variation of the (Extended) Path Size factor values increases 10% to 15%, thus increasing the variation in utilities as well. These findings indicate that although mean (Extended) Path Size values increase, the use of the Extended Path Size factor might lead to better estimation results.
76 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Modeling approach The impact of the (Extended) Path Size factor on route choice modeling is analyzed by including both Path Size definitions, measured in number of legs, time, and distance in the best MNL model that could be established for the dataset (Hoogendoorn-Lanser, 2005). This model makes a distinction between home-end parts, train parts, and activity-end parts of trips, reflecting the theoretical notion that tours are better suited for choice analysis in multi-modal networks. In this way the difference in availability of modes and in knowledge of the transport system can be explicitly accounted for. The best MNL model consists of 25 parameters, nearly all of them are significant at a 95%-confidence level, describing mode-specific constants for home-end and activity-end, and parameters for in-vehicle times per mode, train types, railway station types, costs for urban public transport (UPT) and parking, UPT headway, walking time to UPT-stops, and number of high- and low-frequency legs (the scaled parameter values are shown in the Appendix). The analysis focuses on model performance, i.e. final log likelihood, and the value of the parameter for the (Extended) Paths Size factor /?. Ben-Akiva & Bierlaire (1999) and Ramming (2002) state that following discrete choice theory p should have the value 1. However, as we have seen earlier the (Extended) Path Size factor is an approximation of the correlation between alternatives. This is certainly true for the Extended Path Size factor. Furthermore, travelers might have a positive or negative perception for overlapping route parts. Both arguments imply that ft should not be set to 1 (see also Hoogendoorn-Lanser et al, 2005). hi the analysis we will analyze both situations.
Modeling results: Path Size model In this section we will focus on the Path Size factor defined in Equation (12), which can be seen as an approximation of the covariance matrix. The results of the choice modeling can be seen in Table 3. Table 3: Modeling results for the Path Size Logit model. Model
Unit of overlap
/7 estimated or set to 1
Log likelihood
PS-6 PS-7 MNL PS-1 PS-2 PS-8 PS-3
Distance Time None Distance Time Number of legs Number of legs
1 1 02 0.211 1 0.55
-1656.72 -1634.95 -1616.39 -1616.39 -1615.05 -1613.92 -1608.10
Difference in log likelihood compare!i to MNL Relative Absolute -2.5% -40.33 -18.56 -1.1% Reference Reference 0.0% 0.00 1.34 0.1% 0.2% 2.47 8.29 0.5%
different from 0 at a 90%-confidence level P is estimated, but its value turned out to be not significantly different from zero, and thus PS-1 collapses into the MNL-model.
A first observation is that if the Path Size factor is expressed in time and distance, the impact on model performance is small, and in case ft is set to 1 the impact is even negative. Appar-
Path size and overlap in multi-modal transport networks 77 ently, overlap measured in time or distance does not match the way travelers perceive overlap in multi-modal route choice. However, if the Path Size factor is expressed in number of legs, there is an improvement in model performance, albeit small. It appears that J5 should be estimated and has a value 0.55, which is significantly different from 0 as well as 1. This low value means that the Path Size factor overestimates the correlation as it is perceived by travelers. The improvement of the log likelihood is limited to 0.5%, however, it is even higher than the improvement found by Ramming. Furthermore, nested hypothesis testing shows that the improvement in log likelihood value in the Path Size model is significant. In case that no SAP is applied and the Path Size factor is expressed in free flow travel time the improvement he found was 0.2%, while for two C-Logit definitions the increase was only 0.1% and 0.3% (using Equations (10-1) and (10-4) respectively). Modeling results: Extended Path Size model The Extended Path Size Logit model is applied for Extended Path Size factors expressed in number of legs and time. Since the differences in route length measured in distance are minimal (see Table 4), the SAP would have a minimal effect. Table 4 shows the results for both expressions for the optimal value for SAP, which is equal to 14 and 0 if the Extended Path Size factor is measured in number of legs and time, respectively. As references the results of the MNL and best Path Size model (PS-3) are included. It can clearly be seen that using a high value for the SAP, while expressing the Extended Path Size in time, leads either to an inferior model or to a /?that is not significantly different from 0. When Extended Path Size is expressed in time and j3 is set to one, the optimal log likelihood value is obtained when SAP is equal to 0, thus for a Path Size model instead of an Extended Path Size model. When Extended Path Size is expressed in time and /? is estimated, /? decreases from 0.21 (SAP=0) to 0 (&4P=oo). Table 4: Modeling results for the Extended Path Size Logit model. Model
Unit of overlap
P estimated
or set to 1
SAP
Log likelihood
Difference in log likelihood comparec1 to MNL Relative Absolute -
-00 00 Time 1 None Reference -1616.39 Reference oo Time 02 0.0% 0.00 -1616.39 Time 1.34 0.21' 0.1% 0 -1615.05 Number of legs -1608.10 0.55 0 8.29 0.5% 1 Number of legs 14 21.79 -1594.60 1.3% Number of legs 22.63 0.84 -1593.76 14 1.4% different from 0 at a 90%-confidence level 2 p is estimated, but its value turned out to be not significantly different from zero, and thus PS-4 collapses into the MNL-model.
PS-9 MNL PS-4 PS-2 PS-3 PS-1O PS-11
78 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction In case of an Extended Path Size factor measured in number of legs, however, a substantial improvement (according to nested hypothesis testing) is achieved. Again, setting /? equal to 1 leads to a poorer performance. The best performance is achieved for SAP equaling 14 (determined after optimizing SAP), while jB is estimated. Apparently, higher values of the SAP overestimate the impact of overlapping alternatives. As can be seen in Figure 4, the variation in model performance is small for SAP-values greater than 10. In case of time, no optimal value for the SAP could be determined: the higher the value of SAP, the worse the performance. It should be noted that this finding is different from the findings by Ramming, who found that a value for the SAP of infinity yielded the best results. This difference is probably the result of the difference in the way in which the Extended Path Size factor is expressed. In case of free flow travel time, the variation in the ratio of route lengths for uni-modal networks will be small, compared to the variation in the ratio of route lengths expressed in number of legs for multi-modal networks. Including the Extended Path Size factor in the utility function has only a limited influence on the other parameters in the model (the complete modeling results for MNL, the Path Size factor, and the Extended Path Size factor for SAP=14 are included in the Appendix). Figure 5 shows the scaled parameters of the (Extended) Path Size logit models compared to those of the MNL model. Introducing the Path Size factor has the largest impact on the mode specific constants for the private modes and for bus and tram, which are reduced by about 10%. The Extended Path Size factor, however, also has a substantial impact on the parameters for the number of high and low frequency legs, which are reduced by more than 20%. A similar effect can be found in the results of Ramming. Introducing the Extended Path Size factor reduces the value of the parameters of variables associated with the units in which the Extended Path Size factor is measured. Finally, it should be noted that analyses with different choice sets yielded similar results.
Figure 4: Final log likelihood as a function of the Size Assignment Parameter of the Extended Path Size Logit model.
Path size and overlap in multi-modal transport networks 79
Figure 5: Relationship between parameter values of the MNL model and the (Extended) Path Size Logit models.
INTERPRETATION OF PATH SIZE MODELS Path Size The discussion on approaches dealing with overlap in Logit models suggested that the Path Size factor is an approximation for the covariance matrix. The application of the Path Size factor for multi-modal route choice showed that the modeling performance can be improved by introducing a Path Size factor, but the size of the improvement is limited to 0.5% at most. For uni-modal networks Ramming (2002) found similar results with improvements in the log likelihood of 0.3% at most, while the application of two other approaches showed clearly better results: 1.6% for CNL and 5.1% for Logit kernel. Both latter approaches take the overlap more fully into account than Path-Size logit or C-Logit. Hoogendoorn-Lanser (2005) also applied a Generalized Nested Logit model (Wen & Koppelman (2001)) for the analysis of route choice in multi-modal networks. In the GNL a distinction is made between public and private modes for both the home-end and the activity-end of the trip, which resulted in an improvement of the log-likelihood of 2.0%. Again the Path Size-Logit is outperformed. We conclude therefore that the Path Size factor accounts for the overlap in uni-modal and multimodal route choice in a limited way, while better modeling approaches are available. Furthermore, it should be noticed that the way in which the Path Size factor is expressed is clearly different for both applications. For multi-modal route choice, the Path Size factor should be measured in number of legs, while for uni-modal networks free flow travel time is more appropriate. However, habitual or perceived travel times might be more appropriate explanatory variables for route choice under congestion than free flow travel times.
80 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Extended Path Size The main reason for the introduction of the SAP in the Extended Path Size factor is the existence of long unattractive routes that might penalize attractive short routes too much. It stated before this reasoning also is related to the type of choice set. In our multi-modal analysis as well as in Ramming's analysis of uni-modal route choice, an extensive search for reasonable alternatives has been performed. Interestingly, both studies have choice sets of similar size of a maximum of 50 and 51 alternatives respectively. The results of both studies are therefore comparable in a certain way. Both the applications to multi-modal route choice and to unimodal networks show that the Extended Path Size factor yields a substantial improvement of model performance: 1.4% and 4.3% respectively. The difference in impact of the Extended Path Size factor might be explained by the fact that the models for the multi-modal case have more detailed utility functions containing twice as much parameters, which makes it more difficult to improve them. Furthermore, there is another difference between the multi-modal and the uni-modal case. For multi-modal networks an optimal value for the SAP could be established, while for uni-modal networks a value of infinity appeared to be optimal. The mtroduction of the Extended Path Size factor in the utility function leads to a drop in the value of the parameters related to the way the Extended Path Size is expressed. Apparently, the Extended Path Size factor captures part of the explanatory power of the related parameters. Since the Extended Path Size tends to penalize alternatives that are long in terms of the units in which the Extended Path Size is expressed, it is plausible that the Extended Path Size captures part of a non-linear relationship with respect to the number of legs for multi-modal route choice or free flow travel time for uni-modal route choice. A phenomenon found by Ramming is that the inclusion of the Extended Path Size factor in the CNL model and in the Logit-kemel model also improved the model performance: up to 4.9% and 7.0% respectively. In our discussion on approaches for accounting for route overlap, we stated that the Logit-Kernel takes overlap best into account. Furthermore, our analysis showed that that the Path Size factor does not properly account for the overlap in uni-modal and multi-modal route choice. The improvement of the performance of the Logit-Kernel (and for the CNL model as well) thus indicates that, for uni-modal route choice, the Extended Path Size factor captures a different phenomenon. For multi-modal route choice this finding could not yet be corroborated. Please note, that in the multi-modal case the specification of the nesting structure (private mode and public transport service types for the home-end and the activity-end of the trip) is strongly correlated with specification of the Extended Path Size factor, which complicates the combination of both approaches. If it is assumed that the Extended Path Size describes something else than the overlap of routes, the question then is what the Extended Path Size stands for. Please recall that the introduction of the SAP introduces a kind of asymmetry in the choice model. In case of overlapping routes, long routes are penalized by assigning a small Path Size, while short routes are favored by assigning a large Path Size. The analysis of the Extended Path Size factors above shows that this mechanism increases the differences between chosen and non-chosen routes. In case of multi-modal route choice, where the Extended Path Size is expressed in number of legs, this line of reasoning seems plausible. The chosen route in terms of number of legs is often 3 legs long. Routes having a longer length also have more transfers. Since it is well known that travelers dislike switching between modes or transport services, longer routes are thus
Path size and overlap in multi-modal transport networks 81 unattractive from the traveler's point of view. This also explains the high values for the parameters related to the number of high and low frequency legs in the basic MNL: -20.55 minutes and -24.70 minutes of train in-vehicle time, respectively. The difference between the MNL model and the Extended Path Size-logit model is that the MNL model penalizes all routes for having a number of legs, while the Extended Path Size factor only penalizes longer routes when it is sure that a shorter route exists. It might be stated that the Extended Path Size factor introduces a kind of if-then else decision rule for overlapping routes: shortest routes (i.e. in the units that Path Size is measured) gets full size, while all longer routes are penalized by a small size and thus a large disutility. Please note that such a decision rule is certainly defendable from a behavioral perspective, however, it is something else than accounting for the overlap. This mechanism also shows why an Extended Path Size in travel time did not lead to substantial improvements: transfers are considered to be more important from the traveler's point of view.
CONCLUSIONS This paper explores the way overlap is accounted for in route choice modeling, focusing on Path Size-Logit and multi-modal route choice. Different approaches accounting for overlap are discussed, showing similarities and differences. The analysis of Path Size Logit showed that its interpretation needs to be revised. A distinction should be made between the basic Path Size Logit, which can be seen as approximation of the error covariance matrix, and the Extended Path Size Logit, which introduces a new decision mechanism in choice models. In the Extended Path Size Logit a Size Assignment Parameter (SAP) is introduced that in case of overlapping routes penalizes longer routes and favors shorter ones. In case of multi-modal route choice (Extended) Path Size factors can be expressed in different ways, such as distance and time, but also in number of legs, in which a leg is determined by beginning and end node and the modes or transport services used. The latter definition proved to be most suitable for multi-modal route choice modeling. The inclusion of (Extended) Path Size factors in the choice model improves the performance of the choice models. However, in case of the basic Path Size factor the impact is limited to 0.5% improvement of the log likelihood at most. For the Extended Path Size factor the improvement is substantially larger: 2.0% up to 4.3%. In case of multi-modal route choice an optimal value for the Size Assignment Parameter could be established. The limited impact of the basic Path Size factor compared to the improvements obtained with more advanced methods, such as Cross-Nested Logit, Logit-Kernel, and Generalized Nested Logit, indicates that the Path Size factor only compensates for a small part of the correlation due to overlapping alternatives. The Extended Path Size factor does not so much correct for the correlation between alternatives, but introduces an additional decision mechanism in the choice model. The analysis showed that if the Extended Path Size factor is expressed in the right units, it penalizes long routes in a selective way, that is, only when shorter routes exist. As such, it can be regarded as a kind of if-then-else decision rule.
82 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction These conclusions are based on our analysis of (Extended) Path Size logit for multi-modal route choice compared with the results achieved by Ramming (2002). The arguments for our findings might be strengthened by application of other advanced choice models with our dataset of multi-modal route choice sets, for instance the Logit-Kernel model and the combination of Generalized Nested Logit and (Extended) Path Size factors. This kind of analysis will be performed in the near future.
ACKNOWLEDGEMENT This publication is a product of the research program Seamless Multi-modal Mobility, carried out within the Netherlands TRAIL Research School for Transport, Infrastructure and Logistics, and financed by the Delft University of Technology. The authors would like to thank Michel Bierlaire (EPFL) for providing Biogeme for the logit estimations.
REFERENCES Bekhor S., M.E. Ben-Akiva, M.S. Ramming (2002), Adaptation of Logit kernel to route choice situation, Paper # 02-3882 CD-ROM of the 81 st Annual Meeting of the Transportation Research Board, Washington Ben-Akiva M., M. Bierlaire (1999), Discrete choice methods and their applications to shortterm travel decisions, In: Hall R.W. (ed.) Handbook of Transportation Science, Kluwer Academic Publishers, Boston Ben-Akiva M.E., S.R. Lerman (1985), Discrete choice analysis, Theory and application to travel demand, The MIT Press, Cambridge Benjamins M., (2001) The assignment of trips to multi-modal networks using supernetworks, MSc Thesis Transport and Planning, Faculty Civil Engineering and Geosciences, TU Delft, Delft (in Dutch) Benjamins M., Ch.D.R. Lindveld, R. van Nes (2002) Multi-modal travel choice modeling using a supernetwork approach, Paper # 02-2948 CD-ROM of the 81 st Annual Meeting of the Transportation Research Board, Washington Bovy P.H.L. (1990), Traffic assignment in uncongested networks, Rotterdam (in Dutch) Bovy, P.H.L. (1996), Stochastic traffic assignment technique enhancements for congested networks. In: Bovy, P.H.L. (ed.) Transportation modeling for tomorrow, Rudi-mental contributions, Delft University Press, March 1996, pp. 129-145 Cascetta E., A. Nuzzolo, F. Russo, A. Vitetta (1996), A modified logit route choice model overcoming path overlapping problems: Specification and some calibration results for interurban networks, In: Lesort J.B. (ed.) Transportation and Traffic Theory, Proceedings of the 13th International Symposium on Transportation and Traffic Theory, Pergamon Hoogendoorn-Lanser S., R. van Nes (2004), Multi-modal choice set composition: Analysis of reported and generated choice sets, Paper # 04-3949 CD-ROM of the 83rd Annual Meeting of the Transportation research Board, TRB, Washington, Accepted for publication in Transportation Research Records
Path size and overlap in multi-modal transport networks 83 Hoogendoorn-Lanser S., R. van Nes (2005), P.H.L. Bovy, Path-size modeling in multi-modal route choice analysis, Paper # 04-1146 CD-ROM of the 84th Annual Meeting of the Transportation research Board, TRB, Washington Hoogendoorn-Lanser S. (2005) Modeling travel behavior for multi-modal transport networks, TRAIL Thesis Series T2005/, TRAIL, The Netherlands (to be published) Koppelman F.S., Wen C.H. (2000), The Paired Combinatorial Logit model: properties, estimation and application, Transportation Research Part B, Vol 34, pp. 75-89 Ramming, M.S. (2002), Network knowledge and route choice, PhD. Thesis, MIT, Cambridge Vovsha P., S. Bekhor (1998), Link-Nested Logit model of route choice, Transportation Research Record 1645, pp. 133-142 Walker J. (2001), Extended discrete choice models: Integrated framework, flexible error structures, and latent variables, PhD Thesis, MIT, Cambridge Wen C.H., F.S. Koppelman (2001), The Generalized Nested Logit model, Transportation Research PartB, Vol. 35, No. 7, Pages 627-641
APPENDIX Scaled parameter values of the home-end/activity-end MNL model and (Extended) Path Size Logit models
Home-end
Activity-end
Mode-specific constants Walk Bike Car Bus Tram Metro Train station constants Intercity train station Express train station Local train stations Mode-specific constants Walk Bike Car Bus Tram Metro Train station constants Intercity train station Express train station Local train station
Multinomial Logit
Path-Size Logit
Extended Path-Size Logit (SAP=14)
0 -16.99 -24.87 -33.53 -25.82 -17.17
0 -15.22 -22.33 -30.97 -23.63 -16.61
0 -14.58 -21.45 -31.03 -23.18 -16.95
0 0 -7.71
0 0 -8.08
0 0 -8.42
0 -16.99 -38.44 -31.19 -23.97
0 -15.22 -35.17 -28.53 -22.99
0 -14.58 -34.96 -28.06 -23.29
0 -7.26 -11.66
0 -7.11 -11.95
0 -6.99 -12.14
84
Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Multinomial Logit
Path-Size Logit
Extended Path-Size Logit (SAP=U)
0 -5.15 -6.49
0 -5.23 -6.58
-2.25 -2.51 -4.11 -0.49 -0.89 0 -1 (-0.114)
-2.21 -2.52 -4.18 -0.51 -0.95 0 -1 (-0.114)
-23.25 -19.88
-18.69 -16.30
-2.34 -3.44
-2.31 -3.46
4.85 (0.55)
7.37 (0.84)
-0.16 -2.10 -1608.10 1548.30 0.32 26
-0.20 -2.05 -1593.76 1576.97 0.33 26
Train
Train constants 0 Intercity train -5.64 Express train -7.02 Local train Whole trip In vehicle times [min] -2.38 Walk Bike -2.61 -4.26 Car -0.40 Bus -0.84 Tram Metro 0 Train -1 (-0.104) Number of legs -24.70 Low-frequency (<8) -20.55 High-frequency (>8) Costs [€] -2.551 Parking costs UPT-costs -3.72 Path-size Based on number of legs Other [min] -0.131 Total headway Walking time to UPT-stops -2.21 Statistics Final log likelihood -1616.39 1531.71 Likelihood ratio test 0.32 Rho-square 25 Free parameters different from 0 at a 90%-confidence level
5
PEDESTRIAN DYNAMICS AND EVACUATION: EMPIRICAL RESULTS AND DESIGN SOLUTIONS Dirk Helbing, Institute for Economics and Traffic, Dresden University of Technology, Dresden, Germany; Anders Johansson, Department of Physical Resource Theory, Chalmers University of Technology, Sweden; and Lubos Buzna, Department of Transportation Networks, Faculty of Management Science and Informatics, University ofZilina, Slovakia
INTRODUCTION Mass events seriously challenge the safety concepts of stadia and other public buildings such as railway stations or airport terminals. Since 1945, thirty large crowd panics have occurred, in which 1,000 people were killed altogether and 3,400 were seriously injured. In 2001 there were two major crowd stampedes in soccer stadia of South Africa and Ghana with over 160 fatalities. However, even in the United States, many people died in 2003 due to crowd panics in night clubs on Rhode Island and in Chicago. While in many crowd disasters, people are killed by smoke (see Sime, 1990; Galea et al, 1996), in the above mentioned crowd stampedes people were often killed because of the behaviour of the crowd itself. The reasons for crowd stampedes may be various (for details see Helbing et al., 2005): Apart from real hazards such as a fire, one should mention fans forcing their way into a stadium or over barriers, a non-valued goal, an outage of power supply, pushy fans leaving a stadium, provocations and aggressions by drunken fans or hooligans, the return of leaving fans after a last-minute goal, fans fleeing a rain or hail storm, over-crowding, a gun shot, the use of tear gas, or competition of people for seats, jobs, or housing.
86 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Figure 1: Panicking soccer fans trying to escape the football stadium in Sheffield. Hardly anybody manages to pass the open door, because of the clogging effect occurring at high pressures. Therefore, a huge crowd can turn into a deadly hazard not only in an actually life-threatening situation (Waldau et al, 2003), but also rather unexpectedly. In stampedes, the crowd starts pushing in order to get ahead faster. However, the people rather obstruct each other, and clogging effects may occur at exits and other bottlenecks (see Fig. 1). Shock waves emerge in the crowd (Virkler and Elayadath, 1994) and people may be crushed by the high pressure building up in the crowd (see Fig. 2). When people lose their balance and fall down, the mass tramples on them, as the pushing crowd is hardly manageable. (For a discussion of crowd management and control see Forsyth, 1999.) The injured people may turn into obstacles so that others fall as well, which can produce piles of people (see bottom photographs in Fig. 2). This urgently calls for particular architectural design solutions, which can reduce the potential hazards during mass events and increase the safety of heavily frequented buildings. The objectives of this paper are first to explain the dynamics of crowds and their characteristic behaviours (see section Self-organized patterns) and secondly to use this knowledge to propose improved design solutions for a number of examples: theaters, soccer stadia and pedestrian intersections (see section Some improved design solutions for pedestrian facilities). Finally, we describe some fundamentals of the implementation of our computer simulation model, which we use to assess pedestrian flow scenarios (see section Towards a universal pedestrian and evacuation simulator).
Pedestrian dynamics and evacuation 87
Figure 2: Illustration of typical problems during crowd stampedes: Top: The pressure in the crowd raises up to a painful and potentially lethal level. It can bend steel barriers. Bottom: Panicking people trample on others and are piled up one on top of each other.
OBSERVED SELF-ORGANIZATION PATTERNS IN PEDESTRIAN CROWDS Problems in pedestrian crowds typically arise due to counterflows, bottlenecks, or intersecting flows. These have been recently studied by video techniques (Daamen and Hoogendoorn, 2003a; Helbing et al., 2005). In the following, we will address some of these central issues of pedestrian dynamics in more detail. Counterflows Under everyday conditions, pedestrians with opposite directions of motion are not equally distributed over cross sections of the walkway. Instead, one observes the separation of pedestrian counterflows into lanes of uniform walking direction, see Fig. 3 (Oeding, 1963; Helbing, 1991, 1997, 1998; Yamori, 2001). This segregation phenomenon reduces the number
88 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction of encounters with oppositely moving pedestrians, i.e. the interaction frequency and number of necessary braking or avoidance maneuvers. In such a way, the efficiency of walking, i.e. the average velocity into the desired direction of motion is maximized. In cases of extreme densities, large disturbances, or nervous pedestrian crowds, ordered lanes can break down. Then, blocks of pedestrians with opposite desired directions of motion face each other, but cannot progress. This phenomenon is called "freezing by heating" and may emerge in counterflows of fleeing pedestrians (Helbing et al, 2000a). Note that we avoid the controversial term "panic", here (Keating 1982; Sime, 1990; Harbst and Madsen, 1996), as we are not interested in the psychological state of mind or social behavior, but in the dynamic behavior, i.e. the motion and (physical) interaction of pedestrians.
Figure 3: Representative photographs of lanes formed in bi-directional pedestrian streams (left: London, right: Budapest). An unexpected observed effect is that counterflows can be significantly more efficient than unidirectional flows (Helbing et al., 2005). Although this is rather surprising, it is consistent with observations by AlGadhi et al., 2002. The reason for this increase in capacity is probably the better coordination between people who meet each other in opposite directions, as they can react to each other (Goffman, 1971). In contrast, in unidirectional streams, pedestrians do not sufficiently react to what happens behind them (Helbing and Molnar, 1995). This causes conflicts (e.g. suppressed overtaking maneuvers) and coordination problems, which reduce the efficiency of motion. Finally, note that the increased efficiency in counterflows has not yet been found in today's pedestrian simulation models (Blue and Adler, 2000).
Pedestrian dynamics and evacuation 89 Bottlenecks In recent experiments, we have investigated mutual obstructions and perturbations at bottlenecks (Helbing et al, 2005). We found that the relative standard deviation of the time intervals between successive passings of a measurement cross section was more than doubled by the presence of a bottleneck, compared with a similar experiment with no narrowing. The related increase in the level of perturbations reduces the pedestrian speed and flow at the bottleneck. Long bottlenecks seem to be worse than local obstructions. If opposing flows at a narrow bottleneck disturb each other, we find oscillations in the passing direction. This is reflected by the large variation in the time gaps of successive pedestrians (see Fig. 4). The oscillation effect is more pronounced for longer bottlenecks, which have smaller oscillation frequencies. Typically, it is groups of people rather than single individuals who pass the bottleneck from one side to the other, before people from the other side have a chance to pass the bottleneck. As in the lane formation phenomenon, it is easier to follow someone than to move against an opposing stream. The resulting stream of people releases the pressure in the pedestrian crowd on one side, while the pressure on the other side increases, partially due to impatience. If the pressure difference becomes large enough, the unidirectional stream of people is stopped. Then, people from the other side start to occupy and pass the bottleneck.
Figure 4: Compared to the flow through a corridor without narrowings, the pedestrian flow directly after a bottleneck is less regular due to oscillations in the passing direction (middle). There is a high tendency that the bottleneck is passed by clusters of pedestrians with the same direction of motion rather than by single individuals in an alternating manner. This effect is caused by pedestrian interactions, not by gaps in the pedestrian inflow. Left: specification of the geometry. Right: Snapshot from the video used to evaluate the experiment.
In situations with bi-directional flows, bottlenecks should be avoided or, if unavoidable, bottlenecks should be short. Long narrow bottlenecks involve the risk that people try to turn the flow direction in an oscillatory way, but do not manage to do so. In these situations, the flow at the bottleneck drops significantly or stops completely. As time goes by, pedestrians reduce the distance to their predecessors, which eventually leads to a compression of the waiting crowd (see Fig. 5). This psychologically induced queuing behavior can be frequently observed and mathematically described (Helbing, 1991, 1997). The compression in the crowd is related with shock waves (Virkler and Elayadath, 1994), which produce the impression that the crowd is moving forward, even if nobody has passed the bottleneck. Therefore, the people in the back continue trying to get ahead. As the impatience in the crowd increases, people
90 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction start to push and to interact physically. Consequently, higher and higher pressures build up in the crowd. In extreme situations, this can cause clogging phenomena due to mutual obstructions, at least temporarily.
Figure 5:
Schematic illustration of observed queuing behavior of pedestrians (after Helbing, 1997). When the front of a queue (top) is stopped, one can often observe the following phenomenon: After some time, one of the waiting pedestrians begins to move forward a little bit, as the preferred (equilibrium) distance to the pedestrian in front decreases due to impatience (the perceived "pressure of time"). This causes the successor to follow up and so forth, producing a wave-like propagation of the gap to the end of the queue and a compactification of the queue (which decreases the comfort of waiting). Thereby, the tendencies of all individuals to move forward a little (in accordance with their steadily decreasing preferred equilibrium distance) add up towards the end of the queue, giving rise to larger and larger following-up distances. A more detailed explanation of this phenomenon considering the minimal length of pedestrian strides is presented elsewhere (Helbing, 1991).
In cases of crowd stampedes, clogging can even occur if all pedestrians are heading into the same direction (see Fig. 1). This leads to stopped or irregular outflows from a crowded place (as is reflected by the long steps in the curve representing the number of escaped persons as a function of the passing time of the door, see Fig. 9). The reason for this is friction effects, when pushy people interact physically. The "pressures" building up can reach orders of 1 to 4.5 tons per meter of railing of a wave breaker (Elliott and Smith, 1993; Smith and Dickie, 1993). This can bend steel barriers (see Fig. 2) or tear down brick walls. In such situations, people are frequently crushed or trampled, turning them into obstacles for others. Moreover, the flow of people managing to escape is significantly decreased (Helbing et al., 2000b).
Pedestrian dynamics and evacuation 91 Intersecting Flows Intersections of pedestrian streams are a big problem and practically unavoidable, as it is uncommon to use bridges for their separation. Let us first discuss what happens when two wide streams intersect. In this situation, the phenomenon of stripe formation has been observed (Ando et al., 1988). For an illustration see Fig. 6. Like lanes, stripes are a segregation phenomenon, but not a stationary one. Instead, the stripes are density waves moving into the direction of the sum of the directional vectors of both intersecting flows. Naturally, the stripes extend sidewards into the direction which is perpendicular to their direction of motion. Therefore, the pedestrians move forward with the stripes and sidewards within the stripes. This allows the pedestrian streams to penetrate each other in a way that pedestrians do not have to stop. Lane formation corresponds to the particular case of stripe formation where both directions are exactly opposite. In this case, there is no intersection of flows and motion takes place within more or less stationary stripes ("lanes").
Figure 6: Illustration of empirical findings for two intersecting pedestrian streams (after Ando et al., 1988). A characteristic observation is the formation of stripes perpendicular to the sum of the directional vectors of both streams. Previous investigations of intersecting flows (Helbing, 1997; Helbing and Vicsek, 1999) indicate that no stable pattern exists when three or more pedestrian streams intersect. Instead, one observes very short-lived patterns which destroy each other, producing a rather chaotic appearance. These temporary patterns include rotary traffic in clock-wise or counter-clockwise direction, dominant pedestrian flows in opposite directions with the perpendicular directions waiting, and short-lived stripes in one of the four possible diagonal directions. The steady competition and mutual destruction of these spatio-temporal patterns of motion leads to very inefficient pedestrian streams, including temporary blockages.
92 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
SOME IMPROVED DESIGN SOLUTIONS FOR PEDESTRIAN FACILITIES The complex interaction of several pedestrian streams can lead to completely unexpected results, which is a consequence of their non-linear dynamics. Therefore, the planning of pedestrian facilities with conventional methods does not guarantee the avoidance of jams, obstructions, or blockages, particularly not in emergency situations. In contrast, a skilful flow optimization utilizing the self-organization phenomena emerging in pedestrian streams can increase the efficiency and safety of pedestrian facilities at comparable costs and even with less available space. In the following, we will discuss some improved design solutions for exits and egress routes of stadia, theaters, and lecture halls, which may also be transferred to other highly frequented places such as hotels, convention centers, exhibition halls, business centers, shopping malls, railway stations, or airport terminals. These are a direct consequence of the various observed self-organization phenomena described above. For more examples of design solutions see Helbing et al. (2005). In this paper we have choosen to focus on three specific scenarios: a soccer stadium, a theater and a pedestrian crossing. The pattern of how the improved design solutions have emerged is the same in all cases: 1. Empirical observations have pointed our interest at some specific locations. 2. Ideas of architectural improvements have been developed. 3. Simulations of these new design solutions have been carried out to evaluate their (better) performance. Counterflows Counterflows are most efficient, when they are organized in a few wide lanes with stable interfaces. However, at mass events, opposite flow directions must be artificially separated, as the lanes become sensitive to perturbations (Helbing et al., 2000a) and tend to obstruct each other due to attempted overtaking maneuvers. If the lanes break down, dangerous blockages are likely to emerge, which may finally trigger crowd stampedes. Surprisingly, the desired separation of opposite flow directions can be supported by a series of obstacles such as railings, trees, or columns (see Fig. 7). Such kinds of solutions are partially permeable, but have psychologically and physically similar effects as a separating wall. They prevent pedestrians from using small gaps in the opposite flow for overtaking maneuvers, which could cause broader streams in one direction than the other, later on provoking an interactioninduced reduction in the walking speed and serious obstructions. However, when the other side is little frequented, a permeable design allows pedestrians to use the other side as well. For this reason, a series of obstacles is flexible and can reduce the frequency of deceleration and avoidance maneuvers. In this way, the average velocity is increased, although some space is used up by the series of obstacles.
Pedestrian dynamics and evacuation 93 Similar solutions are useful at doors: It is often better to have two separate doors for the two opposite directions of motion than one twice as big door. These will typically be used by one flow direction each (Molnar, 1996a, b; Helbing, 1997). In contrast, one door tends to produce oscillatory changes in the passing direction with intermediate periods of standstill during which both directions struggle with each other. This struggling can produce a dangerous pressure in the crowd, which does not build up when there is a reasonable and continuous flow in both directions through separate doors.
Figure 7:
The interfaces of opposite pedestrian flows can be efficiently stabilized by a series of columns (here in a tunnel of the metro system of Budapest at Deak Ter). Nevertheless, the permeability allows for a flexible usage in accordance with the respective pedestrian traffic volumes in both directions.
Bottlenecks and Clogging in Pushy Crowds One possibility to improve the situation at bottlenecks is a funnel-shaped design (which, by the way, requires less walkable space). However, a funnel-shaped design is not sufficient in big pedestrian crowds, when a large pressure builds up. This is well-known from mass events and can turn them into deadly stampedes under particular circumstances. Appropriately placed columns (pillars) can improve the situation. Their function is similar to conventional wave breakers. They can absorb pressure in the crowd and reduce it to a subcritical level. However, they do not seriously obstruct the movement towards the exits, as wave breakers (i.e. transversal railings) would do. The performance of various alternative design solutions for exit areas has recently been compared by means of computer simulations (Escobar and de la Rosa, 2003). This independent study is recommended to read.
94 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Figure 8:
Snapshots of an experiment imitating conditions of crowd stampedes. The participants had comparable distances to the exit in the beginning. They were asked to rush towards the door after an acoustical signal was given and to behave in a pushy way. Without an obstacle, the experiment showed clogging effects and a tendency of people to fall (left). In another setup, a cupboard served as an obstacle (right). Despite of the strong forces in the crowd (the cupboard was shaking), the clogging effect could be significantly reduced. This increased the efficiency of escape and diminished the tendency of falling.
Figure 8 shows an experiment we have performed to determine the effect of an obstacle on a pushy crowd. Without an obstacle, we found a clogging effect, which considerably reduced the efficiency of escape and produced high pressures in the crowd. Placing an obstacle (here: a cupboard) in front of the exit could avoid the clogging effect. This becomes visible in the cumulative counts of the number of escaped persons over time (see Fig. 9): Without an obstacle, one observes long plateaus indicating a temporarily stopped flow. Placing an obstacle (a cupboard of width 45 cm) in front of the exit reduces the plateaus and increases the rate of escape. That is, an obstacle can reduce both, the mean value and the relative standard deviation of the time intervals between successive escapes from the room. The outflow under conditions of a pushy crowd was increased by about 30% (see Fig. 9). A similar thing should apply to crowds of very high density. According to recent simulation results, even larger improvements are expected for bigger crowds and other geometrical designs (Escobar and de la Rosa, 2003; Helbing et al, 2000b). Clogging effects and irregular flows typically occur in pushy crowds, when the pressure exceeds a certain level. They become more serious when more people are involved. Under conditions of normal leaving, however, the outflows for rooms with and without pillars will be about the same.
Pedestrian dynamics and evacuation 95
Figure 9:
Escape times and number of escaped persons in experiments imitating conditions of crowd stampedes with and without an obstacle in front of the exit (see Fig. 8). The left figure illustrates the slower and less regular escape without an obstacle. Long steps reflect the clogging effect, i.e. long periods during which nobody manages to leave the room. In the right figure, the lines are not shown in a step-wise manner in order to allow one to distinguish the different curves, which just connect the measurement points of leaving persons. The broken lines are a guide for the eyes. Their slopes allow to compare the average flows with and without an obstacle in front of the exit.
Intersections In intersecting flows, mutual obstructions are practically unavoidable. They are, therefore, the greatest challenge to architects, urban planners and organizers of mass events (e.g. Olympic games). However, computer simulations based on the social force model (Helbing et al 1991, 1995, 2002) confirm the result shown in Fig. 6, i.e. the emergence of stable, moving stripes in two wide and dense intersecting flows (Fig. 10). These allow pedestrian streams to penetrate each other without major obstructions. In contrast, two intersecting flows of small density are characterized by the formation of temporary channels (Daamen and Hoogendoorn, 2003b). When three or more flow directions intersect, coherent stripes have not been observed, as stripes in several directions would have to propagate through each other, which would destroy any existing stripes. Patterns in intersection areas of more than two flow directions are, therefore, often unstable, "chaotic" and inefficient.
Figure 10: Representative simulation results of two intersecting pedestrian streams in a rectangular area of 90m x 35m, where the pedestrian streams have sources and sinks in the corners. Our computational results, obtained with the social force model, reproduce the observed phenomenon of stripe formation quite well (cf. Fig. 6) (Helbing et al. 2005).
96 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Nevertheless, the different flows at an intersection (and turning manoeuvres) can be organized in a way that supports a stable pattern. It is remarkable that, in computer simulations, an obstacle in the middle of an intersection has been found to improve the efficiency of motion, although it reduces the available space for the pedestrians (Molnar, 1996a). This becomes understandable, when the different flow directions are separated in a way that there are four intersections of two flow directions each (see Fig. 11). Efficient stripes may, then, emerge in all four intersection areas, as described above. Good solutions will give rise to rotary traffic, when the crossing is heavily frequented, hi periods of light traffic, some pedestrians may try to move opposite to the main stream. During these periods, however, a deviation from rotary motion does not matter a lot. Our first empirical investigations confirm this assessment. Simulations of an intersection (see Fig. 11) have shown that the improved design results in higher pedestrian throughput for high crowdedness. Additional simulations have been made with either the pillar in the middle or the railings. It has been found that each single measure increases the throughput as well, if the pedestrian density is high enough and pedestrians have a preferred side of walking. The design also provides enough flexibility for efficient usage patterns at low densities. Finally, note that the optimal location of the obstacle and railings depends on the respective fraction of pedestrians in each direction and their turning fractions. It may be determined by evolutionary algorithms.
Figure 11: Left: At conventional intersections, one observes continuously changing patterns of motion, i.e. the pedestrian streams are unstable, "chaotic", and inefficient. Right: If four intersecting pedestrian flows are separated by barriers, one-way regulations, and an obstacle in the center of the intersection, stripes may form in all four intersection areas of two pedestrian streams and propagate perpendicularly to their sideward extension. As a consequence, efficient round-about traffic may emerge at high densities. The design uses the preference of the right-hand side in Central European pedestrian streams. In other countries such as Japan, it would be reasonable to invert the flow directions.
Pedestrian dynamics and evacuation 97 Egress Routes of Theaters In 1903, 602 people died in a theater fire, and in 1970, 46 people were killed by a fire in a ballroom in St. Laurent-du-Pont. (More examples are discussed by Waldau et al, 2003.) Even after these tragic events, theater fires have cost many lives and were considered to be so dangerous that fire fighters had to be on the spot during every show.
Figure 12:
Left: A uniform width of the corridors in a theater implies long waiting times for the more distant rows. Right: A funnel-shaped design can reach shorter waiting times for the same number of seats, which reduces the danger of pushing behavior in emergency situations. Columns in front of the exit could decrease the pressure on the leaving crowd at the exit, similar to wave breakers. The wider exits reduce the risk of jam formation and clogging.
Today, it should be possible to evacuate theaters within a few minutes, as specified by safety codes. Therefore, the minimum width of egress routes is regulated by law. However, it is not always reasonable that egress routes have a constant width. In reality, the top floor of a hotel, the lowest deck of a ship, or a theater's most distant row from the exit has to cope with the smallest pedestrian volume. The number of persons who wish to leave increases with each floor, each deck, or each row of seats that is closer to the exit. Therefore, the time to leave grows proportionally or even over-proportionally with the distance to the exit, which implies long waiting times. This causes impatience in the crowd, particularly in situations of danger, which can produce a pushy behavior with all its possible consequences: clogging phenomena, dead and injured people. As a consequence, it would be reasonable to have increasing widths of egress routes, similar to the stream of a river. In this way, it is possible to avoid long leaving times and to speed up the evacuation of people. The average width of egress routes does not have to be greater than today, so that the usable area and potential profit are not reduced. Figure 12 compares a typical design of theaters with an improved solution, in which the blocks of seats have a trapeziform rather than a rectangular shape. For large crowds it can also make sense to place columns at suitable places in front of the exits (see Figs. 8 and 9). These can serve to absorb
98 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction the pressure in the crowd like a wave breaker, in order to relieve the strain on the escaping people at the exit, while allowing pedestrians to get around the obstacle. In many cases, columns are anyway needed for static reasons, so that no additional costs would incur. The visibility of exits and exit signs can be taken care of. For example, a suitable lighting concept could support orientation. The two scenarios shown in Fig. 12 have been simulated and the evacuation time is reduced for the improved design, as expected. Note that the changing of egress routes into funnel shapes does not change the total number of seats, since the average widths are the same and therefore the area occupied by the egress routes is constant. Staircases and Exits of Stadia Staircases are serious obstacles in any panic situation. Practically, it is only a matter of time until persons in the pushy crowd are falling, especially as it is not possible to see the exact location of the single stairs in a dense crowd. The danger is highest for staircases going down. The crowd stampede in a night club of Chicago on February 17, 2003, is characteristic for this. It was triggered by a relatively harmless event: Staff members tried to separate two fighting guests using pepper spray. However, other guests assumed a terror attack with poisonous gas, as the government had activated the second highest alert level (Code Orange). Therefore, some guests ran towards the exit and alarmed the other people. Most of them rushed towards the main exit as well, while the available side exits were used by a few people only. On the long staircase leading down to the exit, people lost their balance, and succeeding people fell over them. In the end, people were piled up in many layers (see, for example, the bottom photos in Fig. 2). Attempts to draw exhausted individuals out of this heap of people failed, with the result of 21 dead and 50 injured people. The danger of falling on staircases can be reduced by replacing them by ramps, where possible. However, the hazards of long downward staircases can also be reduced by dividing them into small enough segments pointing into different directions. Figure 12 illustrates the suggested zigzag design for a stadium exit. It limits the pushing-related build-up of pressure in a crowd and avoids that many fallen people are piled up one on top of each other. Although upward staircases may act as obstacles for escaping individuals as well, the problem of heaps of fallen people is typical for downward staircases. Upward staircases may even reduce the pressure of the crowd rushing towards the exit, as they separate the people in vertical direction. Consequently, it makes a big difference whether egress routes lead upwards or downwards. The two architectural designs in Fig. 13 have been simulated both for normal evacuation and a scenario in which one of the downward staircases was blocked due to fallen persons. In both cases the evacuation times were marginally lower for the improved infrastructure. Moreover, the pressure levels were reduced by the improved design by almost a factor of 2. Both designs have only one exit each, located in the center, but the three egress routes leading to this exit differ.
Pedestrian dynamics and evacuation
Figure 13:
Top: Conventional design of a stadium exit in an emergency scenario, where we assume that some pedestrians have fallen at the end of the downwards staircase to the left. The dark area indicates high pressures, since pedestrians are impatient and pushing from behind. The different queue lengths in the different rows are due to heterogeneous desired pedestrian velocities. Bottom: The zigzag design of the downward staircases changes the pushing direction of the crowd in the improved scenario. This avoids the build-up of an overcritical pressure, which could cause that many falling people are piled up (see bottom of Fig. 2). Another improvement is the increase in the diameter of the corridors, which can reduce waiting times, impatience, and evacuation times, even if the number of seats is the same.
100 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
TOWARDS A UNIVERSAL PEDESTRIAN AND EVACUATION SIMULATOR The implementation of our pedestrian microsimulator based on the social force model (Helbing et al, 1991, 1995, 2002) has been recently optimized for efficiency and scalability in terms of computational speed and memory. It is no problem to simulate 10,000 pedestrians in real-time on a normal PC. Parallel computing will even allow one to simulate more than 100,000 pedestrians in real-time. This is suitable for the simulation of large scenarios such as pedestrian flows in extended urban areas (see Fig. 14) or during mass events such as street parades or carnivals (Batty et al., 2003). In order to be suitable for scenarios of this complexity, we have implemented certain additional features complementing the social force model: 1. a powerful scenario generation module based on XML, 2. path finding and route choice modules to describe the selection of destinations, including spontaneous stops and impulse shopping, 3. calibration modules to adapt simulations to real measurements, 4. a statistics module evaluating various performance measures (such as densities, velocities, flow efficiency, pressure, overall evacuation time, etc.) to assess and compare different scenarios, 5. an optimization module based on evolutionary algorithms which allows to improve the geometrical boundary conditions of pedestrian facilities, 6. various visualization modes for the illustration of the simulation results, both on- and off-line, 7. a functionality reflecting density-dependent herding effects. The simulator should not only serve as a research tool, but can also be used as a design tool to assess the effects of new pedestrian sources and attractions (such as theatres and shopping malls) on the overall pedestrian streams and activity patterns.
SUMMARY AND DISCUSSION Pedestrian dynamics has recently received a high level of interest due to the evacuation of the World Trade Center on September 11, the crowd panics in night clubs on Rhode Island and in Chicago 2003, and the sad accidents during the holy pilgrimage in Makkah.
Pedestrian dynamics and evacuation
101
We have used video techniques to explore the dynamics of pedestrian streams at bottlenecks, around obstacles, or at intersections. Our empirical results on pedestrian streams in normal and pushy scenarios show that the geometric boundary conditions are highly relevant for the capacity of the elements of pedestrian facilities, due to self-organization phenomena. These findings can be used to improve design elements of pedestrian facilities and egress routes. The great challenge of simulation models is the reproduction of the observed collective phenomena in pedestrian crowds. This includes lane formation in corridors and oscillations at bottlenecks in normal situations, while different kinds of blocked states may emerge in pushy pedestrian crowds. By means of microsimulations based on a social force model of interactive pedestrian dynamics, the spatio-temporal patterns in pedestrian crowds can be successfully reproduced and interpreted as self-organized phenomena. In contrast to previous sociopsychological approaches, this allows an understanding of the observations from a physical point of view. In the social force model, the transition between normal and pushy behavior is controlled by a single parameter, the "impatience", which influences not only the desired speeds, but also the fluctuation strength (irregularity of motion) and the tendency of herding (Helbing et al, 2000b, 2002).
Figurel4: Simulation of pedestrian streams in a simulation of the city center of Dresden, Germany. The figure shows the average pedestrian density over about 10 minutes simulation of the lkm x lkm area, with about 30 000 simultaneously simulated pedestrians.
102 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction The advantage of the social-force-based simulation approach is its simple form and its small number of parameters, which do not need to be calibrated anew for each situation. Therefore, the model is suitable for the predictions of pedestrian streams in novel architectures and new situations. Even counter-intuitive effects are well reproduced. This includes paradoxial effects like "freezing by heating", "faster is slower", and the ignorance of available exits (Helbing et al, 2000a, b, 2002). At the same time, the model suggests innovative measures to improve pedestrian flows, both in normal and panic situations. For example, we propose to use suitably shaped and placed "obstacles" to stabilize flow patterns and to make them more fluid. Moreover, we suggest increasing diameters of egress routes in stadia or theaters to avoid long waiting times for people in the back and shock waves due to impatience. In addition, zigzag-shaped geometries and columns can reduce the pressure in pushy crowds. The proposed design solutions are expected to increase the efficiency and safety of, for example, shopping malls, cinemas, theaters, public buildings, hotels, or passenger ships in the future. Depending on the numerical implementation, the social-force model is suitable for large-scale simulations on parallel PC clusters. In this way, more than 100,000 pedestrians could be simulated in real-time, which makes the approach suitable for the assessment of airport terminals, stadia, railway stations, hotels and mass events. Moreover, one can simulate pedestrian flows in extended urban areas. This allows one to assess the attractiveness of certain locations for new shops, but also the impact of new buildings like theaters or malls on the overall pedestrian flows.
ACKNOWLEDGMENTS D.H. is grateful to Stefan Lammer as well as Tilo Grigat for producing the schematic illustrations. Last but not least, we appreciate that Roger Hughes has drawn our attention to the interesting study by Ando et al. (1988).
REFERENCES Ando, K., H. Oto and T. Aoki (1988). Forecasting the flow of people [in Japanese]. Railway Research Review, 45, (8), 8-13. Batty, M., J. Desyllas, and E. Duxbury (2003). The discrete dynamics of small-scale spatial events: agent-based models of mobility in carnivals and street parades. Int. J. Geographical Information Science, 17(7), 673-697. Blue, V. J. and J. L. Adler (2000). Cellular automata microsimulation of bi-directional pedestrian flows, J. Trans. Board, 1678, 135-141. Bolay, K. (1998). Nichtlineare Phanomene in einem fiuid-dynamischen Verkehrsmodell. Master's thesis, University of Stuttgart.
Pedestrian dynamics and evacuation 103 Borgers, A. and H. Timmermans (1986a). A model of pedestrian route choice and demand for retail facilities within inner-city shopping areas. Geographical Analysis, 18, 115-128. Daamen, W. and S. P. Hoogendoorn (2003a). Experimental research of pedestrian walking behaviour. Transportation Research Record, 1828, 20-30. Daamen, W. and S. P. Hoogendoorn (2003b). Qualitative results from pedestrian laboratory experiments, Pedestrian and Evacuation Dynamics, E. R. Galea (ed.), 121-132. Elliott, D. and D. Smith (1993). Football stadia disasters in the United Kingdom: Learning from tragedy? Industrial & Environmental Crisis Quarterly, 7 (3), 205-229. Escobar, R. and A. de la Rosa (2003). Architectural design for the survival optimization of panicking fleeing victims. Presented at 7th European Conference on Artificial Life (ECAL 2003), Dortmund, Germany, September 14-17. Forsyth, D. R. (1999). Group Dynamics, Wadsworth Publishing, Ed. 3, Chap. 15. Galea, E. R., M. Owen and P.J. Lawrence (1996). Computer modelling of human behaviour in aircraft fire accidents, Toxicology, 115, 63-78. Goffman, E. (1971). Relations in Public: Microstudies in the Public Order, Basic, New York. Harbst, J. and F. Madsen (1996). The behaviour of passengers in a critical situation on board a passenger vessel or ferry. Technical Report, Danish Investment Foundation, Copenhagen. Helbing, D. (1991). A mathematical model for the behavior of pedestrians. Behavioral Science, 36, 298-310. Helbing, D. (1993). Stochastische Methoden, nichtlineare Dynamik und quantitative Modelle sozialer Prozesse. Ph.D. thesis, University of Stuttgart, 1992, published by Shaker, Aachen. Helbing, D. (1995). Quantitative Sociodynamics. Stochastic Methods and Models of Social Interaction Processes. Kluwer Academic, Dordrecht. Helbing, D. (1996). Traffic modeling by means of physical concepts, in Traffic and Granular Flow, D. E. Wolf, M. Schreckenberg and A. Bachem (eds.), 87-104, World Scientific, Singapore. Helbing, D. (1997). Verkehrsdynamik [Traffic Dynamics], Springer, Berlin. Helbing, D. (1998). Pedestrian dynamics and trail formation, in Traffic and Granular Flow '97, M. Schreckenberg and D. E. Wolf (eds.), 21-36, Springer, Singapore. Helbing, D., L. Buzna, A. Johansson, and T. Werner (2005). Self-organized pedestrian crowd dynamics: Simulations, experiments, and design solutions, Transportation Science, 39(1), 1-24. Helbing, D., I. J. Farkas, P. Molnar and T. Vicsek (2002). Simulation of pedestrian crowds in normal and evacuation situations, in Pedestrian and Evacuation Dynamics, M. Schreckenberg and S. D. Sharma (eds.), 21-58, Springer, Berlin. Helbing, D., I. Farkas and T. Vicsek (2000a). Freezing by heating in a driven mesoscopic system. Physical Review Letters, 84, 1240-1243. Helbing, D., I. Farkas, and T. Vicsek (2000b). Simulating dynamical features of escape panic. Nature, 407, 487-490. Helbing, D. and P. Molnar (1995). Social force model for pedestrian dynamics. Physical Review, E 51, 4282-4286. Helbing, D., P. Molnar, I. Farkas and K. Bolay (2001). Self-organizing pedestrian movement. Environment and Planning, B 28, 361-383. Helbing, D. and T. Vicsek (1999). Optimal self-organization. New Journal of Physics, 1, 13.1-13.17.
104 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Hoogendoorn, S. P., P. H. L. Bovy and W. Daamen (2002). Microscopic pedestrian wayfinding and dynamics modelling, in Pedestrian and Evacuation Dynamics, M. Schreckenberg and S. D. Sharma (eds.), 123-154, Springer, Berlin. Keating, J. P. (1982). The myth of panic. FireJ., 147, 57-61. Molnar, P. (1996a). Modellierung und Simulation der Dynamik von FuBgangerstromen, Shaker, Aachen. Molnar, P. (1996b). Microsimulation of pedestrian dynamics, in Social Science Microsimulation, J. Doran, N. Gilbert, U. Mueller and K. Troitzsch (eds.), Springer, Berlin. Oeding, D. (1963). Verkehrsbelastung und Dimensionierung von Gehwegen und anderen Anlagen des FuBgangerverkehrs, in StraBenbau und StraBenverkehrstechnik, Heft 22, Bundesministerium fur Verkehr, Abt. StraBenbau, Bonn. Sime, J. (1990). The concept of panic, Chap. 5, 63-82, in Canter, 2nd edition. Smith. R. A. and J. F. Dickie (1993). Engineering for Crowd Safety, Elsevier, Amsterdam. Virkler, M. R. and S. Elayadath (1994). Pedestrian density characteristics and Shockwaves, in Proceedings of the Second International Symposium on Highway Capacity, Vol. 2, R. Akcelik (ed.), 671-684, Transportation Research Board, Washington, D.C. Waldau, N., M. Schreckenberg and P. Gattermann (2003). Design criteria related to orientation in buildings during high stress situation models and their applications, Pedestrian and Evacuation Dynamics, E. R. Galea (ed.), 121-132. Yamori, K. (2001). Going with the flow: Micro-macro dynamics in the macrobehavioural patterns of pedestrian crowds, Psychological Review, 105, 530-557.
6
AN EMPIRICAL ASSESSMENT OF TRAFFIC OPERATIONS Chao Chen and Pravin Varaiya, University of California, Berkeley; and Jaimyoung Kwon, Statistics Department, California State University, Hayward, California, USA
INTRODUCTION The California Freeway Performance Measurement System (PeMS) stores real-time data from 26,000 loop detectors. PeMS is accessed via an internet browser (http://pems.eecs.berkeley.edu/). It currently has 3 TB of data, growing at 2 GB/day. PeMS extracts useful information from these data and displays it in graphical or tabular form. These data provide an unparalleled opportunity to assess freeway performance and suggest ways to improve freeway management. Operational since 2001, PeMS receives real time data from 26,000 loops grouped into 8,040 Vehicle Detector Stations (VDS) covering 3,000 directional miles of freeways in major California urban areas. PeMS also collects incident data from the Traffic Accident Surveillance and Analysis System (TASAS) and the California Highway Patrol. The principal aim of this paper is to examine congestion as a performance measure and demonstrate that data can be processed to reliably estimate the causes of congestion, and the gains from better ramp metering, incident management, and traveler information. Each of the following six sections addresses a different aspect of congestion. Some sections report previous research by the PeMS Development Group. The section BPR CURVE suggests replacing the standard BPR curve by two curves: one for the free flow regime, the other for the congestion regime. For Los Angeles the two regimes separate at 50 mph. Drivers in Los Angeles spend 35% of their time in the congestion regime, so congestion delay can be reduced if this regime can be avoided. IDEAL METERING presents an empirical procedure to rapidly obtain a rough estimate of this reduction by preventing the onset of the congested regime at recurrent bottlenecks. For Los Angeles the procedure estimates an annual saving of 50 million vehicle-hours.
106 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Not all bottlenecks cause significant congestion. BOTTLENECKS summarizes an automated procedure to identify all bottlenecks and rank them by frequency of occurrence and severity of impact. For San Diego County the procedure locates 160 bottlenecks, the ten most severe of which account for 61 percent of the delay from all bottlenecks. To estimate the delay from a collision, its effect must be separated from congestion caused by bottlenecks. CONGESTION PIE reviews a technique that predicts what the congestion would have been had the collision not occurred. Collisions and bottlenecks cause congestion, and delay from bottlenecks can be reduced by ramp metering. Putting these considerations together yields three congestion pie slices corresponding to collisions; congestion that can be eliminated by ramp metering; and 'residual' congestion due to all other causes, the largest being 'excess' demand. Congestion delay measures system performance. Travelers experience congestion as large variations in travel time. Because the travel time stochastic process exhibits a large temporal autocorrelation, real time data can be processed to reliably predict travel time, as shown in PREDICTING TRAVEL TIME. Travel time prediction increases welfare: It can suggest a shorter alternative route if one is available; and it can reduce the uncertainty in travel time, even when that time itself cannot be reduced. The Bay Area provides a unique opportunity to study the impact of HOV lanes on non-HOV traffic because the HOV lanes are time-actuated. HOV LANE EFFECTIVENESS presents limited evidence suggesting that HOV actuation increases overall congestion, by imposing a congestion penalty on non-HOV traffic (which loses one lane) and a capacity penalty on the HOV lane (which acts as a one-lane highway with much lower speed).
BPR CURVE Figure l(a) is a scatter plot of speed vs. flow across all four lanes of I-10W in Los Angeles at vehicle detector station (VDS) 717162. Each point represents a one-hour average for the 30day period 13 June-13 July, 2004. Also displayed are two curves fitted to the BPR (Bureau of Public Roads) equation
v=
V
-l \ + a(q/Cy'
in which v is speed, v/ is free flow speed, q is flow, and C is capacity. Data with average hourly speed below 30 mph are discarded. The capacity C is estimated to be the maximum hourly flow observed during the 30-day period, and the free flow speed is the median speed when occupancy is below 10%. The parameters a and /? are either user-specified or obtained using a nonlinear least- squares, Marquardt-Levenberg algorithm (Martin, W., 1998).
Empirical assessment of traffic operations 107
Figure 1 (a) Scatter plot of 1-hour average speed vs. flow and (b) trajectory of 5-min average speed vs. flow. Two BPR curves are fitted to the scatter plot in (a). The shaded region, pcr, in (b) is the critical density separating free flow from congestion. Figure l(b) plots the temporal evolution of speed vs. flow at the same location as in figure 1 during 0400-1700 (4:00 AM-5:00 PM) on 13 July, 2004. Each point now represents a fiveminute average. The figure suggests a modified BPR procedure that divides traveler experience into two distinct 'metastable' regimes: the free flow regime implicit in the BPR curve, and a low-speed congestion regime, separated by a 'critical density' band, pcr. The likelihood of the two regimes can be empirically computed for any location, freeway, or an entire region. Figure 2(a) gives the frequency distribution of VMT (veh-miles traveled) and VHT (vehhours traveled) on I-10E during 0500-1900, 14 July, 2004. Drivers spent 35% of their time at an average speed of 30 mph and 65% at an average speed of 60 mph, suggesting the tworegime BPR model of Figure 2(b), separated at 50 mph. The free-flow BPR curve is as before. Two linear regressions are fitted to data in the congestion regime,
= 8 +e3.. vf
C
The solid line is obtained by least-squares; the dotted line is the least quantile regression, which is less sensitive to outliers. The likelihood of each regime, determined by frequency counting, is P(v > 50 mph) = 0.79, P(v < 50 mph) = 0.21.
108 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Figure 2 (a) Distributions of VMT and VHT vs. speed for I-10E and (b) A two-regime BPR model.
IDEAL METERING Figure l(b) suggests that holding back volume surges by metering on-ramps may prevent the occurrence of the congestion regime at some bottlenecks, and figure 2(a) implies a large reduction in delay if this can be done. Designing a ramp metering algorithm for a specific freeway section is arduous. Many set points and feedback gains must be selected (Papageorgiou, M., 1983; Papageorgiou, M. et al., 1991), based on a calibrated simulation model. But there is a simple procedure to roughly estimate the benefits from ramp metering without detailed simulations, based on the hypothesis that the congestion regime can be avoided by controlling flow according to the Ideal Metering Principle (IMP) (Jia, Z. et al., 2000): If volume surges at on-ramps are held back by a metering policy that always keeps flow below its capacity in every link, freeway speed will be maintained at 60 mph and congestion will not appear. As a consequence of metering vehicles may be stopped at the ramps for some time. The IMP hypothesis has two parts. One part is that if flow is always maintained below capacity, or equivalently, if density is always less than critical (pcr), traffic will be kept in the free flow regime. Data like in figure l(b) provide indirect support: If the traffic density is never allowed to enter the critical region, traffic will always stay in the free flow regime. The definition of 'capacity' is empirical: It is taken to be (say) 95% of the maximum sustained observed flow. The second part of the hypothesis is that maximum flow occurs at free flow speeds, nominally 60 mph, as in Los Angeles (Jia, Z. et al., 2001) and Orange County (Chen, C. and P. Varaiya, 2001). Of course not all congestion is due to volume surges at on-ramps and practical considerations, such as ramps of insufficient length, may prevent implementation of a proper metering policy. The planner should ask: "What will be the impact of implementing IMP-conforming ramp metering if the IMP hypothesis is true?"
Empirical assessment of traffic operations 109 A procedure to answer this question is illustrated in (Jia, Z. et al., 2000), using data for a 7mile section (postmiles 0-7) of I-405N in Orange County, during 0500-1000 for 10 weekdays in June 1998. The section is divided into 13 links, each corresponding to one VDS; eight links have one on- and off-ramp each. A virtual on-ramp is created at the beginning of the most upstream link in order to account for metering of on-ramps upstream of the study section.
Figure 3 The top graph is the time in VHT actually spent on the freeway section, every 5 minutes. Units are normalized to VHT per hour, so the total VHT on this section, between 0500 and 1000 is the area under the top graph. The middle graph is the VHT per hour under IMP metering, including time in ramp queues. The bottom graph excludes time spent on the ramps, so it is the VHT per hour that would be spent traveling at 60 mph. The area between the top and middle graphs is the time saved by metering. The area between the middle and bottom graphs is the time spent at the ramps. Source: (Jia, Z. et al., 2000). The capacity of each link is calculated as the maximum sustainable aggregate flow. Inflows at on- ramps and exit flows at off-ramps are assumed to remain unchanged despite the metering, whose impact is estimated as follows: 1. At each on-ramp, inflow is metered so that the link flow remains 5% below the link capacity; 2. Traffic on each link after metering is assumed to move at 60 mph; 3. The queue at each on-ramp is calculated by accumulating the net inflow. On average, two-thirds of the total delay (defined as additional vehicle-hours traveled (VHT) driving below 60 mph) is eliminated by ramp metering. More insight is gained from figure 3, which shows how metering holds back large surges in demand.
110
Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
This procedure was repeated in (Chen, C. et al., 2001) for five freeways (1-5,1-10, US 101,I110 and 1-405) in Los Angeles during 0000-1200, 3-9 October, 2000. That exercise found that IMP-metering reduces delay by 70%. PeMS calculates the total congestion delay (from driving below 60 mph) for Los Angeles for 2003 to be 83 million vehicle-hours. The procedure suggests that ramp-metering may eliminate 57 million vehicle-hours of delay, which at $20/veh-hr is in excess of 1 billion dollars. Even if only one-half of the delay savings from IMP-metering can be practically realized, this indicates the large productivity gain that good management can achieve.
BOTTLENECKS Bottlenecks can cause congestion, which may be reduced by ramp metering. A bottleneck may be associated with physical features such as ramps, lane drops, grade changes, curvature, lane closures, and accidents; but traffic jams and congestion may 'spontaneously' arise in locations with none of these features. In the absence of a guide to locating bottlenecks and estimating their severity, we need an algorithm to automatically (1) identify all bottlenecks, and (2) calculate the delay each one causes. Such an algorithm is reported in (Chen, C. et al., 2004b), and applied using flow and speed data from 263 VDSs on 270 miles of seven freeways in San Diego. The algorithm uses a sustained speed gradient between a pair of upstream-downstream detectors to identify bottlenecks. We describe the algorithm. Consider a freeway with n detectors indexed i = 1,..., n, each giving speed and flow measurements, averaged over 5-minute intervals indexed t= \, 2,... Detector i is located at postmile x,-; v,-(f) = v(x,-, t) is its speed (miles per hour, mph) and qi{t) = q(xt, t) is its flow (vehicles per hour, vph) at time t. If*,- < Xj, it is understood that x, is upstream of x,. The algorithm has four steps. First, it declares an active bottleneck at certain locations and times if the data meet criteria (l)-(4) below. Second, it includes additional time periods as part of the same bottleneck activation, provided nearby time intervals are selected in the first step. The criterion for this is (5). Third, it calculates the delay caused by a bottleneck, using (9). Lastly, identified bottlenecks are ranked in terms of frequency of occurrence and severity to isolate recurrent from transitory bottlenecks and to help prioritize mitigation efforts. Step 1 Declare an active bottleneck between locations x,- < xj during t if all four inequalities hold: Xj -
2 miles,
v(xk, t) - v(xi, t)>0 ifxi <xk<xi<xh
(1)
(2)
V{XJ, t) - v(x.i, t) > 20 mph,
(3)
v(xh t) < 40 mph.
(4)
Thresholds in (l)-(4) are selected on the basis of experience. In Los Angeles free flow speed is 60 mph and, when a bottleneck is activated, speed drops rapidly to below 40 mph (e.g. figure l(b)). Hence the 20 mph minimum speed differential (3) and 40 mph congestion speed (4) thresholds. The maximum separation of 2 miles in (1) is designed to include locations where speed continues to drop as we go downstream, but the difference between each neighboring pair is small. Location xt is upstream of Xj, but there may be other detectors at xt,
Empirical assessment of traffic operations 111 x; between these locations. The constraint (2) that speed should drop continuously is the algorithm's characterization of an active bottleneck. Step 2 Sustained bottlenecks last longer than five minutes. Let A,{t) = 1 if there is an active bottleneck at location i and time period t; otherwise At(i) = 0. A bottleneck is sustained between times t\ and ?2 if ^4-(r)>9Ar,V?,
(5)
with N = 1 and q = 5/7. That is, a sustained bottleneck has at least five active bottleneck periods (25 min) within every seven consecutive periods (35 min). This ad hoc definition accounts for situations like in figure 4(a), in which at postmile 26 the bottleneck is continuously sustained between 0700 and 0800 except for several five-minute periods. The notion of sustained bottleneck allows treating this as a single bottleneck rather than two or three bottlenecks. The most downstream location of a sustained bottleneck is the location of an active bottleneck. Figure 4(a) shows the result of applying the algorithm to data from I-15S. The locations and times of detected bottlenecks are the squares superimposed on the speed contours. The contours visually suggest one sustained bottleneck between 0545 and 0945 at postmile 26, and another between 0645 and 0830 at postmile 15, and indeed both bottlenecks are identified by the algorithm. Step 3 To calculate the delay, the algorithm first delineates the space-time congested region of each bottleneck and then the delay in vehicle-hours associated with the region. As an example, the speed contour in figure 4(a) shows regions of congestion upstream of two bottleneck locations. The n detectors divide the freeway into n segments. A segment is declared congested at time t if its speed is below 40 mph. The congested region associated with a bottleneck is the contiguous group of congested segments immediately upstream of the bottleneck location. For an active bottleneck just downstream of segment 7 at time t, the congested region is the set of segments Bj(t), Bj{t) = {i: vk (t) < 40 mph, for all i < k<j) .
(6)
112 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
(a) Bottleneck location
(b) Delay distribution
Figure 4 (a) Bottleneck detection on 1-15 SB on 5/1/2003. Traffic flows in order of decreasing postmile. (b) Distribution of daily delay among 160 bottleneck locations; the 10 'outliers' account for 61% of the delay. Source: (Chen, C. et al., 2004b). The delay D/t) associated with the bottleneck during this period is the sum of the delays in
w> Dj{t)= £ ,.('),
(7)
in which d,{f) is the delay in segment i at time t. Segment delay is the additional vehicle-hours traveled driving below the free flow speed, 60 mph,
d,(t) = I, x q,(t)x 4 T " — I v/=
60 m h
P-
(8)
Here /,, q,{t), and v,{t) are the segment length, volume, and average speed on the segment at t. The total delay attributed to a bottleneck at segment j that is active between times t\ and ^ is
£>,(<„/,) = £/>,(/).
(9)
Step 4 The steps above found 1733 sustained bottlenecks distributed over 160 distinct locations on 64 workdays. These bottlenecks represent all locations and times that satisfy equations (l)-(5). Their causes are unknown, and may include incidents or recurring conditions. The delay associated with each detected bottleneck is computed using (9). The total delay associated with bottlenecks during the test period is 1.2 million vehicle-hours, which is 64% of the total delay measured on these freeways during this period. Of the delay caused by bottlenecks, 61% is attributed to the top ten locations alone. These are the outliers in figure 4(b).
Empirical assessment of traffic operations 113
THE PIE OF CONGESTION Bottlenecks cause congestion, some of which can potentially be removed by ramp metering. Collisions also cause congestion. These considerations lead to the 'congestion account' (10)(13), for a contiguous section of freeway with n detectors indexed i = 1, ... , n. Using the earlier notation, d(t) = lxq(t)x\
vehicle-hours,
Dm'YLd^t),
(10)
(11)
i=\ t=\
Drec=Dtol-Dcol, (12) Dtot = Dcoi+Dpot + Drem. (13) Here v/ is the reference speed, 60 mph. So d,{t) is the delay in segment i in interval /, and Dtot is the total delay in the section. Both d,{f) and Dtol(t) are directly obtained from PeMS. Dcoi is the delay caused by collisions, which has to be estimated. Drec, as defined in (12), is often called the 'recurrent' congestion, much of which occurs at bottlenecks. A significant amount of Drec can be potentially eliminated by ramp metering. We call this amount Dpot, which also needs to be estimated. Putting all these definitions together gives the summary (13), in which Drem is the 'residual' congestion. Drem is largely due to 'excess demand' whose impact cannot be eliminated by ramp metering, and shows up as delay at ramps. Drem also includes the contribution to congestion of all other causes, such as adverse weather and special events. The study in (Kwon, J. and P. Varaiya, 2005) proposes an automated procedure to estimate all three components in (13), using PeMS loop data and collision data from Traffic Accident Surveillance and Analysis System (TASAS) maintained by Caltrans. The procedure is applied to a 22.5 mile (postmile 4.5 to 27) section of I-15N in San Diego County. The time period is from 0500 to 2200, for 44 weekdays (2 September-31 October, 2002). Figure 5 summarizes the study's conclusions. The total average daily congestion pie is divided into three slices. If Dpot and Drem are reported together as Drec, recurrent congestion would amount to 70%. As Hallenbach et al. (Hallenbach, M.E. et al., 2003, p. 11) observe, this large 'recurrent' congestion may in part be caused by "unusual volume surges at ramps . . . that are not being effectively handled by the ramp metering program." Figure 5(a) indicates that 30% of the total congestion (or 60% of recurrent congestion) can be removed by IMP-metering that effectively handles these volume surges. Figure 5(b) summarizes traveler exposure to congestion in the study section. Travelers spend 89% of their time in the free-flow regime, and 11 % in the congestion regime. The pies in figure 5 are for the study section. We are in the process of constructing congestion portraits for all freeways in California for which PeMS and TASAS data are available. We now discuss the four-step procedure in (Kwon, J. and P. Varaiya, 2005). The first step delineates for each collision its time-space region of impact. The second step predicts how much delay this region would have experienced had that collision not occurred; this is the
114 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction recurrent congestion. The third step calculates how much of this recurrent congestion can be eliminated by IMP-metering. The fourth step puts the estimates together in the congestion pie. Step 1 Following a collision, congestion propagates upstream up to some maximum spatial extent. The congestion lasts a certain amount of time, called its duration. Empirically, freeway segment i is declared congested during a 5-minute interval t if the speed v,{t) < 50 mph. (This is slightly different from the 40 mph criterion in (3).) Formula (10) is then used to calculate the total delay in this duration-extent 'rectangle'. The precise algorithm is similar to that of (6)-(7). The step leads to the estimate Dtota(X) of the total delay at time t in the impact region of each collision a. (The same procedure can be used to delineate the impact of noncollision incidents.)
(a) Congestion pie
(b) Exposure pie
Figure 5 The congestion pie (a) and the exposure pie (b) automatically constructed for the I15N study section. Source: (Kwon, J. and P. Varaiya, 2005). Step 2 This step predicts Dreca{t), the recurrent congestion at time t that would have occurred in the absence of collision a. This is the AT-nearest neighbor prediction of the recurrent delay, based on historical data of the delay Da(t,d) during the same time t and over the same spatial extent, for several other days d = 1, ..., T. More precisely, the estimate is the median value Deceit) = median{Da{t, dk") \ k= 1, ... , K}, in which dt', k = 1, ... , K are K days with smallest values of | Da(t, d) - Dtota{ta) | for d = 1, ... , D. (hi the empirical study of figure 5, K = 3.) Here ta is the time just before collision a occurred. The recurrent congestion that would have occurred in the absence of collision a is predicted to be Drec.a = 2 j Drec,a if),
in which the sum is over the duration of impact. Finally, Dcoi,a = I , max(Ao<.a(0 - Drec,a(t),0),
(14)
is the contribution to congestion of collision a. Step 3 This step estimates the potential reduction in delay at recurrent bottlenecks by IMPmetering discussed in IDEAL METERING. The procedure first identifies all bottlenecks following the algorithm in BOTTLENECKS, and restricts attention to those that occur for more than 20% of the days. Next, if the bottleneck time-space region overlaps with the impact
Empirical assessment of traffic operations 115 region of a collision, that day is excluded. An estimate of the reduction in delay is then computed using the procedure in IDEAL METERING. This gives an estimate ofDpo, in (13). Details are in (Kwon, J. and P. Varaiya, 2005). Step 4 The three delays estimated above, together with overall VHT from PeMS are displayed in the pies of figure 5. An important side-effect of the procedure is an estimate of the delay caused by each collision, Dcoi,a (14). Of 74 collisions during the study period, two-thirds cause no additional delay. These occur either when recurrent congestion is very low or very high. Eight outliers (10% of collisions) account for 90% of total collision delay. Incident management could be made more effective if the high delay-causing accidents could be quickly diagnosed once they occur. TASAS provides crash information including type of collision, number of vehicles involved, and weather. From this information, we find the strongest predictor of high delay-causing accidents is the number of vehicles involved; adverse weather is a moderately strong predictor; all others, including injury and trucks, are weak predictors. Note, however, that the data set in the study contains only 74 collisions.
PREDICTING TRAVEL TIME The delay on a freeway on the same day of week varies much more than the total demand. Travelers experience this variation as large uncertainty in their travel time. Let T(t) be the travel time of a trip over a fixed route starting at time t. T(t) is a stochastic process with trends that can be calculated from historical data, and a large variance due to congestion. Let a (i) be the (unconditional) variance of T(t), and let a (t,s) be the variance of the predictor T(t,s) of this travel time conditioned on knowledge of traffic conditions up to time s < t. Because the travel time process has a large autocorrelation, a2(t, s) is much smaller than o2(t). We summarize a study (Chen, C. et al., 2004a) which estimates the benefits of prediction.
(a) Travel times
(b) Prediction vs. historical
(c) Prediction vs. optimum
Figure 6 The scatter plot of travel times along the two routes (a). Comparison of minimum predicted travel time vs. historical (b) and vs. true minimum travel time (c). Source: (Chen, C. et al., 2004a). The study compares travel time along two alternate routes between the I-5/I-805 interchange and the I-5/I-163 interchange in San Diego. Route 1 is entirely along I-5S, Route 2 has its first segment on 1-805 and the second segment on I-163S. Travel times T\{t) and T2(t) along the
116 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction two routes are computed for departure times t between 0500 and 2200 during the 22 weekdays between 1 and 31 August, 2002. There are 1320 departure times over the study period at every 17 minutes. Each point in the scatter plot of figure 6(a) represents (T\(t), T2(t)) with the same departure time /. There are 1320 points. Two features of the scatter plot are clear. First, the travel time distributions on the two routes are similar. Second, there is a large uncertainty: 90% of the distribution lies between 12 and 35 minutes, with a median below 20 min. A PeMS application predicts travel time T(t,t) for a trip starting at any time t, based on historical data and real time data available up to time t (van Zwet, E. and J. Rice, 2001). We now estimate the travel time savings using the PeMS prediction. Figure 6(b) compares the travel time that would be experienced by a traveler who selects the route with the shorter predicted travel time mini f;(t,t), with that of a traveler who selects the route with the shorter expected travel time min; ET,{t), which can be estimated from historical data alone. Most of the points lie on or below the 45 degree line, indicating that reliance on PeMS prediction is much better than historical experience. The travel time saving is the horizontal distance to the 45 degree line. Figure 6(c) compares the travel time based on PeMS prediction with that of a clairvoyant traveler who unerringly chooses the route with the shorter travel time, min,- Tfo). Naturally, all points lie below the 45 degree line, but the significant feature is how frequently the points lie on the 45 degree line, indicating that prediction correctly selects the ex post shorter route. When there are alternative routes as is the case here, accurate travel time prediction reduces both the average travel time and the uncertainty. Even when alternative routes are not available, the reduction in uncertainty increases traveler welfare. Estimates in (Chen, C. et al., 2004a) suggest that the benefits are significant for the example presented here. As a final remark we note that the travel time estimate in (van Zwet, E. and J. Rice, 2001) involves predicting the traffic conditions that the traveler will encounter along the route. Such a predictor performs much better than the commonly used predictor which simply adds up the most recently reported travel times on the segments along the route.
EVALUATION OF HOV LANE EFFECTIVENESS Several studies reach the obvious conclusion that HOV travelers benefit from lower travel times, see e.g. (DKS Associates, 2003; The PB Study Team, 2002). But these studies do not evaluate the impact of HOV lanes on overall congestion, including the congestion on mixedflow lanes. San Francisco Bay Area data are especially helpful in evaluating this impact, because its HOV lanes are time-actuated. To facilitate comparison, the evidence below is for freeways with heavier PM peak traffic. In all cases, lane 1 (the fast lane) is HOV actuated on weekdays between 0500-0900 (5:00-9:00 AM) in the morning and 1500-1900 (3:00-7:00 PM) in the evening; at all other times HOV is deactuated. We argue that in the Bay Area, HOV lanes increase overall congestion. Figure 7 shows speed and flow on all three lanes, l(HOV), 2 and 3, of SR-237E at a particular location on 18 August 2004. During the 0500-0900 HOV actuation period, the HOV lane is underutilized, but since overall traffic is low, all lanes are in the free flow regime. (Most HOV lanes in the off-peak direction are underused (DKS Associates, 2003, Table 3, p.7).)
Empirical assessment of traffic operations 117 Immediately after deactuation at 0900, speed and flow are (nearly) equalized on all lanes, and they remain in the free flow regime until HOV re-actuation at 1500. At 1500 HOV flow drops dramatically, compensated by increased flows in lanes 2 and 3. But until 1700, all three lanes remain in the free flow regime, and flows in lanes 2 and 3 reach a maximum. From 1700 until 1900, HOV flow increases and speed decreases, and the HOV lane remains in free flow. However, lanes 2 and 3 enter the congestion regime. They suffer a large reduction in both speed and flow. The decline in flow is severe enough to reach the level of the HOV lane at 1900. TnTj
Figure 7 Speed and flow in lanes l(HOV), 2 and 3 on 18 August 2004 at VDS 400104 on SR-237E. The impact of HOV actuation on overall congestion can be seen by comparing the behavior before and after HOV deactuation at 1900 in figure 7. HOV activation during 1700-1900 reduces capacity for non-HOV traffic (which loses one lane), pushes non-HOV lanes into the congestion regime, and reduces total non-HOV flow. Thus traffic suffers a non-HOV congestion penalty. Shortly after deactuation at 1900, all lanes enter the free flow regime, and total flow reaches a maximum over the entire day. More surprisingly, even HOV lane performance improves after deactuation: both speed and flow increase. Put inversely, both speed and flow in the HOV lane decline during HOV actuation, even though it is in free flow. We call this the HOV capacity penalty. In summary: HOV actuation imposes a congestion penalty on non-HOV lanes and a capacity penalty on the HOV lane. The HOV capacity penalty—increased HOV speed and flow after deactuation—is seen in the six freeway locations we examined. Figure 8 shows speeds in six different freeways during 1400-2000, starting one hour before the afternoon HOV actuation at 1500 and ending one hour after HOV deactuation at 1900. (Flows are not shown as they have the expected behavior, similar to that in figure 7.) In all cases, speeds in all lanes, including lane l(HOV), increase after deactuation; moreover, flow in lane l(HOV) increases, and flows in the other lanes decrease. The lane l(HOV) capacity penalty is explained as follows. The flow increases after deactuation because drivers in lane 2 move into the lower density lane 1. The speed decreases
118 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction during HOV actuation because the HOV lane becomes a one-lane highway whose speed is governed by the low speed vehicles—the 'snails'. As the non-HOV congested lanes are even slower, a faster HOV driver cannot pass the slower snail in front of it. However, as soon as HOV is deactuated, slower drivers move to the outer lanes and the fastest drivers move to (what was) the HOV lane. Speed in all lanes increase—usually dramatically as in figure 8. The hypothesis that during HOV actuation speed is controlled by snails is confirmed in the scatter plots of figure 9. Each point is a 5-minute average of flow and speed. Plot (a), during HOV actuation, shows a sharp decrease in speed as flow (and hence the number of snails) increases, even though the lane is in free flow. Plot (b) shows no decrease in speed, as only the fast drivers are in lane 1. The difference between plots (a) and (b) is typical of a one-lane vs. a multi-lane highway in free flow.
Figure 8 Speeds in all lanes at locations on six different Bay Area freeways, 1400-2000, beginning one hour before HOV activation (at 1500) and ending one hour after HOV activation (at 1900). In all cases, speed is highest in lane 1 (HOV), followed by lane 2, lane 3, etc. The notation 80E-400808-080804 means VDS 400808 on I-80E on August 8, 2004. Three different (non-exclusive) causes may account for snails. A proportion of HOV drivers may be intrinsically slow, so their number grows as HOV flow increases. Second, the slowdown may be caused by lane changes by HOV drivers (and SOV violators) from the slower lane 2 into the HOV lane. The lane changes increase in proportion with HOV lane flow, farther reducing HOV lane speed. Third, as the speed differential between the HOV and
Empirical assessment of traffic operations 119 the adjacent non-HOV lane increases, drivers in the HOV lane may slow down due to the increased perceived risk of a collision should someone from the non-HOV lane merge into the HOV lane. In the last two cases, an HOV lane that is physically separated from lane 2 would not exhibit the slowdown seen in figure 9 (a), hi either case, the slowdown would not be seen in freeways with two HOV lanes.
Figure 9 Speed vs. flow (5-min averages) in lane 1, (a) 1600-1900, HOV actuated, and (b) 1900-2100, HOV de-actuated, for five weekdays in August, 2004, at VDS 400352 on I-880S. We finally arrive at the interesting question: "Will the overall congestion in the six cases in figure 8 be reduced by eliminating the HOV lane?" The answer would be unreservedly "yes," but for two qualifications: one having to do with freeway management, the other with mode choice. It is obvious that a management strategy with no HOV lane and no metering will lead to greater congestion than a strategy with one HOV lane and no metering, because HOV actuation serves as a (one-lane) metering mechanism. So to fairly compare an HOV vs. a nonHOV regime, we must assume that proper ramp metering is in place to guarantee vehicle flow in non-HOV lanes that is close to maximum observed vehicle flow. The second qualification is more interesting. It is based on either of two claims: (1) HOV lanes move significantly more people overall (even if they don't move more vehicles), (2) HOV lanes induce enough drivers to switch from SOV to HOV to compensate for both the congestion penalty imposed on non-HOV lanes and the capacity penalty imposed on the HOV lane by HOV actuation. We cannot address the second claim because there are no empirical estimates of the SOV-HOV mode shift for the Bay Area. We evaluate the first claim that HOV actuation increases flow of persons/hour. We calculate flow of persons per hour (PPH) by multiplying vehicle flow (from PeMS) and AVO (average vehicle occupancy). Since the accuracy of vehicle counts exceeds 90-95%, the single most important empirical quantity in any study of HOV effectiveness is the AVO. Unfortunately, AVO estimates are very unreliable for many reasons (Levine, N. and M. Wachs, 1994), so we will use a range of estimates. According to (California Department of Transportation, District 4, Office of Highway Operations, 2002, p. 66) on the section of I-880S that includes VDS 400486 in figure 8,
120 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction during the afternoon peak hour, the HOV lane AVO is 2.1, and the AVO on the three nonHOV lanes is 1.1. We use these estimates for the HOV actuation period. (The HOV AVO rate should be reduced by a highly variable HOV violation rate measured at 5.8% on 5 July, 2002.) AVO estimates during HOV deactuation are not available, and we have several alternatives: the State Household Travel Survey gives an AVO of 1.5 for all trips and 1.1 for home to work trips; the Metropolitan Transportation Commission for the Bay Area gives an AVO of 1.4 for all trips and 1.1 for home to work trips; lastly, the California Life-Cycle Benefit/Cost Analysis Model uses a default of 1.38 for peak period AVO. We will use 1.25, 1.3 and 1.4 for AVO during HOV deactuation. Figure 10 (a) plots the flow in persons per 5-minutes, aggregated over all lanes, with HOV AVO = 2.1 and non-HOV AVO = 1.1 during HOV actuation, and AVO = 1.25, 1.3 or 1.4 during HOV deactuation.
Figure 10 (a) Flow in persons per 5-min using the indicated AVO values, and (b) cost index per person-mile and per vehicle-mile, 1400-2000, 18 August 2004, at VDS 400486,1-880S. With the two higher AVO estimates, HOV actuation causes a reduction in the flow of persons per hour compared with the period 1400-1500 before actuation. With the lowest AVO estimate, HOV actuation causes a small increase in PPH compared with the period 14001500. So the data do not support the claim that HOV actuation significantly increases (say by 10%) the flow in persons per hour. In comparing the HOV vs. non-HOV regime, we should not ignore the travel time cost imposed by HOV actuation. Knowing the speed and the flow in persons/5-min and vehicles/5min in each lane, we can calculate the amount of time that each person and vehicle takes to travel a fixed distance. This gives us a 'cost index', which will vary over time, as the flow and speed vary. Figure 10 (b) displays the two cost indices (AVO = 1.25 is used for these plots). Evidently, the average person (on all lanes) pays a travel time cost during HOV actuation (1700-1900) that is two-and-a-half times higher. Of course, a significant part of this higher cost is due to inadequate ramp metering. If we think of the freeway as a 'people-mover' and the cost of its operation to be travel time, we must conclude that the cost is increased during HOV actuation. This is a much better indicator of productivity loss than the productivity gain measured as the ratio between HOV AVO and non-HOV AVO in (DKS Associates, 2003, p.6,8). The latter productivity gain merely reflects the fact that HOV actuation causes carpools to move into the HOV lane.
Empirical assessment of traffic operations 121 We close this section with some remarks. First, the analysis above leads to conclusions that run counter to those reached by most studies of HOV effectiveness. Because the evidence presented here is fragmentary, the analysis must be repeated with a more complete data set before the conclusions can be trusted. Second, it is possible from Bay Area data to estimate the SOV-HOV mode shift, based on the hypothesis that the shift will be more pronounced the larger is the travel time differential between HOV and non-HOV lanes. Also, people may find the SOV-HOV shift to be less inconvenient on some routes than on others. Third, when a 2+ (i.e. two or more persons) HOV lane becomes congested, it is sometimes converted to a 3+ lane. The SOV-3+HOV shift will certainly be lower than the SOV-2+HOV shift. So the conversion from 2+ to 3+HOV lane may increase overall congestion. Lastly, because HOV lanes in the Bay Area are time-actuated, it is straightforward to estimate both the non-HOV congestion penalty and the HOV capacity penalty. This distinction is less obvious in a 24-hour HOV facility, although it, too, imposes both penalties. There is interest in increasing the utilization of underused HOV lanes by converting them into HOT (HOV/Toll) lanes. The snail phenomenon implies, however, that even modest increases in volume following conversion will bring down HOT speed to that of non-HOT lanes (which, moreover, will have higher speed because they carry less traffic). That is, the HOV capacity penalty does not leave much room for additional traffic, so that even the cautious estimates for revenue enhancement in the Bay Area may be overly optimistic (DKS Associates, 2003, p. 22). A recent proposal to permit hybrid vehicles into HOV lanes will certainly increase congestion. From a purely technical viewpoint, this discussion suggests that a better way to manage freeways is to eliminate HOV lanes, institute ramp metering, and permit HOV/HOT bypass at ramps. This will eliminate the HOV penalties, while encouraging mode shift from SOV to HOV. On the other hand, by having weak or no ramp metering, the HOV regime can always be made to look better. For policy considerations this technical viewpoint has to be weighed with many other factors.
CONCLUSIONS In its draft Transportation Management Systems (TMS) Master Plan (System Metrics Group, Inc., 2003), Caltrans proposes an action plan to improve incident management, traffic control, and traveler information. Central to the plan is its reliance on specific performance indicators to serve "as monitoring and evaluation tools, and establish an accountability framework for the implementation of planned TMS improvements." Caltrans has invested significant resources to develop a performance measurement system (PeMS). This paper illustrates why PeMS became a major source of 'performance indicators' and suggestions for performance targets. The paper uses PeMS data to study freeway congestion from six different perspectives, ranging from identification of bottlenecks to evaluating the benefits of ramp metering and the effectiveness of HOV lanes. In each study, the aim is to measure the severity of congestion and reveal the opportunity for improvement. The approach is to argue on the basis of
122 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction statistical models that the data are used to estimate. Qualitatively of course the models are inspired by prior theory, but the emphasis is always on quantitative conclusions. Partly motivated by the success of PeMS, some universities and DoTs are developing smallscale prototypes of PeMS-like systems. These efforts will have a small impact until state DoTs invest in data collection infrastructure. The availability of these data will shift DoT focus from construction to operations improvements. Academic research, too, will change as it exploits opportunities opened up by access to large-scale data sets and pays more attention to questions that address the opportunities for operations improvements and conducting experiments that demonstrate improvements.
ACKNOWLEDGEMENT We are grateful for comments and criticism from Professor Martin Wachs of U.C. Berkeley; Robert Copp, Fred Dial, David Seriani and John Wolf of Caltrans; and Tarek Hatata of the System Metrics Group. This study is partly based on research that was supported by grants from Caltrans to the California PATH Program. The contents of this paper reflect the views of the authors who are responsible for the facts and the accuracy of the data presented herein. The contents do not necessarily reflect the official views of or policy of the California Department of Transportation. This paper does not constitute a standard, specification or regulation.
REFERENCES California Department of Transportation, District 4, Office of Highway Operations. (2002) HOV lanes in the Bay Area. Chen, C , Z. Jia, and P. Varaiya. (2001). Causes and cures of highway congestion. IEEE Control Systems Magazine, 21(4):26-33. Chen, C. and P. Varaiya. (2001). Max flow in D12 occurs at 60 mph. http://pems.eecs.berkeley.edu. Chen, C , A. Skabardonis, and P. Varaiya. (2004a). A system for displaying travel times on changeable message signs. In Proceedings of 83rd Transportation Research Board Annual Meeting, Washington, D.C., January 2004. Chen, C , A. Skabardonis, and P. Varaiya. (2004b). Systematic identification of freeway bottlenecks. In Proceedings of 83rd Transportation Research Board Annual Meeting, Washington, D.C., January 2004. DKS Associates. (2002). 2002 High Occupancy Vehicle (HOV) Lane Master Plan Update. Prepared for Metropolitan Transportation Commission, Caltrans District 4 and the California Highway Patrol Golden Gate Division. Hallenbach, M.E., J.M. Ishimaru, and J. Nee. (2003). Measurement of recurring versus nonrecurring congestion. Washington State Transportation Center (TRAC). Jia, Z., P. Varaiya, C. Chen, K. Petty, and A. Skabardonis. (2000). Congestion, excess demand and effective capacity in California freeways, http://pems.eecs.berkeley.edu.
Empirical assessment of traffic operations 123 Jia, Z., P. Varaiya, C. Chen, K. Petty, and A. Skabardonis. (2001). Maximum throughput in LA occurs at 60 mph. http://pems.eecs.berkeley.edu. Kwon, J. and P. Varaiya. (2005). The congestion pie: delay from collisions, potential ramp metering gain, and excess demand. In Proceedings of 84th Transportation Research Board Annual Meeting, Washington, D.C., January 2005. Levine, N. and M. Wachs. (1994). Methodology for Vehicle Occupancy Measurement. Report submitted to the California Air Resources Board and the California Department of Transportation (Office of Traffic Improvement). Martin, W. (1998). Travel estimation techniques for urban planning. Technical report, NCHRP Report 365, Transportation Research Board, Washington, D.C. Papageorgiou, M. (1983). Applications of Automatic Control Concepts to Traffic Flow Modeling and Control. Lecture Notes in Control and Information Sciences, Vol. 50. Springer. Papageorgiou, M., H. Hadj-Salem, and J. Blosseville. (1991). ALINEA: a local feedback control law for on-ramp metering. Transportation Research Record, 1320, 58-64. System Metrics Group, Inc. (2003). Transportation Management Systems Plan. The PB Study Team. (2002). HOV Performance Program Evaluation Report. Los Angeles County Metropolitan Transportation Authority, van Zwet, E. and J. Rice. (2001). A simple and effective method for predicting travel times on freeways. In 2001 IEEE Intelligent Transportation Systems Proceedings, pp. 227-232, Oakland, CA, 2001.
This Page is intentionally Left Blank
RELIABILITY OF FREEWAY TRAFFIC FLOW: A STOCHASTIC CONCEPT OF CAPACITY Werner Brilon, Justin Geistefeldt, and Matthias Regler, Institute for Transportation and Traffic Engineering, Ruhr-University, Bochum, Germany
INTRODUCTION Conventional measures of effectiveness for freeway facilities usually reflect travel time in the form of e.g. travel velocity or delay. Recently it has been becoming more and more obvious that these parameters are not sufficient for freeway traffic performance assessment since they place great emphasis on smaller differences in travel time, whereas the more significant difference between flowing traffic and congestion is not adequately represented. In addition, traditional quality assessment fails whenever demand exceeds capacity because it will simply attest a failure in this case. However, temporary freeway overloads are quite common. This is why quality assessments for different degrees of freeway congestion are required as well (cf. Shaw, 2003). The capacity of a freeway is traditionally treated as a constant value in traffic engineering guidelines around the world, such as the HCM (2000). Doubts about this nature of capacities as constant values were raised by Ponzlet (1996) who demonstrated that capacities vary according to external conditions like dry or wet road surfaces, daylight or darkness, and prevailing purpose of the freeway (long distance or metropolitan commuter traffic). Moreover, several authors affirmed that even under constant external conditions, different capacities can be observed on freeways in reality (Elefteriadou et al., 1995; Minderhoud et al, 1997; Persaud et al., 1998; Kuehne and Anstett, 1999; Lorenz and Elefteriadou, 2000; Okamura et al., 2000). Most of these authors only observed traffic breakdowns at different flow rates to demonstrate the variability of flows preceding a breakdown. For a more systematic analysis, however, a comprehensive theoretical concept is required.
126 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
BASIC CONCEPT OF STOCHASTIC CAPACITY Corresponding to the HCM (2000), the capacity of a freeway is defined as the maximum flow rate that can reasonably be expected to traverse a facility under prevailing roadway, traffic, and control conditions. With an identical meaning, the term "capacity", i.e. the maximum flow rate, could also be defined as the traffic volume below which the performance of the facility is acceptable and above which - in case of greater demand - proper operation fails. The transition between proper operation and non-acceptable flow conditions is called "breakdown". On a freeway, such a breakdown occurs when the average travel velocity is reduced from an acceptable speed level to a much lower value of congested conditions. These transitions usually involve a rather sudden speed reduction. The suddenness of this breakdown, however, may differ from one country to another depending on the general driving culture. From this definition, it is clear that capacity in this sense is by no means a constant value. A constant value would mean that, given a capacity of e.g. 3,600 veh/h, the traffic should be fluent at a demand of 3,599 veh/h and be congested at a demand of 3,601 veh/h. This clearly indicates that the demand volume that causes breakdown varies in real traffic flow and that the flow rate of a breakdown depends on the behavior of several drivers combined with the specific local constellation on the freeway. Thus, it is plausible that the breakdown volume should have all properties of a random variable. For using this concept of freeway capacity randomness it is necessary to know more about the capacity distribution function. Its determination is, however, not a trivial task. It is clear that any analytical approach must be supported by a broad empirical investigation. Observations of traffic flow on freeways deliver pairs of values of traffic flow rates and average speeds during predetermined observation intervals (index i). According to the definition of capacity, the observed volume will be below capacity if the average speed exceeds a certain threshold value (e.g. about 70 km/h for German freeway conditions). With an average speed lower than the threshold value, traffic flow is congested. Thus, the flow must have exceeded capacity during the time between two such observations. The capacity itself, however, can not be measured directly. In addition, higher demand volumes are less likely to be observed in the field since there is also a higher probability that, before they occur, the breakdown has already happened during preceding intervals at lower volumes. Both effects make it difficult to estimate the capacity distribution function, which is defined
Fc(q) = p(c
(1)
where Fc(q) c q
= capacity distribution function = capacity = traffic volume
[-] [veh/h] [veh/h]
Reliability of freeway traffic flow
127
A practicable estimation method was first presented by van Toorenburg (1986) and discussed by Minderhoud et al. (1997). The investigations presented here are based on this idea. However, it seemed advisable to modify some of the basic assumptions of the method. The method proposed by van Toorenburg (1986) is based on an analogy to the statistics of lifetime data analysis. This statistics, in its basic formulation, serves to describe the statistical properties of the duration of human life. Moreover, it is usually applied to analyze the durability of technical components. In this context, the lifetime distribution function is: F(t) = l-S(t)
(2)
where F(t) T S(t)
= distribution function of lifetime = p(T t)
Lifetime distributions are often estimated on the basis of experiments of limited duration. Consequently, the lifetimes of several individuals in the sample exceed the duration of the experiment and therefore can not be measured. It is only possible to state that these lifetimes are longer than the duration of the experiment. However, even this information is valuable. These data are called "censored data" (cf. e.g. Lawless, 2003). If a traffic breakdown is regarded as a failure event, the methods for lifetime data analysis can be used to estimate the capacity c, which is the analogon of the lifetime T. The whole analogy between capacity analysis and lifetime data analysis is given in Table 1. Table 1: Analogy between lifetime data analysis and capacity analysis Analysis of Lifetime Data Timet Death at time t Lifetime T Lifetime T is longer than the Censoring duration of the experiment Survival function S(t)=l-F(t) Probability density function f(t) Probability distribution function F(t) Parameter Failure event Lifetime variable
Capacity Analysis Traffic volume q Breakdown at volume q Capacity c Capacity c is greater than traffic demand Sc(q) = l-F c (q) fc(q) Fc(q)
The statistics of lifetime data analysis can be used to estimate distribution functions based on samples that include censored data. A non-parametric method to estimate the survival function is the so-called "Product Limit Method" (PLM) by Kaplan and Meier (1958):
128 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
i—r n , — d ,
sw = n -—-
p)
where S(t) nj dj
= estimated survival function = number of individuals with a lifetime T>tj = number of deaths at time tj
[-] [-] [-]
Usually, each observed lifetime is used as one tj-value. In this case, dj in Eq. 3 is always equal tol. Transferred to capacity analysis, Eq. 3 together with Eq. 2 can be written as:
Fc(q) = l - n ^ L : i e { B }
(4)
where Fc(q) q qi k; d; {B}
= = = = = =
distribution function of capacity c traffic volume traffic volume in interval i number of intervals with a traffic volume of q >q; number of breakdowns at a volume of q; set of breakdown intervals (see below)
[-] [veh/h] [veh/h] [-] [-]
Using this equation, each observed traffic volume q is classified according to B: Traffic is fluent in time interval i, but the observed volume causes a breakdown, i.e. the average speed drops below the threshold speed in the next time interval i + 1. F: Traffic is fluent in interval i and in the following interval i + 1. This interval i contains a censored value. Its information is that the actual capacity in interval i is greater than the observed volume q;. Cl: Traffic is congested in interval i, i.e. the average speed is below the threshold value. As this interval i provides no information about the capacity, it is disregarded. C2: Traffic is fluent in interval i, but the observed volume causes a breakdown. However, in contrast to classification B, traffic is congested at a downstream cross section during interval i or i - 1. In this case, the breakdown at the observation point is supposed to be due to a tailback from downstream. As this interval i does not contain any information for the capacity assessment at the observation point, it is disregarded. The Product Limit Method does not require the assumption of a specific type of the distribution function. However, the maximum value of the capacity distribution function will only reach 1 if the maximum observed volume q was a B-value (i.e. followed by a
Reliability of freeway traffic flow
129
breakdown). Only in this case, the product in Eq. 4 will be 0. Otherwise the distribution function will terminate at a value of Fc(q) < 1 at its upper end. Eq. 4 is a useful solution for estimating the capacity distribution function of a freeway from traffic observations. For practical application, two items remain to be defined: Duration At of observation intervals For analysis, only rather short observation intervals are useful. Otherwise the causal relationship between traffic volume and breakdown would be too weak. 1-hour counts, for example, are not adequate for this reason. Ideally the observation period should be 1 minute or even less. Considering both the availability of reliable data from loop detectors and the usefulness of the results, Brilon and Zurlinden (2003), after experiments with different At's, came to the conclusion that At = 5 minutes was the best compromise. Consequently, the analyses below are all based on 5-minute volume and speed values. Exact understanding of a breakdown The definition of a breakdown mentioned above (e.g. in Eq. 4) is a decisive aspect of the whole methodology. Van Toorenburg (1986; see also Minderhoud et al., 1997) defined breakdown capacity as the volume measured downstream of a queue at a bottleneck. In consequence, each congested flow volume is regarded as a B-value (see comments to Eq. 4). Within the meaning of the analogy (Table 1) this would be equivalent to including in a lifetime analysis an individual who died a while ago. This does not seem to be reasonable. Instead, only those intervals i that cause a breakdown are treated as B-intervals. As a breakdown of traffic flow usually involves a significant speed reduction, breakdown events can be detected using a time series containing both traffic volumes and average space mean speeds. This is done by using a constant threshold speed value. If the speed falls below the threshold value in the next interval i + 1, the traffic volume in interval i is regarded as a Bvalue. A threshold speed of 70 krn/h was found to be fairly representative for German freeways but may be different for other road types. In some cases, different or more detailed criteria may be required to reliably identify traffic breakdowns - e.g. a criterion that considers the minimum speed difference between the intervals i and i + 1. The capacity of a freeway section (one direction) can be analyzed most precisely if observations are made at a clearly distinguishable bottleneck, as Fig. la shows. At such a bottleneck, breakdowns should only be caused by oversaturation of the bottleneck itself. Tailback from downstream should not occur as greater capacities are always available in the succeeding section. Observations are therefore made at a point slightly upstream of the bottleneck. Such observations were performed by Brilon and Zurlinden (2003) to make sure that the external conditions were clearly in harmony with theoretical assumptions.
130 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
As an example, Fig. 2 shows speed-flow diagrams from two observation sections along the ring of freeways around the city of Cologne. Both sites are geometric bottlenecks with the road widening downstream of the observation point. The figure shows speed-flow data for 5minute counts across all lanes obtained from automatic loop detectors throughout the year 2000. Due to frequent oversaturation of both freeway sections, many congested intervals were observed. With the conventional approach (estimation of a regression model in the k-v diagram plus deriving the maximum flow rate from q = k v), a capacity of 4284 veh/h for the 2-lane example and 6720 veh/h for the 3-lane case was determined based on the speed-flow relationship proposed by van Aerde (1995).
Fig. 2: Speed-flow diagrams for two freeway sections (5-minute intervals) The Product Limit technique (Eq. 4) was used to estimate the capacity distribution function for both examples (see black lines in Fig. 3). 933 intervals with a breakdown (classification B) were identified on the Al freeway and 834 on the A3 freeway. It appears that, despite the large size of a one-year sample, no complete distribution function could be estimated since the highest q-values observed were not followed by a breakdown. This effect makes it difficult to find an appropriate estimate for the whole capacity distribution function.
Reliability of freeway traffic flow
131
Fig. 3: Estimated capacity distribution functions for two freeway sections according to Fig. la (5-minute intervals, dry roadway conditions) To overcome this problem, it is necessary to know more about the mathematical type of the distribution function Fc(x), which did not have to be defined for Eq. 4. Various plausible function types like Weibull, Normal and Gamma distribution were tested (Brilon and Zurlinden, 2003). To estimate the parameters of the distribution functions, a maximum likelihood technique was used. The likelihood function is given by (cf. Lawless, 2003):
L = flf c (q i ) 5l -[l-F c (q 1 )] 1 ^
(5)
where fc(qi) F c (q0 n 8j 8;
= = = = =
statistical density function of capacity c cumulative distribution function of capacity c number of intervals 1, if uncensored (breakdown of classification B) 0, elsewhere
[-] [-] [-]
The likelihood function or its natural logarithm (log-likelihood) has to be maximized to calibrate the parameters of the distribution function (cf. e.g. Lawless, 2003). By comparing different types of functions based on the value of the likelihood function, the Weibull distribution turned out to be the function that best fitted the observations at all freeway sections under investigation. The Weibull distribution function is:
-f-T F(x) = l - e
w
for x > 0
(6)
where a
= shape parameter
[-]
132 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction (3
= scale parameter
[-]
The two examples in Fig. 3 show that the Weibull distribution fits very well into the PLM estimation. Of course, the Product Limit Method for capacity estimation could also be used with traffic densities k instead of volumes q. Eq. 4 and 5 remain unchanged, except that q is replaced by k. It was expected that k would be a better determinant for the occurrence of a breakdown than q and that, consequently, the analysis would reduce the variability of the resulting distribution function. This was tested by Regler (2004) using data from six 3-lane freeway sections. The median of the breakdown densities ranged from 70 to 90 veh/km with Weibullparameters a = 8.4 through 13.2 and p = 72 through 92 veh/km for the analysis of 5-minute intervals. The resulting distribution of breakdown density and breakdown capacity tended towards larger variances compared to the analysis over the q-axis. Therefore, it was not advantageous in this context to estimate capacity distributions from densities. Moreover, densities are artificial parameters that must be calculated from measured speeds v and volumes q (k = q / v). The k-based analysis also needs a more complicated definition of the speed threshold between fluent and congested traffic. Therefore, using the Product Limit estimation based on densities is not recommended.
APPLICATION TO FREEWAYS So far, only results from freeway bottlenecks according to Fig. la have been discussed. Under this assumption, the estimation technique would be restricted to rather specific geometric situations. Regler (2004) applied the methods described above to freeway sections without a distinct bottleneck (Fig. lb) whose geometric properties included no change in the number of lanes. To make sure that intervals with a tailback from downstream bottlenecks did not impair the results, classification C2 (see above) was considered as well. With this technique, the capacity distribution of quite a variety of freeway sections could be analyzed (Table 2). The analysis was based on 5-minute counts taken over several months, with an arrangement as shown in Fig. lb. All sites are on 3-lane freeway carriageways, mainly in level terrain. Periods of work zones were excluded from the data. It turns out that the shape parameter a in the Weibull distribution typically ranges from 9 to 15 with an average of 13. This magnitude seems to be characteristical for 3-lane freeways. The scale parameter p of the Weibull distribution varies over a wide range between the analyzed sections. This may be mostly due to different geometric and control conditions, different driver and vehicle populations, and diverse prevailing travel purposes (long distance travel versus metropolitan commuter traffic).
Reliability of freeway traffic flow 133 Table 2: Parameters p and a, expectation E(c) and standard deviation c of the estimated Weibull capacity distribution at 15 freeway sections (3-lanes, 5-minute intervals) Section A3-1 A5-1 A5-2 A5-4 A5-5 A5-6 A5-7 A5-8 A9-1 A9-2 A9-3 A9-4 A9-5 A9-6 A9-7
P [veh/h] 7441 6217 6074 6608 6392 6272 7194 6884 7937 7399 5988 6141 6648 7109 6648
a[-] 11,31 11,15 13,59 13,92 14,16 14,69 13,98 13,35 8,85 13,66 14,82 18,86 14,24 9,62 14,92
E(c) [veh/h] 7115 5941 5847 6365 6161 6053 6932 6622 7510 7124 5780 5969 6409 6752 6419
a [veh/h] 762 645 526 559 532 505 606 606 1013 637 478 392 551 842 528
Having found that the shape parameter a seems to be almost constant, we may transform the capacity distribution function to fit different interval durations A. According to Eq. 1, F5(q) is the probability of a breakdown during A = 5 minutes at flow rate q. Hence, (1 - Fs(q)) is the probability of no breakdown occurring in this interval. If we assume that breakdowns occurring in succeeding intervals are independent of each other, then the probability of fluent traffic flow during a whole hour is p60 (fluent traffic) = [l - F5 (q)] n
(7)
Using the Weibull distribution (Eq. 6), this is converted into i2
F « ( q ) = l - P 6 o (fluent traffic) = l - e
(-T
UiJ
(8)
which is again a Weibull distribution with an unchanged shape parameter a and a scale parameter p6o = r p 5 , where r = 12("1/a). With a = 13 (see above) we get r « 0.82 » 1/1.2. This means that for 5-minute observations the expected capacity should be in a range of 1.2 times the 1-hour capacity. This factor of 1.2 seems to be typical for the transformation of capacities from 5-minute intervals into 60-minute intervals, as was pointed out by Keller and Sachse (1992) or Ponzlet (1996) based on empirical capacity estimates obtained from the fundamental diagram. One might object to Eq. 8 that the traffic volume q usually is not constant during a whole hour. However, numerical calculations showed that volume variations during one hour did not
134 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction significantly change the results. It also seems to be realistic to assume that traffic breakdowns in succeeding intervals are independent of each other since there is no imaginable reason why the opposite should be true. This question may, however, be made a subject of further research. The new technique was used to investigate differences in performance between dry and wet road surfaces. At all sections under examination (see list in Table 2), it turned out very clearly that on a wet road surface the capacity was reduced by around 11 %. The effects of darkness were investigated as well. Contrary to Ponzlet's (1996) results, it was clearly found that darkness did not shift the capacity distributions. The results shown in Table 2 also demonstrate differences in the capacity distribution between an uncontrolled freeway (section A9-3) and a freeway with traffic adaptive variable speed limits (section A9-4): The mean capacity of the controlled section is slightly (by 3 %) higher compared to the uncontrolled section, but the standard deviation is significantly lower (cf. Fig. 4). The two analyzed sections are the two opposite carriageways of the freeway A9 near Munich and thus have similar geometric and traffic characteristics.
Fig. 4: Capacity distributions for a 3-lane freeway with and without variable speed control (13.5 % average truck percentage, 5-minute intervals) All these examples demonstrate that the statistical interpretation of freeway capacity together with the corresponding estimation technique provides a better understanding of freeway traffic operation. It improves the methodology of investigating differences between various external conditions.
FREEWAY TRAFFIC DYNAMICS So far, only capacities in the upper branch of the speed-flow diagram, i.e. under fluent traffic conditions, have been analyzed. However, the lower branch of the speed-flow diagram representing congested conditions must be considered as well.
Reliability of freeway traffic flow
135
It is well known that dynamics in the speed-flow diagram (i.e. the sequence of v-q points over time) follow specific patterns. The first to report typical hysteresis phenomena within these dynamics were Treiterer and Myers (1974). More recently, Kim and Keller (2001) came to the conclusion that six different typical traffic states should be distinguished within the speedflow diagram (or the fundamental diagram). These dynamics were analyzed by Regler (2004) based on 5-minute data for the freeway sections A3-1 and A5-7 (cf. Table 2) extending over 4 months and 10 months, respectively. More than 120 breakdowns from fluent traffic to congested traffic were observed. The analysis came to the conclusion that there are three different states of traffic conditions to be distinguished: 1. Fluent traffic at high speeds (i.e. v > 70 km/h) and low densities. In this state, volumes q may range from 0 to the maximum flow rate. This is the ascending branch of the q-k diagram. 2. A transient state with an average velocity of around 60 km/h and rather high volumes. We like to call this state "synchronized flow", knowing that this term is used by other authors (Kerner and Rehborn, 1996) with a slightly different meaning. In this state, vehicles are forced to travel at fairly similar speeds on all lanes. 3. Congested traffic with low speeds and low traffic volumes. To illustrate typical dynamic patterns, Fig. 5a shows observations from the freeway A5 with only states 1 and 2 involved. In all examples, the transition from fluent to synchronized flow began at a rather high volume. Traffic flow stabilized at slightly lower volumes at an average speed of about 60 km/h. From here, the traffic flow recovered to fluent traffic conditions. All recoveries involved much lower traffic volumes than the preceding breakdown. This hysteresis phenomenon seems to be a characteristic of traffic dynamics. In addition to these 2state sequences, Fig. 5b shows those cases from the A5 where a breakdown from fluent to synchronized flow was followed by a subsequent transition into congested traffic with very low speeds. The recovery back to fluent traffic did never happened directly. Instead, each recovery process passed through the transient state of synchronized flow.
136 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Fig. 5: Two typical patterns of traffic dynamics during breakdown and recovery (freeway section A5-7, 5-minute flow rates) Empirical analysis of freeway traffic dynamics showed that: Transitions between traffic states usually happen suddenly, i.e. within rather short times and distances. Breakdowns from fluent traffic are first followed by the synchronized traffic state. From there, speed and flow rate may decline further to heavy congestion. All recoveries pass through the synchronized state. No recovery process jumps directly from congestion back to fluent traffic. Recovery from synchronized to fluent traffic always involves much lower volumes than the breakdown. The difference between breakdown volume and recovery volume (fluent traffic after a recovery) on the observed 3-lane freeway sections ranged from 500 to 1500 veh/h. Volumes in the synchronized state are always lower than the maximum flows in fluent traffic (= capacity). Observed differences on 3-lane freeways ranged from 200 to 600 veh/h, measured in 5-minute-intervals. This effect is called "capacity drop" (cf. following section). Because of the large amount of data that was analyzed and because of the remarkable analogy between all cases observed, we may say that these properties are typical for the dynamics of freeway traffic flow. It should, however, be admitted that these dynamic effects are predominantly due to driver behavior, concerning headways at high speeds in dense fluent traffic, together with braking and accelerating behavior. Therefore, different typical dynamics might be found for other driving cultures than in Germany. Even here, under variable speed control, a few traffic breakdowns were observed where the average flow in synchronized traffic was higher than the flow rate before breakdown.
CAPACITY DROP A number of investigations has proven the existence of different capacities under flowing and congested traffic conditions. Banks (1990) as well as Hall and Agyemang-Duah (1991) analyzed this "capacity drop" phenomenon for different North-American freeways. Capacity
Reliability of freeway traffic flow 137 drop values of between 3 and 6 % were measured. Ponzlet (1996) analyzed traffic flow on German freeways to see whether this phenomenon existed. He determined a 6 % drop for 5minute flow rates. Brilon and Zurlinden (2003) analyzed the capacity drop by comparing the stochastic capacity to flow rates in congested flow. They computed an average of 24 %, which is very high compared to other authors' results. There are different hypotheses about the reasons for the capacity drop phenomenon: Bottleneck downstream of the study site: The flow at the point under investigation will remain fluent until the section between this point and the bottleneck is filled with congested flow. After this time, the maximum flow will be the bottleneck's capacity. Different driver behavior: Drivers in fluent traffic accept shorter headways since they expect to be able to pass the vehicles in front. Once they have given up this idea, they switch to a more safety-conscious style of driving and keep longer headways. Restricted acceleration capabilities: At the front of the congested area, drivers need to accelerate. Some vehicles, however, have limited acceleration power, which opens a larger gap in front of them. These hypotheses and the value of the capacity drop were analyzed by Regler (2004) for the 15 freeway sections listed in Table 2, using different approaches. The main question was: What are the capacities under synchronized flow conditions as described in section 4? The conventional traffic flow model of van Aerde (1995) as enhanced by Ponzlet (1996) to account for the capacity drop phenomenon yielded an average drop of 270 veh/h in 5-minute flow rates. Using a distribution of breakdown flow rates (observed immediately prior to breakdown) and a distribution of queue discharge flow, an average drop of 250 veh/h in 5minute flow rates was determined, which is comparable to the result from the fundamental diagram. It is not easy to find a distribution of capacity after a breakdown that is adequate to the Product Limit estimate (Eq. 4). Brilon and Zurlinden (2003) applied a distribution of all flow rates in congested traffic and computed a very high capacity drop. Regler (2004) developed a method comparable to the Product Limit technique to obtain a capacity distribution in queue discharge flow. This method is based on the following assumptions (cf. Fig. 6): Flow rates during congestion do not represent the maximum possible flow of congested traffic. Capacity can directly be measured in queue discharge flow, i.e. in the last 5-minute interval before recovery of traffic flow (uncensored data). Flow rates during congestion are lower than capacity in queue discharge flow (censored data). Flow rates in free flow are not relevant for the capacity of queue discharge flow.
138 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Fig. 6: Flow rate and speed time series during congestion (freeway A5, 5-minute intervals) Based on these considerations, the observed flow rates in each time interval can be classified as follows: B*: Traffic recovers from congestion to free flow, i.e. the average speed exceeds the threshold value from time interval i to interval i + 1 F*: Traffic is congested in intervals i and i + 1, i.e. the average speed is lower than the threshold value in both intervals. This interval i contains a censored value. C*: Traffic is fluent in interval i, i.e. the average speed is above the threshold value. This interval is not relevant. After this classification, a capacity distribution for queue discharge flow according to Eq. 4 (where {B} is to be replaced by {B*}) can be computed from empirical data. This capacity level turned out to be always lower than the capacity before breakdown obtained from Eq. 4. The difference between both distributions (see Fig. 7), represented by the median value, for instance, may be regarded as the capacity drop.
Fig. 7: Capacity distributions for pre-queue (cf. section 2) and queue discharge flow (freeway section A5-7, 11.8 % average truck percentage, 5-minute intervals)
Reliability of freeway traffic flow
139
For the 15 freeway sections listed in Table 2, an average drop of 1,180 veh/h was estimated using this algorithm. It should, however, be mentioned that the results for the capacity drop varied widely between the sites investigated. All attempts to identify regularities within the variation failed. It might be that the capacity drop shows some chaotic properties, as was indicated by other authors (Kerner, 2000) using different methodologies.
TRAFFIC RELIABILITY Traffic reliability is an important factor for the assessment of the performance of highway segments and systems. In this context, the term "reliability" mainly refers to the variability of travel times. However, several definitions can be found in the literature. A comprehensive outline of these definitions is given by Shaw (2003). Here, traffic reliability is assessed by analyzing the probability that a freeway link is not congested, i.e. that the travel time does not exceed an acceptable level. This is becoming a question of increasing importance for "just-in-time" transportation in modern logistics chains. With the stochastic concept of capacity, it is possible to assess this kind of traffic reliability for a freeway link consisting of several sections. The overload probability for a single bottleneck (either distinct or virtual, cf. Fig. 1) is equal to the capacity distribution function Fc(q) given in Eq. 1. The probability of no congestion Pfree(q) represents the complementary event: Pfree (q)
= l-F c (q)
(9)
For the analysis of n subsequent (quasi-) bottleneck sections, the probability of no congestion in the whole system is the product of the single probabilities for each section: Pfree,1+2+...+n(q,,q2v..,qn) = fl[l-F c , i (q i )]
(10)
where qi = demand at section i Fc,i(qO = capacity distribution function of section i By applying the Weibull distribution function to each section, this can be written as:
P & ee,, + 2 + ... + n(q,,q2,-,qn)=e lP ' a *>'
* J = e ""'"
(11)
The overload probability for the whole system, which is equal to the capacity distribution function, is:
140 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
-t—
F c , + 2 + . . . + n ( q 1 , q 2 , . . . , q J = l - e "'P'"
(12)
In the special case of the traffic demand being identical in all sections (qi = q2 = ... = qn = q), the overload probability for the system is:
Fc,1+2+...+n(q) = l - e
«"'
(13)
This is again a Weibull distribution with the scale parameter pi+2+...+„:
Eq. 10 through 14 are based on the assumption that breakdown events due to an overload at the bottleneck sections and thus the capacity distribution functions are statistically independent. This assumption seems to be reasonable if the length of each section is sufficiently large. However, further empirical research may be required to establish the degree to which this assumption is justified. The fact that the volume of traffic arriving at bottleneck section i is influenced by congestion incidents at preceding sections (i - 1, i - 2, ...), e.g. due to the capacity drop, is not relevant because in case of an overload of one section, the whole system is regarded as overloaded according to the applied definition of traffic reliability. For the same reason, the impact of a queue spillback spreading over several sections does not affect the results.
TRAFFIC EFFICIENCY Brilon (2000) has proposed to use the parameter E = q-v-T
(15)
where E q v T
= = = =
traffic efficiency volume travel velocity over an extended section of the freeway duration of the time period for analysis of flow
[veh km/h] [veh/h] [km/h] [h]
as a measure to characterize the efficiency of traffic flow on a freeway. This parameter describes the "production per time unit" of a freeway. The more veh km a freeway produces per hour, the greater the efficiency with which the potential of the existing infrastructure is exploited.
Reliability of freeway traffic flow
141
By applying the concept of random capacities, each volume q has to be combined with the corresponding probability of a breakdown. Brilon and Zurlinden (2003) have derived: Ee Xp (q D ) = [ q D - v - ( l - x ) + q d c - v d c - x ] - T
(16)
where Eexp(qD) = qo = v = q dc =
expected efficiency at a demand volume qo demand traffic volume average velocity in fluent traffic for q = qo queue discharge volume
Vdc T
= queue discharge velocity = duration of the period under investigation
X
=
1
h
[veh km/h] [veh/h] [km/h] [veh/h]
[km/h] [h]
m
(
li-k)-( 1 -Pco I ,g,i-k-l)
H i-l k-0
n m ricong pe(q)
= expected proportion of congested intervals with q = qdc = number of 5-minute intervals during T
[-] [-]
= Minjncong-l;i-1} = average duration (number of intervals) of a congested period >1 = probability of a breakdown at volume q (here: q = qo) (e.g. after Eq. 4: p B = dF c (q)/dq)
[-] [-] [-]
m
Pcong,i =
XPefai-lJ-O-Pcong.i-k-l) k=0
= probability of congested flow in 5-minute interval
[-]
If we insert real data for ps(q) = fc(q) into this set of equations it becomes clear that the maximum expected efficiency is achieved for a demand volume qo that is lower than the average capacity. Sample calculations show that the highest efficiency of a freeway is to be expected at a demand of approximately 0.9 c, where c is the traditionally defined (constantvalue) capacity.
CONCLUSIONS As a result of a series of studies of German freeways, the concept of stochastic capacities seems to be more realistic and more useful than the traditional use of single value capacities. This probabilistic approach provides an improved understanding of both the variability of traffic flow observations and the typical dynamics in different traffic states on a freeway. The idea of random capacity is based on the work of authors like van Toorenburg (1986) and Minderhoud et al. (1997). Compared to their approach, the so-called Product Limit Method for capacity estimation has been modified and extended. It was rather distinctly shown that the capacity of a freeway section is Weibull-distributed. For German freeways, the shape parameter seems to be in a range of 13, whereas the scale parameter can be different for
142 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction specific freeway sections. One drawback of the methodology is that huge sample sizes are needed to estimate capacity distribution functions. With the application of ITS-methods, these data will become increasingly available. The concept of randomness permits to demonstrate the capacity reducing effect of wet road surfaces (-11 %) and the capacity increasing effect of traffic adaptive variable speed limits. The Product Limit Method was also used to estimate queue discharge capacity. It was confirmed that this capacity is usually lower than the capacity in fluent traffic. The studies did clearly show that three typical states in traffic flow exist: fluent traffic, congested traffic, and a transient state that occurs in each breakdown and recovery of traffic flow. The extent of the so-called capacity drop did not show any regularities, although many freeway sections, each with a large sample size, have been analyzed. It is concluded that the capacity drop has rather chaotic properties. The concept of random capacity reveals that the optimum degree of saturation for a freeway, based on data from Germany, ranges around 90 %. If the degree of saturation increases further, the risk of a breakdown becomes too high, so that the efficiency of freeway operation must be expected to be lower than at a saturation of 90 %. The stochastic concept can also be applied to freeways consisting of several succeeding sections. Overall, it is expected that the random interpretation of freeway capacity offers the potential for improved traffic engineering methodologies.
REFERENCES van Aerde, M. (1995). A Single Regime Speed-Flow-Density Relationship for Freeways and Arterials. Proceedings of the 74th TRB Annual Meeting. Washington D.C. Banks, J. H. (1990). Flow Processes at a Freeway Bottleneck. Transportation Research Record No. 1287, Transportation Research Board, National Research Council, Washington D.C. Brilon, W. (2000). Traffic Flow Analysis beyond Traditional Methods. Proceedings of the 4th International Symposium on Highway Capacity, pp. 26-41, TRB Circular E-C018, Transportation Research Board, Washington D.C. Brilon, W. and H. Zurlinden (2003). Ueberlastungswahrscheinlichkeiten und Verkehrsleistung als Bemessungskriterium fuer Strassenverkehrsanlagen (Breakdown Probability and Traffic Efficiency as Design Criteria for Freeways). Forschung Strassenbau und StrassenverkehrstechnikNo. 870. Bonn. Elefteriadou, L., R.P. Roess, and W.R. McShane (1995). Probabilistic Nature of Breakdown at Freeway Merge Junctions. Transportation Research Record 1484, Transportation Research Board, National Research Council, Washington D.C. Hall, F.L. and K. Agyemang-Duah (1991). Freeway Capacity Drop and the Definition of Capacity. Transportation Research Record 1320, Transportation Research Board, National Research Council, Washington D.C. HCM (2000). Highway Capacity Manual. Transportation Research Board, Washington D.C.
Reliability of freeway traffic flow
143
Kaplan, E.L. and P. Meier (1958). Nonparametric estimation from incomplete observations. Journal of the American Statistical Association, 53, 457-481. Keller, H. and T. Sachse (1992). Einfluss des Bezugsintervalls in Fundamentaldiagramrnen auf die zutreffende Beschreibung der Leistungsfaehigkeit von StraBenabschnitten (Influence of Aggregation Intervals in the Fundamental Diagram on the Appropriate Description of Roadway Capacity). Forschung Strassenbau und Strassenverkehrstechnik No. 614. Bonn. Kerner, B. S. (2000). Theory of Breakdown Phenomenon at Highway Bottlenecks. Transportation Research Record No. 1710, pp. 136-144. Transportation Research Board, National Research Council, Washington D.C. Kerner, B. S. and H. Rehborn (1996). Experimental Properties of Complexity in Traffic Flow. Physical Review E, 53 (5), 4275-4278. Kim, Y. and H. Keller (2001): Zur Dynamik zwischen Verkehrszustanden im Fundamentaldiagramm (Dynamics between Traffic States in the Fundamental Diagram). Strassenverkehrstechnik, Issue 9/2001, pp. 433-442. Kuehne, R.D. and N. Anstett (1999). Stochastic Methods for Analysis of Traffic Pattern Formation. Proceedings of the 14' International Symposium on Transportation and Traffic Theory. Jerusalem. Lawless, J.F. (2003). Statistical Models and Methods for Lifetime Data. Wiley, New York. Lorenz, M. and L. Elefteriadou (2000). A Probabilistic Approach to Defining Freeway Capacity and Breakdown. Proceedings of the 4th International Symposium on Highway Capacity, pp. 84-95. TRB-Circular E-C018, Transportation Research Board, Washington D.C. Minderhoud, M.M., H. Botma and P.H.L. Bovy (1997). Roadway Capacity Estimation Methods Explained and Assessed. Transportation Research Record No. 1572. Transportation Research Board, National Research Council, Washington D.C. Okamura, H., S. Watanabe and T. Watanabe (2000). An Empirical Study on the Capacity of Bottlenecks on the Basic Suburban Expressway Sections in Japan. Proc. of the 4th International Symposium on Highway Capacity, pp. 120-129. TRB Circular E-C018, Transportation Research Board, Washington D.C. Persaud, B., S. Yagar and R. Brownlee (1998). Exploration of the Breakdown Phenomenon in Freeway Traffic. Transportation Research Record No. 1634, pp. 64-69. Transportation Research Board, National Research Council, Washington D.C. Ponzlet, M. (1996). Dynamik der Leistungsfahigkeiten von Autobahnen (Dynamics of Freeway Capacity). Schriftenreihe des Lehrstuhls fuer Verkehrswesen der RuhrUniversitaet Bochum, No. 16. Bochum. Regler, M. (2004). Verkehrsablauf und Kapazitat auf Autobahnen (Freeway Traffic Flow and Capacity). Schriftenreihe des Lehrstuhls fuer Verkehrswesen der Ruhr-Universitaet Bochum, No. 28. Bochum. Shaw, T. (2003). Performance Measures of Operational Effectiveness for Highway Segments and Systems. NCHRP Synthesis 311, Transportation Research Board, Washington, D.C. van Toorenburg, J. (1986). Praktijwaarden voor de capaciteit. Rijkswaterstaat dienst Verkeerskunde, Rotterdam.
144 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Treiterer, J. and J.A. Myers, (1974). The Hysteresis Phenomenon in Traffic Flow. Proceedings of the 6' International Symposium on Transportation and Traffic Theory, pp. 13-38. Reed Pty Ltd., Sydney.
8
A CRITICAL COMPARISON OF THE KINEMATIC-WAVE MODEL WITH OBSERVATIONAL DATA Kai Nagel, Inst. For Land and Sea Transport Systems, Technical University of Berlin, Berlin, Germany; and Paul Nelson, Dept of Computer Science, Texas A&M University, College Station, Texas, USA
INTRODUCTION The objectives of this work are to: critically summarize the predictive capabilities and predictions of the classical kinematic-wave model (KWM) of Lighthill and Whitham (1955) and Richards (1956), where by "classical" is intended the case of a strictly concave fundamental diagram; critically summarize the extant data that are and are not reproduced by those predictions, especially with a view toward identifying the disagreements between observations and the classical KWM that seem most firmly established. Whether an allegedly observed phenomenon is "firmly established" is subjective. An element is reproduction by multiple independent observers; however, that is not sufficient, because it is possible for multiple observers to build upon the same mistaken assumption or technique. It is therefore possible for two reasonable people to disagree as to whether existence of an alleged phenomenon has been firmly established; indeed the two authors do not completely agree in all instances. Our approach in cases where either of us has doubts is simply to summarize, as objectively as we can manage, both sides of the issue. There also arise issues of interpretation of the predictive variables internal to a theory. This is especially relevant to continuum models, of which the KWM is an instance, because these models have continuous functions (e.g., mean speed) as their predictive variables, whereas any particular instance of traffic flow consists of discrete vehicles in motion. Tying theoretical continuum results to predictions is particularly difficult because much of the available data
146
Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
is obtained by aggregating over time at sparsely spaced detectors near ramps, yet there seems to be few studies of the effect of aggregation interval, detector spacing or detector location. The contents of this work are as follows. In the following section we summarize the predictions of the classical KWM, and associated issues, especially those involving computational employment of the KWM. The next section summarizes instances of agreement of the KWM with observations (qualitative features, cumulative flows), and provides a critique of such observations, including especially identification of areas where further observational studies seem warranted. The following section is devoted to a critical discussion of alleged observations that apparently disagree with the classical KWM. The specific alleged discrepancies discussed there include unstable flow and related phenomena (spontaneous breakdown, the two-capacity phenomenon), what we term empirical jammed flow (particularly "wide jams"), and internal structure in congested flow. Our final section contains conclusions and recommendations for further related work.
THE CLASSICAL KWM The classical KWM for traffic consists of the equation of continuity, d,p(x,t) + dxq{x,t) = 0, plus the assumption that flow (q=q(x,t)) can be written as a function (FD) of density (p=p(x,t)) and possibly explicitly of longitudinal position (x) and time (i), say q(x,t) = Q{p(x,t\x,t). Here Q is strictly concave in p, i.e. Q"<0, and vanishes at p=0 and at some jam density p=pjlm (see Fig. 1). If the FD is spatially homogeneous (independent of x), then density is a solution of the nonlinear first-order conservation law d,p(x,t) + dpQ(p,t)dxp(x,t) = O.
(1)
The FD commonly is assumed to be piecewise constant in x, so that Eq. (1) holds except at points of discontinuity. (See the final paragraph of this section for further brief discussion of the effect of such points.) The FD further is commonly assumed stationary (i.e., not to depend explicitly upon time), although nonstationary effects could be included (e.g., sudden changes in weather). In the homogeneous stationary case Eq. (1) implies the density is constant along the "characteristic curves" in the (AxJ-plane that are defined by the ordinary differential equations ^ = c(x,t)~dpQ(p(xM
(2)
These curves are lines in the (t,x)-p\ane, with slope equal to the (constant) wave velocity c=c(p) along that line. Momentarily consider an infinitely long roadway, with initial data given at t=0, say p(x,0)= Po(x). If through (t,x), with t>0, there passed exactly one characteristic intersecting the x-axis (i.e., t=0), then the density at that point would be uniquely determined as that initially specified at that point of intersection with the initial line. There exist situations in which this stipulation holds, but there are two ways it can fail.
Critical comparison of the kinematic-wave model with observational data 147
Figure 1 - A strictly concave FD, as typically conceptualized in regard to the KWM. First suppose density is initially increasing as one moves downstream, at the initial time (e.g., near the end of a rush period). Because of the strict concavity the wave speed is (algebraically) decreasing along that interval, and therefore any two characteristics through distinct points along this roadway will eventually intersect. At such a point the "constant density along characteristics" specification of the preceding paragraph therefore fails to specify a unique value of the density. This ambiguity is traditionally resolved via a shock wave, that is a curve x=xs(t) in the (t,x)plane that is the locus of the initial points of intersection of characteristics, and along which the density (and hence flow) are permitted to be discontinuous. The shock condition dx, = Aq =Q(pu(t))-Q(pd(t)) „. dt
Ap'
pu(t)~PA')
then follows from conservation of vehicles. Here pu(t)=p(xs(t)-,t) (pd(t)=p(xs(t)+,t)) is the density immediately upstream (downstream) of the shock wave at time t. If one applies the "constant density along characteristics" specification only so long as the characteristic does not cross a shock, then the solution again is uniquely specified everywhere. In particular, Eq. (3) is an ordinary differential equation that determines the trajectory of the shock wave. In case the initial density decreases as one moves downstream no corresponding difficulty arises; the characteristics diverge ("fan out") with increasing time, but one and only one characteristic passes through each point (t,x), t>0. However, in the limiting case of a jump discontinuity in the initial density at some xo, with the downstream density smaller (e.g., at a traffic signal that has just turned green), there are points (t,x), t>0, through which no characteristic passes. In this case one mathematical (weak) solution is a shock, with densities downstream (upstream), up to the downstream (upstream) characteristic passing through (t,x)=(O,xo), equal to p(xg+,0) {p(xo-,O)), and trajectory otherwise determined by Eq. (3), just as in the preceding paragraph. However a second solution that fills the gap between the up-
148 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction stream characteristic through (t,x)=(0, xo) and the downstream characteristic through the same point is given by the similarity solution
p( x , 0 = c -^£zfij,
(4)
where c1 is the functional inverse of the wave velocity, which exists because of the strict concavity of Q. In case of such initial discontinuities one can create infinitely many (weak) solutions by piecing together segments of this similarity solution with pieces of the preceding shock solution. It is generally deemed that the similarity solution is that best representing the true state of traffic. The simplest mathematical argument supporting that choice is "stability": if one considers a sequence of initial densities having linear segments about x=xo that converge to the discontinuous initial density, and otherwise are equal to that initial density, then the corresponding (now uniquely determined, as previously) solutions resemble and converge to the similarity solution. That is, the similarity solution is self-healing, in that small perturbations from it return to it, whereas (in the present case) small perturbations of the shock solutions diverge from that shock solution. The simplest argument supporting the choice of similarity and involving driver behavior is that any shock segment represents some drivers traveling more slowly than they safely could, according to the prevailing FD. The choice of the similarity solution also relates mathematically to the so-called "entropy condition," which in turn also has ties to driver behavior. In its application to the classical KWM the entropy condition essentially asserts (Ansorge, 1990) that drivers accelerate as soon as safely possible and wait as long as safely possible to decelerate, where safety is denominated by adherence to the given FD. But the entropy condition is relevant mostly because it can be given a quantitative formulation (e.g., Leveque, 1992) that can be applied to computational approximations. This is extremely important, because early within the computational development of traffic flow theory some investigators mistakenly concluded that the classical KWM was fundamentally flawed because they inappropriately employed simple and reasonable computational approximations that failed to satisfy the entropy condition. The corresponding computational approximations, for an initial discontinuity as above, then converged with mesh refinement to the often clearly incorrect unstable shock solution, rather than to the stable similarity solution; cf. Ross (1988), Newell (1989), and Ross (1989). This mistaken conclusion seems to have provided much of the impetus for development of so-called higher-order methods (Payne, 1971). Some of these have recently been shown (Aw and Rascle, 2000) to be seriously flawed, in that they can develop negative (i.e., upstream!) flows, even though all flows are initially downstream (and all initial densities nonnegative and less than jam density). The STRADA code (Buisson, 1997), which has been widely applied in France, is based on a computational solution of classical KWMs via the Godunov method (Lebacque, 1996), which has a discretization error that is first order in both space and time. Computational methods having higher-order computational approximations exist (Bale et al, (2002), but seem not to have been explored in traffic flow, perhaps because lower-order methods have some advantages for the real-time demands of traffic control. It is necessary, for any computational implementation, to consider a system of some finite length, and therefore to incorporate appropriate boundary conditions. See Lebacque (to appear) for a discussion of boundary conditions, and Nelson and Kumar (2004) for the extension of these to interfaces (jump disconti-
Critical comparison of the kinematic-wave model with observational data 149 nuities of the FD in x) and point constrictions (removable singularities, in x, of the FD). In these cases consideration of only the similarity solution, for downward initial jumps in density as one moves downstream, is again conventionally adopted to obtain uniqueness.
EMPIRICAL AGREEMENT WITH THE CLASSICAL KWM In this section we review empirical results that appear to reflect agreement between observations and predictions from the classical KWM. The next section is devoted to a discussion of empirical observations that are often considered to reflect disagreement between observational data and the KWM. In many instances there are widely held but contrary opinions regarding these matters, for reasons discussed in the Introduction. The classification of a particular allegedly observed phenomenon as reflecting agreement or disagreement with the KWM is therefore somewhat arbitrary. Qualitative consistency between observations and the predictions of the KWM, particularly the shock waves and acceleration waves delineated in the preceding section, comprise perhaps the most widely accepted type of agreement. This is not easily or widely documented, perhaps because it is so widely accepted. For example, much of the technology underlying the Highway Capacity Manual, which is a semi-official U.S. standard for the analysis and design of roadway facilities, is based on supply-demand analysis, which is the steady-state version of the KWM. The situation is also complicated because many empirical studies that might provide verification have been reported in the literature related to a particular type of facility (e.g., freeway or signalized intersection), as opposed to the traffic modeling literature, and therefore not necessarily considered in light of consistency between data and the KWM. Shock waves Shock waves have been primarily observed in the context of freeway bottlenecks, which is to say freeway sections at which the capacity (maximum) flow in the FD of Fig. 1 is lower than immediately upstream. This is presumably because (inductive-loop) data from such locations are widely available, and because an understanding of the manner in which congestion at such locations forms and behaves is considered important to mitigation of the undesirable increase in travel times associated with congestion. According to the classical KWM, whenever the demand (flow) just upstream of the bottleneck entrance exceeds the capacity of the bottleneck, a shock wave will form at the entrance to the bottleneck and propagate upstream, leaving behind (i.e., bounded upstream by the moving shock discontinuity and downstream by the fixed bottleneck entrance) a "queue" of vehicles in which flow is equal to bottleneck capacity. However, in that queue the density will be the higher of the two densities corresponding to that flow on the FD, and therefore mean vehicle speed (= flow divided by density) will be (typically much) lower than that either upstream of the shock wave or downstream of the bottleneck entrance. The speed of the shock should be predictable from the shock condition (3). Agreements between these KWM predictions and observations have been documented, perhaps most notably in a series of data-oriented papers (Cassidy and Mauch, 2001; Windover and Cassidy, 2001) and companion modeling-oriented work (Newell, 2002) emanating from the transportation group at the University of California at Berkeley; see also Banks (1999).
150 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction This collective body of work even argues that a "zeroth order" (Newell, 2002) theory of highway traffic, which relies on an entirely triangular FD, is still able to predict accurately the most important effects of highway traffic, especially cumulative flows. Note however that cumulative flows are integral quantities, in the sense that at any location x they are the time integral of the differential flow q(x,t). Integral quantities are inherently easier to both measure and predict than the corresponding differential quantity; e.g., it appears that numerical differentiation, with the associated inherent loss of accuracy, will be required in order to obtain speeds and hence travel times from cumulative flows. The KWM characterization of a deceleration region as a "shock wave" of zero thickness is an idealization; nonetheless the actual structure of such transition zones upstream of queues has only recently been investigated empirically, by Mufioz and Daganzo (2003). These investigators describe detailed instances of shocks that are about 1 km wide, corresponding to a relatively gradual deceleration of about 1/3 m/sec2. This imposes some spatial (and presumably temporal) limitation on the scale of validity of the KWM, but these researchers further argue that even with such a wide shock the KWM can predict many relevant quantities quite accurately. As an example they cite vehicle positions to within 160 m, or about five vehicle spacings; however this bears further elaboration, because neither the KWM nor any other continuum model predicts vehicle spacing per se. Acceleration waves The focus in validation of the KWM has tended toward shock waves, perhaps because of the ready availability of data from "point" (e.g., inductive-loop) detectors on freeways, and the practical interest in congestion on freeways. There seems to be little observational data exemplifying the companion KWM prediction of acceleration waves. This is presumably because freeway detectors tend to be located upstream of potential bottlenecks, and therefore not in position to acquire data representative of the "queue discharge" that is the manifestation of acceleration waves downstream of a bottleneck. On the other hand, acceleration waves are extremely important to the behavior of traffic at signalized intersections; we believe the literature related to such intersections is an important source of potential data relative to validation of the KWM that has been too much neglected. A full realization of the potential use of such data would require spatially extensive measurements of flow during a green cycle, both upstream and downstream of the signal. With more widespread use of camera-controlled signals, such data seem destined to become more widely available. Even now some data are available, in the form of measurements of the "saturation flow" at a signal during the green phase; this parameter is extremely important to the performance of signalized intersections, and has been extensively discussed in the literature on signalized intersections. The prediction of the KWM is that (unopposed) queue discharges at such an intersection will be equal to the minimum of the capacity (maximum) flows immediately upstream of the intersection, at the intersection itself, or immediately downstream of the intersection, but in any event that it will remain constant during the green phase of the signal. In regard to this prediction, Lin, Tseng and Su (2004) state that "actual queue discharge patterns, however, often do not display an identifiable steady maximum rate." On the other hand, the variations in observed flow at the intersection that are reported by these investigators are only of the order of 10-15% (see also Bonneson, 1991). Thus here the KWM seems
Critical comparison of the kinematic-wave model with observational data 151 to be categorically neither a success nor a failure, but rather the appropriate view is dependent upon the level of accuracy required. Lebacque (2002) has considered replacing the entropy condition for the KWM by a "bounded acceleration" condition, because of doubts about accuracy of the entropy solutions for modeling ramp metering. It should be noted that a KWM with a strictly concave FD does not predict a constant flow rate out of the traffic light, except exactly at the position of the light. Boundary-induced breakdown The preceding section mentions the FD as a hypothetical representation of flow as a function of density. Let us call the FD so related to the KWM theory KWM-FD. One can also measure flows and densities in the field, leading to an empirical FD. Classically such observations lead to empirical FDs that resemble the KWM-FD well in the lower-density free-flow regime, but at higher densities display a tail extrapolating the free-flow data lying above a "cloud" of widely scattered data points (Drake, Schofer and May, 1967, Koshi, Iwasaki and Ohkura, 1981; Kerner, 2002, esp. Figs. 14 and 16); cf. Fig. 2 for a typical instance of such an "inverted-lambda" empirical FD. Often it is better to plot density p, flow q and velocity v as functions of time, as in Fig. 3. These time-series data tend to show that a typical transition is from the free-flow regime to a regime where flow is only somewhat diminished but densities are much higher, meaning much lower velocities (Mika, Keer and Yuan, 1969; Kerner and Rehborn, 1996a; Kerner, 1998, 1999a); such a transition often is termed "breakdown."
figure z - empirical iunaameniai diagram, as recoraea on me uerman ireeway A m. uensny (on the x axis) is given in veh/(km lane), flow (on the y axis) is given in veh/(hour lane). Source: Nagel, Wagner, and Woesler, 2003. Daganzo, Cassidy and Bertini (1999) note that a bottleneck downstream of a measurement location can easily generate such a plot, in the following way: The system starts with low flow at low densities. Both flow and density keep increasing, along the "free flow" branch of the fundamental diagram.
152 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction This flow can be larger than can flow through the bottleneck. A queue thus begins to form upstream of the bottleneck, but that does not immediately influence the measurement. Eventually, the queue will reach the measurement location. At that point in time, data points will move to a much higher density, while the flow value will now drop to bottleneck capacity. This is exactly what the KWM predicts, in that there is a transition from free flow to congested flow that accompanies a shock wave propagating upstream. Thus this must be marked as a success of the classical KWM. Unfortunately, there are too many flow-density data in the literature where the associated geometrical constraints are not well enough documented. Such data are relatively useless for many of the points raised in the current scientific discussion. At the same time alternative descriptions, such as that involving three phases, free flow, congested or synchronized and jammed "synchronized flow," do not yet seem to have evolved to the point that they can provide quantitative predictions even capable of being tested. (But see Schonhof and Helbing, submitted, and also Kerner, 2004.) This KWM interpretation of empirical observations of breakdown has recently (Cassidy, 1998) given rise to questions regarding the data analysis techniques traditionally employed for empirical FDs. Specifically, the empirical FD is obtained from averaging, for example over fixed time intervals. If one assumes that the KWM describes traffic, then these averages can extend over several regimes. This means that linear combinations of points on the KWM-FD can become points of the empirical FD. For a concave KWM-FD this means that points within the KWM-FD can become an empirical data point.
Figure 3 - Time series of the three fundamental variables of traffic flow. Flow and velocity are averaged; density is computed as *, where > denotes the mean. The data have been recorded on the German freeway Al near an intersection with German freeway A59. Time is counted from 6/Jun/1996 midnight. Source: Nagel, Wagner, and Woesler, 2003.
Critical comparison of the kinematic-wave model with observational data 153 Cassidy and Bertini (1999) pursue this line of reasoning in some detail. They also describe how averages can be restricted to time intervals of (nearly) stationary traffic, ensuring that the empirical data points lie on a possibly existing KWM-FD as much as possible. Unfortunately, these results are not conclusive as regards the possibility of obtaining a KWM-FD via filtering empirical data for stationarity, because data so filtered are sparse both near capacity flow and in the congested flow regime. On the other hand, such sparsity is exactly what would be predicted by the KWM, in the region upstream of a bottleneck, which is where data customarily are taken (and indeed where the KWM predicts data must be taken, in order to observe any congested data). That is, the KWM predicts that once flow at an observation point upstream of a bottleneck exceeds the capacity of that bottleneck, it will do so for only a limited time, after which the queue formed at the bottleneck will spill back to the observation point and flow at that point subsequently will be equal to the bottleneck capacity (i.e., will correspond to a single density-flow point). Indeed, the chief inconsistency between the filtered nearstationary data and the KWM seems to be the existence of multiple data points in the congested regime (cf. Fig. 11 of Cassidy and Bertini, 1999). We believe much remains to be done in the area of data analysis related to empirical FDs.
EMPIRICAL DISAGREEMENT WITH THE CLASSICAL KWM In this section we review empirical results that seem to reflect disagreement between observations and predictions from the classical KWM. As before the difference between "agreement" and "disagreement" is considerably subjective. Further, the disposition toward perceiving consistency or inconsistency between the KWM and a particular set of observations often is reflective of familiarity with the KWM or some alternative theory. We make an effort to factor out such inherent bias, but perfection in that regard is elusive. Unstable flow, spontaneous breakdown and the two-capacity phenomenon In the preceding section we have already offered one hypothesis that might somewhat reconcile data such as Fig. 2 with the KWM-FD, but if one takes such data at face value - as has been done through much of the history of traffic flow theory - then it seems doubtful they can be represented adequately by any single continuous function. This observation is classical in traffic flow theory, and is behind (e.g.) the well-known "two-regime" theory (Ceder, 1967). The interpretation of this "scatter" regime is controversial, and even the terms one chooses to employ in referring to it can evoke bias toward one or another interpretation, and perhaps associated theory. In an effort to avoid such bias, we employ the following terminology: By empirically congested flow we shall intend any data clearly not falling within the free flow regime, as defined above. By empirically uncorrelatedflow we intend any data set within which there is considerable scatter in the density-flow plane, as illustrated in Figure 2. (Thus empirically uncorrelated flow is a subclass of empirical congested flow.)
154 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction By empirically jammed flow we shall intend yet another subclass of empirically congested flow that has been hypothesized by some investigators, as discussed in more detail in the following subsection. The word "empirical" and its derivatives will be omitted when the context permits. The traditional acceptance of these density-flow measurements in the (empirically) congested regime raises doubts regarding the validity of the KWM. This alone has been persuasive to many, and has fueled both substantial skepticism directed toward the KWM, and a search for alternative data interpretations and associated explanatory theories. On the other hand, the successes of the KWM discussed in the preceding section have made others considerably reluctant to accept any suggestion that this theory has no validity at higher densities. In the preceding section we have already indicated a recently suggested possibility for reconciling kinematic-wave theory with empirically uncorrelated flow. The fundamental hypothesis underlying that possibility is that breakdown is exclusively what nonlinear dynamicists would term a "boundary-driven phenomenon," which is to say that it derives from shocks propagating upstream from a bottleneck, as summarized from Daganzo, Cassidy and Bertini (1999) in the preceding section. In our opinion such bottleneck-driven breakdowns certainly occur, and empirical reports should include sufficient information to permit determination of the extent to which boundary effects contribute to data reflecting breakdown. This is a nontrivial challenge, because it requires spatially distributed data, or at least a very careful description of the roadway downstream of the point of observation. An extreme version of this suggestion is that empirical results should not be published at all, unless the data on which they are based are made publicly available, so that alternative hypotheses can also be tested against those data. Nonetheless, when one takes into account the possibility of bottleneck-driven breakdown, there remain observed phenomena that are difficult to explain absent spontaneous ("emergent") breakdown. The objective of this subsection is to summarize the observational data supporting such spontaneous breakdown. More generally, bottleneck-driven breakdown is an instance of boundary-driven phenomenon, which in turn is instance of an "external" phenomenon that stems from circumstances outside the system being modeled, while spontaneous breakdown is conceived as an emergent phenomenon that arises from phenomena internal to the system being modeled. However, to a very large extent this distinction is subjective, in that it depends upon what one is willing to assume is known a priori (i.e., an external variable), as opposed to being a quantity that the model is required to predict (i.e., an internal variable). As a very concrete instance of this dichotomy, the presence of a slow truck in the right lane certainly can be a significant factor in determining traffic flow. But should this presence be regarded as an external factor, and therefore known a priori, or as a stochastic fluctuation whose potential existence must be represented among the statistical distribution giving rise to the mean values that a continuum model should provide? There exist circumstances under which either of these views is reasonable, depending upon the purpose of the model, and therefore what one is willing to assume is known a priori. For example, if the objective of the model is to better understand the effect of a slow truck (e.g.,
Critical comparison of the kinematic-wave model with observational data 155 Daganzo and Laval, 2005), then it is perfectly appropriate to take the presence (and characteristics) of such a truck as a known external variable. However, if the purpose is to predict mean traffic behavior where it cannot be (continuously) measured then the presence or absence, characteristics, and effect of such a truck must be regarded as a stochastic internal variable to be appropriately reflected in the model predictions. The simplest way to determine internal effects for a model of traffic flow is to implement it on a homogeneous closed loop, which completely eliminates external (boundary) effects. Such "ring roads" are rare in practice, but Sugiyama et al. (to appear) recently reported a relevant experiment conducted on a test circuit. Briefly, they experimentally show that under appropriate circumstances, spatially homogeneous flow is unstable for sufficiently high densities, but rather tends "spontaneously" to transition, after several minutes, to "jammed flow." In this context the characteristic of jammed flow is a single jam, propagating opposite to the direction of traffic flow, within which vehicles come to a stop, or very nearly so. Quantitative details of the observed speed-headway distribution over the entire jam flow are not reported, but supporting simulations suggest they comprise a characteristic ("universal") limit cycle ("hysteresis loop"). This result suggests that spontaneous breakdown can occur in traffic flow. However, in itself it signifies neither failure of the KWM nor nonexistence of a KWM-FD, in the sense that flows and densities averaged over the characteristic limit cycles could still comprise a perfectly well defined function in the density-flow plane. This possibility is illustrated by the cellular automata model CA-184a of Nelson (submitted), which produces results similar to the empirical FD of Fig. 2, in simulations of traffic stream observations upstream of a bottleneck, but that on a ring road fall exactly on a well-defined KWM-FD in the density-flow plane, with multiple underlying limit cycles. However, at a minimum the results of Sugiyama et al. (to appear) suggest existence of a lower limit on the spatial and temporal scales for validity of the KWM; existence of some such scale limitations is to be expected for any continuum model; cf. Lesort et al. (to appear) for further discussion of scale issues in traffic flow. In addition, Jost and Nagel (2003) argue that if the spontaneous breakdown is related to a true (thermodynamical) phase transition, then the jam features will coarsen until they are visible on all spatial scales, even the largest. The mechanism for coarsening is that jams coagulate until there is eventually only one large jam left in the system. However, they cannot answer if their modeling results apply to real-world traffic or not. Observations of what we term as "two-capacity flow" have been persistently reported in the literature. This phenomenon is relevant here because it also is strongly suggestive of spontaneous breakdown, and is inconsistent with the classical KWM. Here by two-capacity flow we mean observations and related analyses that suggest bottlenecks can operate at two distinct maximum flows, typically a higher value prior to and early in the formation of a queue upstream of the bottleneck and a somewhat lower value subsequent to development of such a queue. This contradicts the classical KWM, because the (entropy solution of the) latter predicts flow at an enqueued bottleneck will be a constant, specifically the capacity in the bottleneck (Nelson and Kumar, 2004). Observations of two-capacity flow have been reported, among others, by Edie and Foote (1960), by Agyemang-Duah and Hall (1991) and by Cassidy and Bertini (1999), while other
156 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction studies (e.g., Persaud and Hurdle, 1991) have reported lack of conclusive evidence supporting a reduction in flow coincident with formation of a queue. From an empirical perspective, Banks (1991; cf. also Banks, 1990 and Banks, 1991a) indicates that "the hypothesis that flow decreases when it breaks down is confirmed, provided the hypothesis applies to individual lanes," but "when averaged across all lanes there was no significant change," and concludes that alleged two-capacity flow "is unlikely to provide a basis for metering." Note that if one fully subscribes to the KWM, then there is no rational basis for ramp metering, absent some societal decision to favor mainline traffic over that entering freeways. When differences between the levels of flow at a bottleneck, before and after queue formation, are reported, their magnitude tends to be only about 5-10%. Given that relatively small alleged difference, it is difficult to know whether the different conclusions reached in different studies are attributable to differences in methodologies for obtaining and analyzing data, or to actual differences in traffic behavior at distinct sites, or possibly some combination of these factors. This inherent difficulty in determining existence of the two-capacity phenomenon has been discussed by Persaud and Hurdle (1991). Nonetheless one can question whether we have yet advanced significantly beyond the status observed by Wattleworth (1963): "The question of whether or not the flow downstream of a freeway bottleneck decreases when congestion sets in is currently the subject of much discussion in engineering circles. Research findings support both the yes and no answers to this question. Several studies ... suggested that perhaps the question did not have a simple yes or no answer." Yet, on balance we tend to agree with Cassidy and Bertini (1999) that "the average rate vehicles discharge from a queue can be ... lower than the flow measured prior to the queue's formation." See Elefteriadou, Roess and McShane (1994), and Lorenz and Elefteriadou (2001) for a suggestion that the time of occurrence of this type of breakdown can usefully be viewed as stochastic in nature.
Empirically jammed flow Some researchers perceive an additional subclass of empirically congested flow, which is the empirically jammed flow already mentioned above. The characteristic signature of empirically jammed flow is so-called "wide jams," which are described by Knospe et al. (2002) as follows: "Wide (moving) jams are regions with a very high density and negligible average velocity and flow. The width of these structures is much larger than its fronts at the upstream and downstream ends where the speed of the vehicle changes sharply. Wide jams can propagate undisturbed through either free flow or synchronized traffic without impact on these states, which thus allows their co-existence." (See the following subsection for more on "synchronized flow.") The predominant evidence for wide jams is time-series data such as that shown in Fig. 23 of Knospe et al. (2002); i.e., data from a stationary (loop) detector that show at early times relatively large flows and speeds with small densities, followed by an intermediate period of small flows and speeds and high densities, finally followed by yet a third time period qualitatively resembling the first. The hypothesis commonly invoked is that such data represent a structure ("wide jam") traveling upstream, within which vehicles are closely spaced, and in which both upstream and downstream fronts remain sharply defined as the structure propagates. If this interpretation is correct, then it provides a challenge to the classical KWM, because (see the section entitled "The Classical KWM") that model predicts that an initially
Critical comparison of the kinematic-wave model with observational data 157 sharp front between a high-density upstream region and a low-density downstream region (such as the downstream front of the hypothesized wide jam) will dissipate (spread) into an acceleration fan (similarity solution). However, absent additional data from other spatial points there is an interpretation of these data that reflects a boundary-driven phenomenon, and is consistent with the classical KWM. What is required is the sequence of events suggested in the preceding section as providing an explanation of Fig. 3 consistent with the KWM, followed by a decrease of upstream demand to a value again below bottleneck capacity. The KWM then predicts a sequence of events as already described, until the upstream demand falls below the bottleneck capacity. Once that decreased demand reaches the tail of the queue the tail will remain a shock wave, and thus be a stable structure within the confines of the classical KWM, but now it will propagate downstream. It will eventually reach the detector, where it will be registered as a sharp transition from a high-density low-flow/speed regime to low-density high-flow/speed. As seen at the hypothesized single detector the traffic pattern will thus be exactly the observed signature of an alleged wide jam, as described in the preceding paragraph. Thus the question of whether the data supporting existence of wide jams is consistent with the classical KWM comes down to the whether the second observed sharp front is moving upstream or downstream. This seems to require data from more than one spatial location. At this time the totality of the data of the type described above that has been reported in the literature in support of the wide-jam hypothesis seems to be Kerner and Rehborn (1996a, 1996b), Knospe et al. (2002) and Schonhof and Helbing (submitted). Of these three works, only in Figures 3(a)-(c) of Kerner and Rehbom (1996a) and Figure 2 of Kerner and Rehborn (1996b) does one find explicit measurements from detectors at distinct positions along the roadway. These data definitely support existence of wide jams. It would be desirable if they were replicated by other investigators. Nonetheless, in the following sections we conditionally accept the hypothesis of existence of wide jams, and hence empirically jammed flow, and explore the potential for various models to reproduce that phenomenon. Some empirically properties of wide jams that have been reported (Kerner and Rehborn, 1996a, 1997) include the following: 1. Traffic jams, once created, are fairly stable and can move without major changes in their form for several hours against the flow of traffic. 2. The flow out of a jam is a stable, reproducible quantity, and can be up to 50% smaller than the maximal flow at the same location. Further internal structure in empirically uncorrelated flow The "wide jams" characteristic of the empirically jammed flow discussed in the preceding subsection constitute one instance of internal structure in empirically uncongested flow. However, other types of internal structure have been reported. In fact, "stop-and-go" flow under congested conditions is anecdotally familiar to virtually all drivers. Notwithstanding that this phenomenon was initially studied scientifically nearly forty years past (Edie and Baverez, 1967), there remains a paucity of related quantitatively reliable scientific data. (But
158 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction see Schonhof and Helbing, submitted, for study of start-stop waves via a novel filtering technique applied to data from multiple dual-loop detectors.) This may be because such data require short-term and short-distance temporally and spatially distributed data, which necessarily will be subject to a high degree of stochastic uncertainty (stemming from, e.g., variations between individual drivers). Nonetheless there are persistent reports of "something else" (e.g., Kerner, Klenov and Wolf, 2002), and there is considerable discussion (Daganzo, Cassidy and Bertini, 1999) as to whether these observations are or are not entirely explainable by KWM theory. This subsection is devoted to a brief review of these issues. Much of the discussion focuses on what Kerner and collaborators (Kerner and Rehborn, 1996b, 1997) term as "synchronized flow." One of the barriers to an objective discussion of synchronized flow is the lack of consensus as to its characteristic signature(s). An approximately common (i.e., "synchronized") speed across multiple lanes, and the existence of embedded very narrow (compared to the wide jams of the preceding subsection) jams are two signatures that have been mentioned by investigators who have considered the matter. Yet another barrier is lack of public availability of much of the data on which many of the alleged observations of synchronized flow are based, and the consequent inability of the community at large to reproduce the underlying data analysis, or suggest alternate analyses. Even among those who are disposed favorably toward existence of synchronized flow there is not agreement on the question of whether the associated strong scatter of the data has a dynamical origin, for example stemming from an on-ramp, or a statistical origin, such as being caused by a mixture of cars and trucks that display different driving characteristics. Sugiyama et al. (to appear) provide simulation results, based on the optimal-velocity model (Bando et al., 1995) that suggest a hypothesis regarding possible internal structure of congested flow. Briefly, their simulations reveal the following structure upstream of a bottleneck: immediately upstream a region of "laminar flow," within which vehicles are spaced rather regularly, followed by a region within which the flow consists of very narrow "jams," finally followed by a region even further downstream within which wide jams appear. These researchers hypothesize the laminar region is an inherently metastable region, the region of wide jams is inherently stable, and the region of narrow jams is a connecting unstable region (as dictated by Hopf bifurcation) that is somehow stabilized by presence of the bottleneck. Note that the latter interpretation also is consistent with considerable difficulty in observing the narrow jams, which in turn would be somewhat consistent with difficulties in observing synchronized flow, if one hypothesized an identification between synchronized flow and narrow jams, as do Sugiyama and Nakayama (2003). The above description, in particular that narrow jams coagulate to form wide jams, is also consistent with work by Jost and Nagel (2003). Jost and Nagel do not investigate bottlenecks, but rather use a closed homogeneous system, i.e. a homogeneous loop. Once of their initial conditions is a completely homogeneous distribution of cars, i.e. all vehicles with the same space headway, as given by the density. Also in that system, one obtains, for certain densities, initially "laminar flow,", then "narrow jams," and then wide jams. As pointed out earlier, the wide jams will further coagulate until there is only one jam left in the system, and that statement holds for arbitrarily large systems. Further, unpublished simulations of our own show that the same code, after the introduction of a bottleneck, displays the same behavior as the model of Sugiyama et al. (to appear). An interpretation is that, either by a bottleneck or by having a closed system, traffic can be "pinched" at a certain (average) density, at which the
Critical comparison of the kinematic-wave model with observational data 159 system displays the above-described behavior. However, even here it must be said that there are very few empirical observations that include the spatial picture, and at least one of them (Windover and Cassidy, 2001) displays little or no coarsening with increasing distance from the bottleneck. The principal point of interest here is the extent to which structure internal to empirically congested flow disagrees with the KWM. Continuum models of traffic flow make predictions regarding density, mean speed and flow, all of which are continuum quantities that can be interpreted as mean values over some underlying distribution of vehicular speeds. But continuum models themselves are silent on the form of the associated speed distributions, and indeed regarding the nature of these distributions (i.e., over time and space, in a particular instance, or over an "ensemble" of instances). From this perspective structure within empirically congested flow perhaps provides information (e.g., the appropriate nature of the associated speed distribution) beyond that available from the KWM itself, but that information is not necessarily in contradiction to the KWM. See Nelson (submitted) for an example of a simple model of traffic flow that has such an internal structure within its congested regime, but nonetheless can be modeled reasonably well via the KWM, with an appropriately constituted FD. Note also the recent work of Bagnatini and Rascle (2003) in which a macroscopic model is displayed that displays spatial structure in its solutions, but has the property that suitably homogenized solutions nonetheless are solutions of the KWM. However, once more note that in some models structures can coarsen beyond any arbitrarily large but fixed length scale.
NONCLASSICAL KINEMATIC-WAVE MODELS A classical (strictly convex) FD will not reproduce the observed stable wide jams from a KWM. This section is a brief summary of what is known or believed about the ability of nonclassical KWMs to reproduce wide jams. Once we allow strictly linear pieces in Q(p), then some sort of stability of both fronts can be achieved, even for entropy solutions of the KWM, as long as both the density within the jam and the surrounding densities are within the same linear segment (Lin and Lo, 2003). This is because the slope of Q(p) denotes the phase velocity of the wave features, and if all densities in the range of interest are within the same linear segment, then their wave features move with the same velocity. Thus at least some of the elements of wide jams seemingly can be reproduced within the context of the simple triangular FD suggested by Newell (2002). However, such solutions seem to be only "weakly stable," in the sense that if the initial densities are slightly "smeared," then the ensuing density profile retains this smeared form, rather than reorganizing into a sharp front (i.e., displaying "self healing"). The bounded-acceleration extension (modification?) of the KWM (Lebacque, 2002) does not require the FD to hold in circumstances under which this would require maximum accelerations that exceed some a priori specified bound, but rather replaces the FD by the stipulation that the maximum acceleration occurring is equal to that bound. This modification has been demonstrated to lead to stable wide jams; see the reference cited for details. It is, however, a matter of taste if a model with bounded acceleration still is a kinematic model in
160 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction the strict sense, since bounded acceleration actually means that flow is no longer a function of local density only. hi unpublished work the authors have considered the KWM under an FD with a strictly convex but decreasing tail (i.e., positive second derivative and negative first derivative). The corresponding entropy solutions of the Riemann problem can be worked out, using results from the mathematical literature (Li, 2003, and citations therein). These solutions have some interesting features (e.g., deceleration fans and acceleration shocks). These can be explained in terms of hypothesized driver behavior. However, it does not appear that this approach is capable of leading to stable wide jams.
CONCLUSIONS This paper was written with the intent to first reach a firm basis of agreement between the two authors, and then to continue from there with the description and analysis of simulations that describe some of the more subtle effects of traffic flow, such as structure formation in queues. Somewhat surprisingly, just reaching the firm basis has exhausted the limits given for this paper. This seems to be caused by the following: (1) Both authors have their own intuitions about the dynamics of traffic flow. (2) Both authors agree that the other author's intuition is valid, although considerable explanation and thoughtfulness was necessary in order to have that agreement based on true mutual understanding. (3) Both authors' intuitions are consistent with the data sets that they were aware of; indeed, only very few data sets are able to answer at least some of the critical questions. The perhaps most significant example is the breakdown experiment of Sugiyama et al. (to appear), which, although it has been reported in 2001, has neither been published not been widely disseminated. Nevertheless, it is the only unequivocal example of spontaneous breakdown that we are aware of. Similar statements hold for the availability of data that are both temporal and spatial. The most important results of our effort are the following: The kinematic wave model (KWM) explains and predicts many if not most effects of real world traffic dynamics. As pointed out, e.g., by Daganzo, Cassidy, and Bertini (1999), much of the single detector data supposedly in support of spontaneous breakdown can also be explained by queue dynamics in conjunction with a geometrical constraint. On the other hand, there are some data sets that are, in both authors' views, very difficult to reconcile with the traditional KWM. This holds certainly for KWMs with strictly concave fundamental diagrams (FDs), which do not explain stable jams, spontaneous breakdown out of nothing, or structure formation in queues. Structure formation in queues could be argued as being beyond the spatial scale that KWMs claim to deal with, although a "true" phase transition interpretation of traffic flow would predict that these structures coagulate into larger and larger structures with increasing distance from the bottleneck. Finally, there seems to be only one unequivocal observation of spontaneous breakdown. As said before, more traffic data that include the spatial aspect is needed in order to make further progress. Further, the field of traffic-flow theory and analysis would benefit from an international effort to provide universal access to data supporting published analy-
Critical comparison of the kinematic-wave model with observational data 161 ses, and support from journal editors to make provision of such data to this project a prerequisite to publication would be helpful.
REFERENCES Agyemang-Duah, K. and F. L. Hall (1991). Some issues regarding the numerical value of capacity. In: Procs. Int. Symp. Highway Capacity and Level of Service (U. Brannolte, ed.), pp. 1-15, A. A. Balkema Press, Rotterdam. Ansorge, R. (1990). What does the entropy condition mean in traffic flow theory? Transp. Research B,24R, 133-144. Aw, A. and M. Rascle (2000). Resurrection of "Second Order" Models of Traffic Flow. SIAMJ. Applied Mathematics, 60, 916-938. Bagnerini, O. and M. Rascle (2003). A multiclass homogenized hyperbolic model of traffic flow. SIAMJ. Math. Anal, 35, 949-973. Bando, M. et al. (1995). Dynamical model of traffic congestion and numerical simulation. Physical Review E, 51, 1035-1042. Banks, J. H. (1990). Flow processes at a freeway bottleneck. Transp. Research Record, 1287, 20-28. Banks, J. H. (1991). Two-capacity phenomenon at freeway bottlenecks: A basis for ramp metering? Transp. Research Record, 1320, 83-90. Banks, J. H. (1991a). The two-capacity phenomenon: Some theoretical issues. Transp. Research Record, 1320, 234-241. Banks, J. H. (1999). Investigation of some characteristics of congested flow. Transp. Research Record, 1678, 128-134. Bale, D. S. et al. (2002). A wave propagation method for conservation laws and balance laws with spatially varying flux functions. SIAMJ. Scientific Computing, 24, 955-978. Bonneson, J. A. (1991). Modeling queued driver behavior at signalized junctions. Transp. Research Record, 1365, 99-107. Buisson, C. (1997). Decoupage objets de Strada. Internal report LICIT, ENTRE-INRETS, France. Cassidy, M. J. (1998). Bivariate relations in nearly stationary highway traffic. Transp. Research B, B32, 49-59. Cassidy, M. J. and R. Bertini (1999). Some traffic features at freeway bottlenecks. Transp. Research B, B33 25-42. Cassidy, M. J. and M. Mauch (2001). An observed traffic pattern in long freeway queues. Transp. Research A, A35 143-156. Ceder, A. (1967). A deterministic traffic flow model for the two-regime approach. Transp. Research Record, 567, 16-30. Daganzo, C. F., M. J. Cassidy, and R. Bertini (1999). Possible explanations of phase transitions in highway traffic. Transp. Research A, 33, 365-379. Daganzo, C. F. and J. A. Laval (2005). On the numerical treatment of moving bottlenecks. Transp. Research B, 39, 31-46.
162 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Drake, J. S., J. L. Schofer and A. D. May (1967). A statistical analysis of speed density hypotheses. Highway Research Record, 154, 53-87. Edie, L. C. and E. Baverez (1967). Generation and propagation of stop-start traffic waves. In: Vehicular Traffic science: Proc. 3r International Symp. Theo. Traff. Flow (L. C. Edie, R. Herman and R. Rothery, eds.) pp. 26-37, American Elsevier, New York. Edie, L. C. and R. S. Foote (1960). Effect of shock waves on tunnel traffic flow. Proc. Highway Research Board, 37, 492-505. Elefteriadou, L., R. P. Roess and W. R. McShane (1994). Probabilistic Nature of Breakdown at Freeway Merge Junctions. Transp. Research Record, 1484, 80-89. Hall, F. L. and K. Agyemang-Duah (1991). Freeway capacity drop and the definition of capacity. Transp. Research Record, 1320, 91-98. Jost, D. and K. Nagel (2003). Probabilistic traffic flow breakdown in stochastic car following models. Transp. Research Record, 1852, 152-158. Kerner, B. S. (1998). Experimental features of self-organization in traffic flow. Physical Review Letters, 81, 3797-3800. Kerner, B. S. (1999a). Phase transitions in traffic flow. In: Traffic and Granular Flow'99 (D. Helbing et al, eds.), pp. 253-284. Springer, Berlin. Kerner, B. S. (2002). Empirical macroscopic features of spatial-temporal traffic patterns at highway bottlenecks. Physical Review E, 65, Paper No. 046138. Kerner, B. S. (2004). The Physics of Traffic, Springer, Berlin. Kerner, B. S., S. L. Klenov and D. E. Wolf (2002). Cellular automata approach to threephase traffic theory. J. Physics A: Math. General, 35, 9971-10013. Kerner, B. S. and H. Rehborn (1996a). Experimental properties of complexity in traffic flow. Physical Review E, 53, R4275-R4278. Kerner, B. S. and H. Rehborn (1996b). Experimental features and characteristics of traffic jams. Physical Review E, 53, R1297-R1300. Kerner, B. S. and H. Rehborn (1997). Experimental properties of phase transitions in traffic flow. Physical Review Letters, 79, 4030-4033. Knospe, W. et al. (2002). Single-vehicle data of highway traffic: Microscopic description of traffic phases. Physical Review E, 65, 1-16. Koshi, M., M. Iwasaki and I. Ohkura (1981). Some findings and an overview on vehicular flow characteristics. In: Transp. and Traffic Theory: Proc. 8th ISTTT (V. F. Hurdle et al, eds.), pp. 403-426, University of Toronto Press, Toronto. Lebacque, J. P. (1996). The Godunov Scheme and what it means for first order traffic flow models. In: Transp. and Traffic Theory: Proc. 13th ISTTT (1. B. Lesort, ed.) pp. 647677, Pergamon, Oxford. Lebacque, J. P. (2002). A two-phase extension of the LWR model based on the boundedness of traffic acceleration. In: Transp. and Traffic Theory in the 21s' Century: Proc. 15th ISTTT (M. A. P. Taylor, ed.) pp. 697-718, Pergamon, Amsterdam. Lebacque, J. P. (to appear). Intersection modeling, application to macroscopic network traffic flow models and traffic management. In: Traffic and Granular Flow '03.. Lesort, J.-B., E. Bourrel and V. Henn (to appear). Various scales for traffic flow representation: Some reflections. In: Traffic and Granular Flow'03. Leveque, R. (1992). Numerical Methods for Conservation Laws. Birkhauser Verlag, Basel.
Critical comparison of the kinematic-wave model with observational data 163 Lighthill, M. J. and G. B. Whitham (1955). On kinematic waves II - a theory of traffic flow on long crowded roads. Proc. Royal Society, London, A229, 317-345. Li, T. (2003). Global solutions of nonconcave hyperbolic laws with relaxation arising from traffic flow. Journal of Differential Equations, 190, 131-149. Lin, F. B., P. Y. Tseng and C. W. Su (2004). Variations in queue discharge patterns and their implications in analysis of signalized intersections. In Proc. 83rd Annual Meeting Transp. Research Board, Wash. D.C., Jan. 11-15. Lin, W.-H. and H. K. Lo. A theoretical probe of a German experiment on stationary moving traffic jams. Transp. Res. B, 37, 251-261. Lorenz, M. R. and L. Elefteriadou (2001). Defining freeway capacity as function of breakdown probability. Transp. Research Record, 1776, 43-51. Mika, H. S., J. B. Keer and L. S. Yuan (1969). Dual mode behavior of freeway traffic. Highway Research Record, 279, 1-13. Mufioz, J. C. and C. F. Daganzo (2003). Structure of the transition zone behind freeway queues. Transp. Science, 37, 312-329. Nagel, K., P. Wagner, and R. Woesler (2003), Still flowing: Approaches to traffic flow and traffic jam modeling. Operations Research, 51, 681-710. Nelson, P. (submitted). On two-regime flow, fundamental diagrams and kinematic-wave theory. Submitted to Transp. Science, March 2004. Nelson, P. and N. Kumar (2004). Point-constriction, interface and boundary conditions for the kinematic-wave model: In Proc. 83rd Annual Meeting Transp. Research Board, Wash. D. C , Jan. 11-15. Newell, G. F. (1989). Comments on traffic dynamics. Transp. Research B, 23B, 386-389. Newell, G. F. (2002). A simplified car-following model: A lower order model. Transp. Research £, 36B 195-205. Payne, H. J. (1971). Models of freeway traffic and control. Simulation Council Procs., 1, Simulation Council, Inc., La Jolla, CA, 51-61. Persaud, B. N. and V. F. Hurdle (1991). Freeway capacity: definition and measurement issues. In: Proc. Int. Symp. Highway Capacity and Level of Service (U. Brannolte, ed.), pp. 289-307, A. A. Balkema Press, Rotterdam. Richards, P. I. (1956). Shockwaves on the highway. Operations Research, 4, 42-51. Ross, P. (1988). Traffic dynamics. Transp. Research B, 22B, 421-435. Ross, P. (1989). Response to Newell. Transp. Research 5, 23B, 390-391. Schonhof, M. and D. Helbing (submitted). Empirical features of congested traffic states and their implications for traffic modeling. See www.helbing.org. Sugiyama, Y. et al. (to appear). Observation, theory and experiment for freeway traffic as physics of many-body system, hi: Traffic and Granular Flow '03. Sugiyama, S. and A. Nakayama (2003). Understanding "synchronized flow" by optimal velocity model, hi: Modeling of Complex Systems: Seventh Granada Lectures (P. L. Garrido and J. Marro, eds.), pp. 111-115, American Institute of Physics. Wattleworth, J. A. (1963). Some aspects of macroscopic freeway traffic flow theory. Traffic Engineering, A35, 15-20. Windover, J. R. and M. J. Cassidy (2001). Some observed details for freeway traffic evolution. Transp. Research A, A35, 881-894.
This Page is intentionally Left Blank
9
AVERAGE VELOCITY OF WAVES PROPAGATING THROUGH CONGESTED FREEWAY TRAFFIC Benjamin A. Coifman, Department of Civil and Environmental Engineering and Geodetic Science, and Yun Wang, Department of Electrical and Computer Engineering, Ohio State University, Columbus, Ohio, USA
INTRODUCTION Large portions of traffic flow theory are built upon the bivariate relationship between flow and density or the related relationship between headway and spacing. This scope begins with the first-order, macroscopic model of Lighthill, Whitham and Richards (LWR) to predict the propagation of signals or waves through the traffic stream (Lighthill and Whitham, 1955; Richards, 1956) and continues into higher-order macroscopic models and microscopic models that attempt to model the behavior of individual drivers. But because it is difficult to measure density and uncommon to find stationary conditions during congested periods, debate continues about the shape of the bivariate curve and thus, implicitly impacts the models predicated upon it. It is widely agreed among traffic flow theorists that during free flow conditions flow increases monotonically with density, with a slight drop in slope as conditions approach capacity. But little can be said for certain about the congested regime beyond the fact that in aggregate, flow drops with increasing density. Empirical studies by Hall et al. (1986, 1988) propose an inverted V shape for the flow-occupancy curve, while noting that the findings were consistent with earlier studies. A few years later, out of convenience, Newell (1993) also chose to simplify the relationships by using a triangular flow-density curve for illustrative purposes in the course of theoretical development. Given a triangular curve, LWR predicts that during congested periods, waves should propagate upstream with a constant velocity, independent of
166 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction the given flow, density, or local traffic speed.1 Subsequent empirical analysis suggests that indeed, during congestion, waves do appear propagate upstream with roughly constant velocity. Windover and Cassidy (2001) showed that the upstream moving waves could be found by comparing the cumulative arrival curves across all lanes between two neighboring loop detector stations. They used data from a 2 km segment of northbound Interstate-880, just south of Oakland, California, and found that the wave velocities during congested periods were nearly constant (17-20 km/h) over the homogeneous freeway segment, independent of flow. Mauch and Cassidy (2002) observed traffic data over multiple days along a 10 km stretch of the Queen Elizabeth Way (Ontario, Canada). They measured wave velocities by plotting the cumulative arrival curve across all the lanes from many successive detector stations with vertical displacements in proportion to the physical distance separating the successive detector stations and found that the waves propagating upstream in congestion had nearly constant velocities in the range of 22-24 km/h, independent of the location and the flow. Smilowitz and Daganzo (2002) employed the LWR model to derive the wave velocity from the slope of the line passing through the two states in accumulation-flow relationship, where the accumulation is proportional to the density between two observers. They found wave velocities on a single lane, homogeneous highway segment were 17.2 km/h on one day and 18.8 km/h on another. Deviating from the earlier techniques of manually extracting wave velocities, Munoz and Daganzo (2001) applied cross correlation to cumulative arrival curves summed across selected lanes for a single sample period and found a wave velocity of 19.4 km/h. These earlier efforts suggest that the flow-density curve is indeed triangular, e.g., Windover and Cassidy (2001) note, "traffic on homogeneous freeway segments might better be modelled using linear (triangular-shaped) relations." But all of the earlier studies used small samples, often aggregated across several lanes, to find the velocity of waves during congestion. If the wave velocities are roughly constant, independent of traffic conditions, they can be used as inputs to estimate link travel times (Coifman, 2002), which is part of the motivation behind this paper. To provide a more comprehensive analysis of wave velocity during congested periods, this research builds off of the cross correlation idea presented by Munoz and Daganzo (2001) and seeks to extract the average wave velocity automatically for each sample. Our methodology can accommodate additional data with little human intervention, thereby allowing the study of much larger data sets to better model the phenomena. The following section of this paper uses cross correlation of cumulative arrivals measured at successive detector stations. Then the paper discusses the limitations arising from flow-based measures, such as cumulative arrivals, when attempting to measure waves propagating against the flow of traffic. The next section uses traffic speed measurements to address the limitations and then examines the influence of prevailing traffic speed, lane, and location on the results. This paper then closes with a brief discussion and conclusions.
' Throughout this paper, speed refers to motion of the traffic as it travels downstream and velocity refers to the motion of waves through the traffic stream. Furthermore, a positive velocity is used to denote when these waves travel upstream.
Average velocity of waves propagating through congestedfreeway traffic 167
AVERAGE WAVE VELOCITY FROM CROSS CORRELATION OF CUMULATIVE ARRIVALS BETWEEN TWO STATIONS Our first attempt to extract wave velocities automatically is to simply replicate Munoz and Daganzo's cross correlation method on one month (August, 2003) of cumulative arrival curves sampled every 2-seconds from seven successive detector stations in the westbound direction of the Berkeley Highway Laboratory (BHL) along Interstate-80, north of Oakland, CA (Coifman et. al., 2000). The method seeks to find the time lag at which the cross correlation of the two time series recorded at two successive detector stations reaches a maximum and that time lag corresponds to the dominant travel time of waves in the sample. The details for the cross correlation method are as follows. Assuming that waves propagate between the two stations, the upstream time series, y(t), could be regarded as a scaled and delayed version of downstream time series, x(t), with zero mean additive noise, n(t), i.e., y(t) = ax(t-ro)
+ n(t)
(1)
where cris the scale factor and z0 is time delay corresponding to the travel time of waves from downstream location to upstream location. Let R (T) represent the cross correlation of x(t) and y(t) , and R^ij)
be the auto-correlation of x(t) . From equation (1) and the
definitions of Rxy{t) and Rxx(t), we have: Rxy(r) = E[xQ)y(t + r)] = E[x(t){ax(t + T-T0) + n(t + T)}] = aE[x(t)x(t + T-T0)] = ORXX(T-T0)
Q)
where Ra (r) < R^ (0). Thus, Rxy (r) reaches its maximum when r = r 0 . For this study the search window for feasible time lags spanned -4096 sec to 4096 sec and in the rare cases that two maxima were found, the given sample is excluded. There are 5 lanes in each direction on the freeway segment used in this study (fig. 1). The innermost lane is reserved for high occupancy vehicles (HOVs), because the HOV lane generally exhibits little congestion compared to the general flow lanes it was excluded from the analysis of upstream moving waves. The seven dual-loop detector stations in the segment are denoted stl through st7, respectively. The stations are spaced about 1/2 km apart from each other and each detector station has a dual-loop detector in each lane, which allows for direct measurement of local traffic speeds.
168
Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
The event data from each detector are recorded at 60 Hz and then aggregated to 2-second average traffic speed and flow measurements. This 2-second aggregation was chosen because it is roughly on the order of typical headways and is consistent with Munoz and Daganzo (2001), facilitating comparison. Unlike Munoz and Daganzo, who paired lanes together, we applied the cross correlation technique on individual lanes. Because this study is limited to the waves that arise in congested traffic, the following pre-processing step is used to exclude all non-congested periods. The lane is considered congested if the 5-minute average traffic speed remains below a pre-specified threshold for at least one-hour at both the upstream and downstream stations on a link. Each contiguous "congested period" in each lane for each station pair is divided into non-overlapping, one-hour long samples that are used in the cross correlation analysis. The exact threshold was chosen somewhat arbitrarily, with the specific intent to ensure that conditions were indeed congested throughout the entire link for an extended period. A traffic speed threshold of 48 km/h (30 mph) was used in most of the analysis presented in this paper, though a higher threshold at 72 km/h (45 mph) was used as well throughout the research to verify the results did not depend on the choice of the threshold. Other sample durations were studied, such as 45-min and 30-min long, with results similar to those presented herein, but they became noisier as the period decreased. Fig. 2 shows the cumulative distribution (CDF) of the average wave velocity from each sample, estimated via cross correlation on an individual lane basis applied to the 2-second cumulative arrival curves after subtracting a background flow equal to each lane's average flow during the given period. So each datum in this distribution represents the wave velocity corresponding to the maximum correlation from a one hour long sample for the given lane. Rather than reporting mean or median, the entire distribution is shown to allow detailed evaluation, e.g., the standard deviation could be evaluated from the CDF. Over all links and in all lanes, one sees mixed results. Many of the observations are consistent with the earlier research, with wave velocities between 15 km/h and 25 km/h, but many more of the measurements fall outside this range. For reference, table 1 shows the total number of samples in each of the curves from fig. 2. The research also considered several related variations. In the first case, before employing cross correlation, rather than subtracting a background flow the cumulative arrival curves were filtered to remove the least-squares fit of a straight line from the data. Next, the time series of 2-second "raw" flow and of "filtered" flow (using the same filtering processing as used in cumulative arrival curves) were investigated for
Figure 1.
Schematic of the Berkeley Highway Laboratory on Interstate-80, north of Oakland, California.
Average velocity of waves propagating through congested freeway traffic
169
estimating the average wave velocity, applied to the same congested periods used in fig. 2. Fig. 3 shows the resulting CDFs of each sample's average wave velocity from the three additional methods for a typical station pair (st4 and st5 westbound, the other station pairs exhibited similar trends), compare to fig. 2D. The filtered cumulative arrivals found almost half of the measurements with zero time lag because in many cases the background flow was the dominant component. As a result, fig. 3A shows the CDF with the zero time lag included as dashed lines and excluding all samples with zero time lag with solid lines for the same lanes. In any event, all four methods had more measurements between 15 km/h and 25 km/h than any other 10 km/h window, with the filtered flow having many more measurements in this range compared to the other three methods. Although encouraging, the results remain mixed for all four methods since several lanes had fewer than 40 percent of the observations falling in the window.
Figure 2.
Distribution of the average wave velocity from each sample using cross correlation applied to cumulative arrival curves with background flow subtraction, August 2003, WB, BHL.
170 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Figure 3. Distribution of the average wave velocity from each sample using cross correlation applied to (A) filtered cumulative arrival curves (B) raw flow (C) filtered flow, st4 to st 5, August 2003, WB, BHL.
Table 1.
Number of Samples m each CDF for fig. 2 and fig. 5 Number of samples by lane st1 to st2
st2 to st3
st3 to st4
st4 to st5
st5 to st6
st6 to st7
Iane2
34
68
74
87
95
73
Iane3
62
70
84
75
76
63
Iane4
61
62
63
46
41
32
Iane5
44
44
56
37
13
10
PROBLEMS USING FLOW, OCCUPANCY AND CUMULATIVE ARRIVALS TO EXTRACT AVERAGE WAVE VELOCITY Given homogeneous vehicles and drivers, LWR predicts that for a convex flow-density relationship all waves should propagate upstream during congestion. Yet there are numerous examples in the literature demonstrating that some information actually travels downstream during congested periods, as observed in flow or occupancy measurements, e.g., Dailey (1993), Petty et al. (1997) and Cassidy and Windover (1998). Cassidy and Windover referred to this phenomenon as "driver memory" with drivers resuming similar headways after passing through disturbances while the other researchers simply used the phenomenon to measure travel time. None of these papers note the seemingly apparent conflict with LWR. To rectify this problem, one can derive an explanation based on the fact that real vehicles simply are not homogeneous.
Average velocity of waves propagating through congestedfreeway traffic 171 Consider fig. 4, showing a hypothetical example of several vehicles traveling in a freeway lane. The figure shows four vehicles moving from right to left. The i-th vehicle has a fixed effective length2, Lt, and a variable spatial gap between itself and the preceding vehicle, git that is likely to be a function of the driver, vehicles, and traffic conditions. The total spatial headway for this vehicle at any instant is simply, s
i = Li + Si
(3)
If two successive vehicles, i-1 and i, were traveling at the same constant speed, U, then the ith vehicle's headway passing a point in space is given by, h,=^-
(4)
or relaxing the assumption of constant speed to reflect the varying speeds experienced in congested traffic (as is done throughout the remainder of this paper), the relationship becomes, A,*^
(5)
where ut is the i-th vehicle's speed passing the specified point in space, e.g., a detector station. Similarly, as the vehicle passes a detector, it turns on for the following duration,
Figure 4.
2
A hypothetical example of the traffic stream showing the corresponding spacings, headways and detector status.
The effective length includes the physical length of the vehicle and the length of the detection zone.
172 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction L.
(6)
where an equal sign is used assuming the vehicle is traveling fast enough so that acceleration is negligible in the on-time measurement. Given these facts, if one measures flow, qJy and occupancy, ocCj, over a fixed number of vehicles, n, it should be clear that, n
1j=-
.
°CCj=—n
(7)
Most operating agencies use fixed sample periods, T, rather than fixed n, in which case the equalities in Equation 7 become "approximately equal" due to edge effects from partial headways observed at the start and end of a given sample.3 It should be clear from this derivation that both flow and occupancy are functions of ut and Lt. Obviously, Li travels downstream with the vehicles even during congested periods, e.g., Coifrnan and Cassidy (2002) explicitly used measured vehicle lengths to match the observation of a given platoon of vehicles at one station with the earlier observation of the same platoon from an upstream station on the same freeway during congested periods. This information traveling downstream will confound any attempt to extract information propagating upstream against the flow of traffic, e.g., although cut off by the horizontal axis of the plots, many velocities corresponding to downstream moving waves were found in the CDFs of fig. 2. The velocity of many of these downstream moving waves were on the order of the prevailing traffic speed, but they were not the dominant trend in the distribution, as evidenced by the majority of the velocities in fig. 2 indicating upstream moving waves. The relatively low frequency of downstream moving waves in the CDFs is due in part to the large sample period (1 hr), during which time the link travel speed experienced by drivers typically changes significantly and this range usually prevents the downstream moving waves from becoming the dominant feature in the crosscorrelation. The existence of downstream moving waves during congestion is consistent with the theoretical development of the mixed flow first-order macroscopic models of Zhang and Jin (2002) and Chanut and Buisson (2003), which extend LWR to heterogeneous flows of two or more vehicle types. Namely, in their models, trucks and cars had different lengths but travel with the same speed during congestion. These models predict that in congestion there are two kinds of waves, waves that move downstream with the vehicles as an artefact of the inhomogeneous vehicle (and driver) fleet and waves that move upstream according to LWR. If ui is independent of the inhomogeneities of the vehicle fleet, then one would expect that during congested periods LWR would better predict the evolution of traffic speed over time
3
In this case n changes from one sample to the next while T is the summation of the headways during a given sample. Provided the sample includes many vehicles, the contributions from the partial headways at the start and the end of the sample are usually negligible.
Average velocity of waves propagating through congestedfreeway traffic 173 and space than LWR does for flow during the same periods (or cumulative arrivals, which is simply a function of flow).
AVERAGE WAVE VELOCITY FROM CROSS CORRELATION OF LOCAL TRAFFIC SPEED BETWEEN TWO STATIONS In an attempt to improve the performance of the automated data extraction, and thus to analyze the characteristics of waves, the analysis now shifts to using local traffic speed from the detector stations to measure the average wave velocity in each hour long sample. As with the cumulative arrival data, the time series of local traffic speed measurements were filtered to remove the least-squares fit of a straight line from the data. Fig. 5 shows the CDFs of average wave velocity from each sample, estimated using the time series of 2-second traffic speed measurements corresponding to the same congestion samples used in fig. 2. The CDFs from local traffic speed exhibit a much tighter distribution compared to those from the cumulative arrival curves or flow measurements. Now all lanes in all links have over 90 percent of the measured wave velocities between 15 km/h and 25 km/h. Grouping all of the lanes and station pairs together, the median wave velocity is 18 km/h. Note that fig. 2 and fig. 5 only show the results for westbound traffic in August 2003 (WB03). The analysis was repeated for eastbound traffic (EB-03), as well as data from August 2002 (WB-02 and EB-02). In all four cases the results exhibited the same pattern moving from cumulative arrivals to local traffic speed when measuring the average wave velocity during congestion and all four cases exhibited the dominant wave velocity response in the range of 15-25 km/h, which is consistent with the previous research.
Characteristics of waves To investigate whether the upstream moving wave velocity is independent of local traffic conditions, this research examined the relationship between average wave velocity and the prevailing traffic speed in each sample. For each one-hour long congestion sample we measured the minimum, median, and maximum of the 2-second traffic speed measurements from the downstream detector station. The results were similar for all three parameters, so this paper only presents the results for the median. The points in fig. 6 show each sample's average wave velocity versus the median of the downstream station's traffic speed from the same data set presented in fig. 5. For brevity, all lane and station pairs are shown in a single plot. Of the 1370 data points in the figure only 8 percent are below 15 km/h. To extract the general trend, these data were binned by 5 km/h increments of the local traffic speed and the total number in each bin is noted in the first column of table 2. The median of each bin is shown in fig. 6 as a solid line, with the median being chosen over the mean to reduce the sensitivity to the small number of points that are far from the center of the distribution. Note that the slowest bin had
174 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Table 2. prevailing traffic speed range 0-5 km/h 5-10 km/h 10-15 km/h 15-20 km/h
Number of samples in fig. 6 - 9 Subsampling WB-02 WB-03 0
EB-03 0
5 71
3
WB-02 0
EB-02 0
0
0
0
0
2
34
0 3 21
3 12
20-25 km/h
184 271
15
71 104
25-30 km/h 30-35 km/h
310 286
48 61
132 111
55 82
35-40 km/h
197
40-45 km/h 45-50 km/h
45 1
92 26
66 13
4
0
Figure 5.
onramps 0
offramps lane 2 lane 3 lane 4 lane 5 0 0 0 0 0 0 1 2 2 2 18 31 30
8 49
27
113
63 85
33
107
96
18 24
91
3
55 8
101 52
20
43 28 2 0
0
0
0
0
84
18
5 0
21 42
15 30
49
24
58 64
49 30
51 17 1
39 15 0
Distribution of the average wave velocity from each sample using cross correlation applied to filtered traffic speed measurements, August 2003, WB, BHL.
only 5 samples and the fastest bin had only 1 sample. Ignoring the larger deviations arising from these two bins on the ends, the fitted line is relatively flat, ranging between 17 km/h and 19 km/h. Fig. 7 presents all four of the fitted lines resulting from each direction in each year.
Average velocity of waves propagating through congested freeway traffic
175
As with fig. 6, table 2 tallies the number in each bin, and again, both the first and last bin for each curve has few samples, they are included only for completeness. For each curve in fig. 7, one can see the wave velocities may exhibit a small correlation with the prevailing traffic speed, but given the fact that three of the curves increase slightly and one decreases, it would be premature to draw any conclusions about the details of any relationship. Investigating these finer points of the relationship will be the subject of future research. In any event, the range is less than 4 km/h of wave velocity over a span of 35 km/h of local traffic speed for all four of the curves. So if local traffic speed impacts the wave velocity during congested periods this impact is small and there are other unmeasured factors that impact the wave velocity with a similar magnitude. The congestion threshold was set to 48 km/h in fig. 7, but as noted previously, the analysis was repeated with a threshold of 72 km/h. The results from the higher threshold generally exhibit the same pattern but become slightly noisier at higher traffic speeds because many of the one-hour samples tend to include a mixture of free flow and congested conditions.
Figure 6.
Average wave velocity versus prevailing traffic speed for each sample, August 2003, WB. BHL.
176 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Figure 9.
(A) Median wave velocity versus prevailing traffic speed by lane, August 2003, WB, BHL. (B) Detail of A
Finally, we explicitly investigate if there is a strong relationship between lane change maneuvers and wave velocity. Because it is difficult to measure lane change maneuvers directly, inflow is used as a proxy for the net number of lane change maneuvers during a given sample, where the inflow is defined as the cumulative downstream arrivals less the cumulative upstream arrivals in the lane over the hour. Inflow will underestimate the total number of lane change maneuvers since exiting vehicles cancel out entering vehicles during the sample. Noise also arises in the measurement due to the fact that the number of vehicles stored in the lane may change between the start and the end of the sample, though this noise should be unbiased. Fig. 10 shows inflow versus wave velocity. Lane 5 regularly exhibits an outflow (negative inflow) of 500 vph between st 1 and 2, and then an inflow of 400 vph between st 2 and 3 due to the ramps. A few of the other lanes have an inflow on the order of 200 vph for these links, with the magnitude of the inflow being much smaller elsewhere. Yet as shown in Fig. 5 for these same data, all four lanes exhibit similar trends in wave velocity over all of the links. Thereby suggesting that aggregate wave velocity is independent of inflow. Of course it is possible that a relationship to lane change maneuvers may have been obscured by the long sampling period, the use of a proxy measurement, or simply the noise in the data.
CONCLUSIONS This paper employed cross correlation to estimate wave velocities between several successive detector stations during congested periods and over a large data set. Given homogeneous vehicles and drivers, LWR predicts that for a convex flow-density relationship all waves should propagate upstream during congested periods. The analysis first employed cumulative arrivals — a function of flow — and then the local traffic speed at the detector stations. It was shown that the flow-based analysis yield mixed results, with many measurements being consistent with earlier research, but many more measurements falling outside the typical range of measured wave velocities from the literature. But vehicles are not homogeneous and it was also shown that flow and occupancy depend on effective vehicle length as well as the
Average velocity of waves propagating through congestedfreeway traffic 177
Figure 10. Inflow versus wave velocity from each sample using cross correlation applied to filtered traffic speed measurements, August 2003, WB, BHL. local traffic speed. Because the vehicle lengths travel downstream with the vehicles, this information will hinder attempts to extract wave velocities propagating against the flow of traffic when using flow-based measures. This fact is evident in fig. 2 and 3. Trucks are restricted from lane 2, thus the standard deviation of vehicle lengths is smaller and less information travels with the vehicles. As a result, comparing across lanes for all of the plots in these figures, lane 2 had the highest percentage of observations that fell within the 15 km/h to 25 km/h window. To reduce the influence of the confounding vehicle lengths, the analysis was repeated over the exact same samples using local traffic speed measurements. Because drivers are constrained by downstream vehicles in congestion, the traffic speed trends are much less dependent on specific vehicle or driver characteristics. It was confirmed that LWR does a better job predicting the evolution of average traffic speed over time and space, with over 90 percent of the samples having an average wave velocity propagating upstream in the range of 15 km/h to 25 km/h. Of course these results represent the aggregate performance over one-hour samples and individual waves could differ significantly from this range, e.g., it is likely that other sources of noise remain in the data, such as lane change maneuvers disrupting the propagation ofwaves. Unlike earlier studies, the method presented in this paper is not labor intensive, thereby allowing for the study of a large amount of data and extracting the general trends in the wave velocity during congestion. Our results over two months of data from both westbound and
178 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction eastbound lanes of the BHL show that wave velocities are nearly constant over a large range of local traffic conditions, which is consistent with earlier work and further supports the use of a triangular flow-density relationship at least for a first-order approximation. There was some evidence that the wave velocity may change with local traffic speed but the change is very small, less than 1 kmyh of wave velocity for every 10 km/h of local traffic speed. Given the fact that the direction of this trend changed across the four data sets, this small trend may simply be an artifact of the sample size or it is indicative of other factors that have a similar impact on the wave velocity but are yet to be identified, hi any event, these outstanding questions are the subject of ongoing research. Unlike most of the earlier efforts to measure wave velocity during congested periods, the analysis was applied on a lane-by-lane basis, allowing for comparisons between lanes and for the analysis to quantify the impact on the wave velocity from vehicles entering or leaving at ramps. To this end, wave velocity does not appear to have a dependence on ramps or the particular lane. However, future research will seek to verify this finding. For example, this analysis was limited to the BHL, which has five lanes in each direction, results may be different for a two or three lane freeway.
ACKNOWLEDGEMENTS This material is based upon work supported in part by the National Science Foundation under Grant No. 0133278. The authors also wish to thank the anonymous reviewers for their valuable feedback.
REFERENCES Cassidy, MJ. and J.R. Windover (1998). Driver memory: motorist selection and retention of individualized headways in highway traffic. Transportation Research: Part A, 32(2), 129-137. Chanut, S. and C. Buisson (2003). Macroscopic Model and Its Numerical Solution for TwoFlow Mixed Traffic with Different Speeds and Lengths. Transportation Research Record: Journal of the Transportation Research Board, No. 1852, TRB, National Research Council, Washington, D.C., pp.209-219. Coifman, B., D. Lyddy and A. Sabardonis (2000). The Berkeley Highway LaboratoryBuilding on the 1-880 Field Experiment. Proc. IEEE ITS Council Annual Meeting, IEEE, 2000, pp 5-10. Coifman, B. (2002). Estimating Travel Time and Vehicle Trajectories on Freeways Using Dual Loop Detectors. Transportation Research: Part A, 36(4), pp. 351-364. Coifman, B., and MJ. Cassidy, (2002). Vehicle Reidentification and Travel Time Measurement on Congested Freeways, Transportation Research: Part A, 36(10), pp. 899-917. Daganzo, C. F. (1997). Fundamentals of Transportation and Traffic Operations. Pergamon.
Average velocity of waves propagating through congestedfreeway traffic 179 Dailey, D. (1993). Travel Time Estimation Using Cross Correlation Techniques, Transportation Research: Part B, 27(2), pp 97-107. Hall, F. L., B. L. Allen and M. A. Gunter (1986). Empirical Analysis of Freeway FlowDensity Relationships. Transportation Research: Part A, 20(3), pp. 197-210. Hall, F. L and T. N. Lam (1988). The Characteristics of Congested Flow on a Freeway across Lanes, Space and Time. Transportation Research: Part A, 22(1), pp. 45-56. Lighthill, M. J. and G. B. Whitham (1955). On Kinematic Waves. I Flow Movement in Long Rives. II A Theory of Traffic Flow on long Crowded Roads. Proc. Roy. Soc, A. 229, 281-345 Munoz, J. C. and C. F. Daganzo (2001). The Bottleneck Mechanism of a Freeway Diverge. Paper presented at the 80th annual TRB meeting, Transportation Research Board, January 2001. Mauch, M. and M. J. Cassidy (2002). Freeway traffic oscillations: observations and predictions. International Symptom of Traffic and Transportation Theory, (M.A.P. Taylor, Ed.) Elsevier, Amsterdam, pp. 653-674. Newell, G. F. (1993). A Simplified Theory of Kinematic Waves in Highway Traffic, I General Theory, II Queuing at freeway bottlenecks, III Multi-destination Flows. Transportation Research, Part B, 27(4), pp. 281-313. Petty, K., P. Bickel, M. Ostland, J. Rice, F. Schoenberg, J. Jiang, and Y. Ritov, (1997). Accurate Estimation of Travel Times From Single Loop Detectors, Transportation Research: Part A, 32(1), pp 1-17. Richards, P. I. (1956). Shockwaves on the Highway. Operations Research, pp. 42-45. Smilowitz, K. R. and C. F. Daganzo (2002). Reproducible Features of Congested Highway Traffic. Mathematical and Computer Modeling, 35, 509-515. Windover, J. and M. J. Cassidy (2001). Some Observed Details of Freeway Traffic Evolution. Transportation Research Part A, 35(10), pp. 881-894. Zhang, H.M. and W.L. Jin (2002). Kinematic Wave Traffic Flow Model for Mixed Traffic. Transportation Research Record: Journal of the Transportation Research Board, No. 1802, TRB, National Research Council, Washington, D.C., pp. 197-204.
This Page is intentionally Left Blank
10
MICROSCOPIC THREE-PHASE TRAFFIC THEORY AND ITS APPLICATIONS FOR FREEWAY TRAFFIC CONTROL Boris S. Kerner, DaimlerChrysler AG, Stuttgart, Germany
INTRODUCTION There are a huge number of traffic flow theories and models, which should explain diverse congested traffic patterns that are observed upstream of freeway bottlenecks (see e.g. references in the reviews by Gartner et al. (eds.) (1997); Helbing (2001)). However, it is only recently that a "puzzle" of spatiotemporal features of congested patterns has been solved and these pattern features adequately understood (Kerner, 1998, 2002). Consequently, earlier traffic flow theories and models are in a serious conflict with many of these empirical spatiotemporal traffic pattern features. Therefore, the author introduced "three-phase traffic theory" (see references in Kerner (2004)). In three-phase traffic theory, besides the "free flow" phase there are two other phases in congested traffic: "synchronized flow" and "wide moving jam." Thus, there are three traffic phases in this theory: 1. Free flow. 2. Synchronized flow. 3. Wide moving jam. Three-phase traffic theory explains the complexity of traffic based on phase transitions among the three traffic phases, and on their complex nonlinear spatiotemporal features. The empirical (objective) criteria that distinguish between the two traffic phases in congested traffic are related to spatiotemporal features of these phases (Kerner, 1998, 2002). A wide moving jam is a moving jam that maintains the mean velocity of the downstream jam front, even when the jam propagates through any other traffic states or freeway bottlenecks. In
182 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction contrast, the downstream front of the "synchronized flow" phase is often fixed at a freeway bottleneck. Within this front, vehicles accelerate from lower speeds in synchronized flow to higher speeds in free flow. Three-phase traffic theory is a qualitative theory (Kerner, 1998, 2002). The related microscopic theory (Kerner and Klenov, 2002, 2003) confirms hypotheses of this theory. This microscopic theory explains all known up to now reproducible empirical spatiotemporal congested pattern features at freeway bottlenecks. Note that in the book (Kerner, 2004) empirical features of reproducible freeway traffic patterns, three-phase traffic theory including a microscopic analysis of congested patterns, as well as their engineering applications (traffic pattern recognition, tracking, prediction, and control) have been considered. In this paper, simulation model results based on a numerical study of a microscopic traffic flow model in the context of three-phase traffic theory are presented. A deep connection between the diagram of congested patterns at bottlenecks with probabilistic theory of freeway capacity of free flow at bottlenecks, as well as application of the microscopic three-phase traffic theory for on-ramp inflow control and for a study of an ACC vehicle influence on spatiotemporal congested patterns at bottlenecks are discussed. STOCHASTIC MICROSCOPIC MODEL Here, we consider a stochastic microscopic two-lane model in the context of three-phase traffic theory (Kerner and Klenov, 2002, 2003). Model results presented below are related to numerical simulations of this model. We discuss only a hypothetical traffic flow with identical vehicles. A model of heterogeneous flow can be found in (Kerner, 2004). Basic rules of vehicle motion Basic rules of vehicle motion in the model of identical vehicles are as follows: vn+1 =max(0,min(v f r e e ,v s n ,v c n )),
Vc
jVn+An - "|vn+ant = n
f
Or for
x n+1 = x n + vn+1x,
«,n-Xn^Dn x,,n-xn>Dn'
(1)
X
An = max(-b n x,min(a n x,v M -v n )),
U
(3)
where index n corresponds to the discrete time t = nx, n = 0,1,2,...; x is the time step; vfrl,e is the maximum speed in free flow; the lower index £ marks functions (or values) related to the preceding vehicle; D n is a synchronized distance; an > 0 and b n > 0 (see below). In (1), vs n is a safe speed (KrauB et ah, 1997) that is a solution of the equation (Gipps, 1981)
Microscopic three-phase traffic theory and applications 183 v s ,^ + X d (v Sjn ) = g n +X d (v S j n ),
whereX d (u) = bT2(ap + a ( a - l ) / 2 ) ,
(4)
g n = x ^ n - x n - d is the space gap between vehicles, d is the vehicle length, b is a constant, a is the integer part of u / bx, (3 is the fractional part of u / bx. Speed adaptation within synchronized distance and steady model states Eqs. (l)-(3) describe the speed adaptation effect in synchronized flow. This speed adaptation effect takes place when the vehicle cannot pass the preceding vehicle, within the synchronization distance D n : at x<>n - x n n ),
(5)
D(u, w) = d + max(0, ktu + (^"'u^i - w)),
(6)
where k>l and (j> are constants; a is the maximum acceleration. Model fluctuations and random vehicle acceleration and deceleration As in other stochastic traffic flow models (see references in Helbing (2001)), at the first step of calculations of the model, the speed of each vehicle is vn+1 = v n+1 ,
(7)
where vn+1 is calculated based on Eqs. (l)-(6). At the second step, a noise component ^n is added to the calculated speed vn+1 (7) and then the final value of the speed vn+1 at time step n+1 is found from the condition vn+1 = max(0, min(vfree, vn+1 + ^ n , vn + a, v s n )).
(8)
Random deceleration and acceleration are applied depending on whether the vehicle decelerates or accelerates, or else maintains its speed: f-5b 4n =
if Sn+1 = -1
4a i f S n + 1 = l { 0 ifS n + 1 =O,
(9)
184 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction where 4 a and t,h are random sources for deceleration and acceleration, respectively: (10) (11)
^=aT6(pa-r), *b=aT0(Pb-r),
p a and p b are probabilities of random acceleration and deceleration, respectively; r = rand(0,l), i.e., this is an independent random value uniformly distributed between 0 and 1; 9(z) = 0 at z < 0 and 9(z) = 1 at z > 0; S n+] denotes the state of vehicle motion (S n+1 = - 1 represents deceleration, Sn+1 = 1 acceleration, and Sn+1 = 0 motion at nearly constant speed):
Sn+1=
[-1 i f v n + 1 < v n - 8 1 ifvn+1>vn+8 0 otherwise,
(12)
where 8 is a constant (8 « at).
Fig. 1. Explanation of the model: (a) Hypothetical steady state model solutions, (b) Steady state solutions and the line / that represents a steady propagation of the downstream front of a wide moving jam. (c) Model of an on-ramp bottleneck. In (b), qout and p min are the flow rate and density in free flow formed in the wide moving jam outflow, p max is the density within a wide moving jam (see references in Kerner (2004)). To simulate a driver time delay either in vehicle acceleration or in vehicle deceleration, an and b n in (2), (3) are taken as the following stochastic functions an=a6(P0-ri), bn=a0(P1-r1),
(13) (14)
Microscopic three-phase traffic theory and applications 185
Po=!Po 0 [1
if
*-*1 Sn=l,
Pl
lf
S
lP 2
if
Pl=j 1
lf
"""1
(15)
(16)
Sn=-1,
where rx = rand(0,1); probabilities p o (v), p 2 (v) are given functions of speed, probability P! is a constant;
1 - Po and 1 - P, are the probabilities of a random time delay in vehicle
acceleration and deceleration, respectively. Models for two-lane traffic flow and on-ramp bottleneck Lane changing rules in a two-lane model are associated with conditions R^L:
v;>v,iI,+81andvI1Sv<>n,
(17)
L^R:
v;>v,>n+51orv>vn+51
(18)
for lane changing from the right lane to the left (passing) lane (R -» L) (17) and a return change (L —» R) (18). The safety conditions for lane changing are g>min(vnT,D;-d),
(19)
g;>min(v;T,D;-d),
(20)
D;=D(vnX),
(21)
D;=D(V;,vn).
Functions in (21) are associated with the function D(u,w) (6). In (17), (18), &l >0 is a constant, hi (17)-(21), superscripts + and - in variables and functions denote the preceding vehicle and the trailing vehicle in the "target" (neighboring) lane, respectively. In the model, there is an on-ramp on the main two-lane road (Fig. l(c)). The related on-ramp bottleneck consists of two parts: (i) The merging region of length L m , where vehicles can merge onto the main road from the on-ramp lane, (ii) A part of the on-ramp lane of length Lr upstream of the merging region, where vehicles move in accordance with the model (1)-(16). Open boundary conditions are applied. Main behavioral model assumptions and model parameters 1. In synchronized flow, a driver accepts a range of different hypothetical steady state speeds at the same space gap to the preceding vehicle (see (2) and Fig. l(a)). 2. A driver tends to adjust the speed to the preceding vehicle within the synchronization distance (5), (6).
186 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction 3. Over-acceleration effect: In synchronized flow of a lower density, a driver searches for the opportunity to accelerate and to pass. Random acceleration ^a (9), (10) describes this effect: The over-acceleration is simulated as a "collective effect", which occurs on average in traffic flow, through the use of random vehicle acceleration. 4. Over-deceleration effect occurring if the preceding vehicle begins to decelerate unexpectedly. This well-known effect associated with a driver time delay in deceleration simulates moving jam emergence in synchronized flow. In the model, the over-deceleration is simulated as a "collective effect" through the use of random deceleration £b (9), (11). Thus, random deceleration and acceleration (9)-(ll) simulate driver time delays mentioned in item 3 and 4, which occur if the vehicle either accelerates or decelerates only, therefore, in (9) £,n = 0 if Sn+1 = 0. 5. At the downstream front of synchronized flow, which separates this synchronized flow upstream and free flow downstream, a driver in synchronized flow does not accelerate before the preceding vehicle has begun to accelerate. Formulae (13), (15) together with (l)-(3) simulate the associated driver time delay in acceleration that takes place if the vehicle does not accelerate (S n * 1) at time step n. 6. Moving in synchronized flow, a driver comes closer to the preceding vehicle over time that explains the pinch effect in synchronized flow (Kerner, 2004). Formulae (14), (16) together with (l)-(3) simulate a driver time delay in deceleration associated with this effect. We see that random model characteristics are used to simulate various driver time delays, which are assumed to be different in various local driving conditions. Quantitative validation of these driver time delays and of other model parameters have been made to have simulation parameters of congested patterns, in particular, the characteristic times of phase transitions as well as the velocities of the fronts that separate free flow, synchronized flow, and moving jams within the patterns in accordance with empirical results (Kerner, 2002). A detailed consideration of this model parameter validation can be found in (Kerner, 2004). DIAGRAM OF CONGESTED PATTERNS AT ON-RAMP BOTTLENECK IN THREE-PHASE TRAFFIC THEORY This section contains simulation results of congested patterns at an on-ramp bottleneck and of the associated congested pattern diagram determined from application of the model presented in the previous section. This congested pattern diagram contains regions of congested pattern occurrence and existence in the flow-flow plane (Fig. 2(a)) whose coordinates are the flow rate qin in free flow upstream of the bottleneck and the flow rate to the on-ramp qon (Fig. l(c)) (Kerner, 2002; Kerner and Klenov, 2002, 2003). There are two main types of congested patterns (Fig. 2): (i) a synchronized flow pattern (SP) and (ii) a general pattern (GP). The SP is a congested pattern that consists of synchronized flow only, i.e., there are no wide moving jams within the SP. The GP is a congested pattern, which consists of synchronized flow upstream of the bottleneck and wide moving jams that emerge spontaneously in that synchronized flow.
Microscopic three-phase traffic theory and applications 187 There are three types of SPs: (1) Widening SP (WSP) (Fig. 2(b)). The downstream front of an WSP is fixed at the bottleneck. The upstream front of the WSP propagates upstream continuously over time. (2) Localized SP (LSP) (Fig. 2(c)). As in the WSP, the downstream front of an LSP is fixed at the bottleneck. In contrast with the WSP, the upstream front of the LSP is localized at some distance upstream of the bottleneck. (3) Moving SP (MSP) (Fig. 2(d)). In contrast with the LSP and WSP, an MSP is an SP that propagates as a whole localized pattern on the freeway over time. However, in contrast with a wide moving jam, if an MSP reaches a bottleneck, the MSP is caught at the bottleneck: The MSP that propagates upstream can exist only for a finite time. There are two main boundaries in the pattern diagram, FS(B) and Sj B) (Fig. 2(a)). Below and left of the boundary FgB), free flow is realized at the bottleneck. Between the boundaries FS(B) and Sj B) different SPs emerge on the main road upstream of the bottleneck (Figs. 2(b-d)). Right of the boundary Sf } different GPs appear (Figs. 2(e-h)). If qin > q out , where qout is the flow rate in free flow formed in the wide moving jam outflow, then the width (in the longitudinal direction) of the farthest upstream wide moving jam of an GP gradually increases over time (Figs. 2(e, h)). If in contrast qin < q out , then the farthest upstream wide moving jam of an GP gradually dissolves over time (Fig. 2(f)). However, even if qin < q out , the region of wide moving jams in the GP can expand in the upstream direction. There is a region in the diagram right of the boundary Sj B) where a dissolving GP (DGP) occurs. In the DGP (Fig. 2(g)), continuous wide moving jam emergence is interrupted. As a result, a single wide moving jam emerges only and an LSP remains at the bottleneck, while the wide moving jam moves on the main road upstream of the bottleneck. It must be noted that several independent scientific groups have recently developed new microscopic traffic flow models in the context of the author's three-phase traffic theory (Davis, 2004; Lee et at, 2004; Jiang and Wu, 2004). Models of Lee et al. (2004) and Jiang and Wu (2004) exhibit features of the diagram of Kerner (2002) (Fig. 2(a)).
188 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction
Fig. 2. Congested patterns at on-ramp bottleneck (Kerner, 2002; Kemer and Klenov, 2002, 2003): (a) - Congested pattern diagram, (b-g) - Vehicle speed on the main road within different congested patterns: an WSP (b), an LSP (c), an MSP (d), an GP at qin > qout (e), an GP at qin < qout (f), and an DGP (g). (h) - Vehicle trajectories within the GP in (e).
Microscopic three-phase traffic theory and applications 189 CRITICAL DISCUSSION OF EARLIER DIAGRAM OF CONGESTED PATTERNS AT ON-RAMP BOTTLENECK In this section, we compare the congested pattern diagram of three-phase traffic theory discussed in the previous section with earlier model results associated with congested pattern emergence at an on-ramp bottleneck as well as with empirical features of the onset of congestion in free flow at the bottleneck. Results of three-phase traffic theory (Kerner, 1998, 2002, 2004) contradict qualitatively with conclusions of all earlier traffic flow theories and models that claim to explain the onset of congestion at the bottleneck (Helbing, 2001). Most of these microscopic, macroscopic, probabilistic, and other models of freeway traffic explain the onset of congestion in free flow at the bottleneck by moving jam emergence. Note that congested states occurring at the bottleneck, which are associated with different types of moving jams, are classified by Helbing et al. (1999) as MLC (moving localized cluster), TSG (triggered stop-and-go traffic), and OCT (oscillatory congested traffic) (Fig. 3(a)). (a) Diagram of Helbing
Fig. 3. Sketch of congested pattern diagrams at an on-ramp bottleneck at a high enough given flow rate qin upstream of the bottleneck as a function of the flow rate to the on-ramp qon : (a) - earlier traffic theories (Helbing et al, 1999). (b) - three-phase traffic theory (Kerner, 2002). However, the fundamental model result that the onset of congestion in free flow at freeway bottlenecks is associated with spontaneous moving jam emergence (Kerner et al, 1995; Lee et al, 1998; Helbing et al., 1999; Helbing, 2001) is in a serious conflict with empirical evidence (Kerner, 1998, 2002, 2004). In empirical observations, rather than moving jam emergence, a phase transition from free flow to synchronized flow (F -> S transition) governs the onset of congestion in free flow at the bottleneck. A first-order F —> S transition postulated in three-phase traffic theory discloses the nature of the breakdown phenomenon at freeway bottlenecks found in empirical observations (see Hall et al. (1992); Elefteriadou et al. (1995);
190 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction Persaud et al. (1998); Kerner (2004) and references therein): The terms "F->S transition", "breakdown phenomenon", "traffic breakdown", and "speed breakdown" are synonyms. The crucial difference between the congested pattern diagram at an on-ramp bottleneck derived by Helbing et al. (1999) for earlier traffic flow models (e.g., Kerner et al, 1995; Lee et al., 1998; Helbing et al., 1999; Helbing, 2001) and the congested pattern diagram of threephase traffic theory (Fig. 2(a)) derived by Kerner (2002) can be seen in Fig. 3. If the flow rate upstream of the bottleneck qin is a given high enough value and the flow rate to the on-ramp qon increases gradually beginning from zero, then in the diagram of Helbing (Fig. 3(a)) the onset of congestion at the bottleneck is associated with moving jam emergence in free flow. This is inconsistent with empirical results mentioned above in which moving jams do not emerge spontaneously in free flow at the bottleneck. In contrast, in the diagram of Kerner (Fig. 3(b)) under the same conditions the onset of congestion is associated with synchronized flow emergence (different SPs appear). This is in accordance with empirical results. If qon further increases, then as follows from the diagram of Helbing (Fig. 3 (a)), homogeneous congested traffic (HCT) occurs in which no wide moving jams emerge. This model result is also inconsistent with empirical results in which at greater qon moving jams emerge in synchronized flow, i.e., GPs appear (Kerner, 1998, 2002). The latter is exact the result of the diagram of Kerner (Fig. 3(b)) in which GPs emerge at greater qon . Conclusions: Congested patterns at the bottleneck are qualitatively different in the diagram of Helbing (Fig. 3(a)) and in the diagram of Kerner (Fig. 3(b)). The diagram of Helbing is inconsistent with empirical congested pattern emergence, whereas the diagram of Kerner explains empirical congested pattern features. PROBABILISTIC THEORY OF FREEWAY CAPACITY AT BOTTLENECKS In this section, a deep connection between the congested pattern diagram based on threephase traffic theory (Figs. 2(a) and 4(a)) with a probabilistic theory of freeway capacity at bottlenecks is discussed (see references in Kerner (2004)). This diagram (Fig. 4(a)) found in model simulations and a probabilistic theory of traffic breakdown at an on-ramp bottleneck (Kerner and Klenov, 2005) can explain empirical features of probabilistic freeway capacity at the bottleneck (Elefteriadou et al., 1995; Persaud et al, 1998; Lorenz and Elefteriadou, 2000). Firstly note that in three-phase traffic theory (Kerner, 2004), traffic breakdown is associated with a deterministic, i.e., motionless and permanent perturbation (decrease in speed and increase in density) in free flow occurring at the bottleneck due to the on-ramp inflow. Even if there were no random perturbations in traffic flow, the deterministic traffic breakdown (deterministic F —> S transition) occurs within the deterministic perturbation at the bottleneck after a critical flow rate for deterministic traffic breakdown Isum
=
Ideterm, FS
(22)
Microscopic three-phase traffic theory and applications 191 is reached, where qsum = qon + q in . However, real random perturbations within the deterministic perturbation can cause random traffic breakdown (random F -> S transition) at the flow rate Isum
<
(23)
Ideterm, FS
In three-phase traffic theory, the boundary FS(B) in the congested pattern diagram (Figs. 2(a) and 4(a)) is associated with this random F - » S transition occurring during a given time interval Tob with probability PpB), which is equal to 1. hi empirical data, the role of the time Tob for observing traffic flow is played by the averaging time interval Tav for traffic flow.
Fig. 4. Probabilistic breakdown phenomenon at on-ramp bottleneck (Kerner, 2004; Kerner and Klenov, 2005): (a) - Simplified diagram from Fig. 2(a) with the threshold boundary Ft(hB). (b) - Boundaries for two constant values of the breakdown nucleation rate G(FB) (28) (curves 1 and 2) together with the boundary F ^ ^
s
for deterministic traffic breakdown, (c) -
B)
Probability P^ for traffic breakdown as a function of the flow rate qsum at a given qon . A random F - » S transition can also occur at the bottleneck during the time interval Tob if a point (q on , q in ) in the diagram is below and left of the boundary F^B) (dashed region in Fig. 4(a)). However, the probability P^B) for this F->S transition is less than 1. The more distant the point (q on , q in ) from the boundary FS(B), the less the probability P^B) for an transition at the bottleneck. There should be the threshold boundary FtbB) in the diagram: If a
192 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction point (q o n ,q i n ) in the diagram is below and left of this threshold boundary Ft(hB), then the probability PpB' for an F -» S transition at the bottleneck during the time interval Tob is equal to zero, i.e., no F —> S transition can occur at the bottleneck during this time interval. Thus, there are an infinite number of maximum freeway capacities in free flow at an on-ramp bottleneck, qJ^exeB). These maximum freeway capacities are equal to the critical (maximum) flow rates downstream of the bottleneck qsiim = qin + qon associated with the points (q on , q in ) in the diagram, which lie on the boundary FS(B): qSx eB) =qsu m (qon.q m )l F . B .The maximum freeway capacities related to the boundary FS(B)
(24) depend on the flow rates qon ,
q in , and the time interval T ob . The greatest of these maximum freeway capacities is the maximum freeway capacity at qon -> 0 (but qon * 0 ) denoted by q^raexeB^ (Figs. 2(a) and 4(a)). Each of the maximum freeway capacities cannot be observed at the bottleneck during a longer time interval thanTob . This is related to an F—»S transition that occurs spontaneously in this free flow at the bottleneck during the time interval Tob with the probability
p B>
- L,>r> =1 -
(25)
If Tob decreases, then the position of the boundary FS(B) changes: At a given q in , the maximum capacity q™aexeB) associated with a new boundary position increases. This increase has a limit given by the maximum capacity q ^ ^ p s (22) that lies on a limit boundary Fdeterm s
m tne
diagram associated with a deterministic F —> S transition (deterministic traffic
breakdown) (Fig. 4(b)). Thus, when q££ B) -> q FS , the boundary F Fd(B)erm, s . There are also an infinite number of minimum freeway capacities at the bottleneck, q(tB). These minimum freeway capacities are equal to the threshold flow rates downstream of the bottleneck qsum = qin + qon associated with the points (q on , q in ) in the diagram, which lie on the threshold boundary Ft(hB) in the diagram of congested patterns: q!hB)=qsum(qon>q,n)|Fr-
(26)
The minimum freeway capacities are the minimum flow rates downstream of the bottleneck at which an F—>S transition can still occur spontaneously in this free flow at the bottleneck during the time interval T ob . This mean that the flow rates downstream of the bottleneck qsum = qin +q<>n m at are related to points (q on , q in ) in the diagram, which lie below and left
Microscopic three-phase traffic theory and applications 193 of the threshold boundary Ft(hB) in the diagram of congested patterns, are less than any freeway capacity: At these flow rates qsum = qin + qon the probability PFB) for an F —> S transition at the bottleneck during the time interval Tob is equal to zero. Maximum freeway capacities are related to the boundary FS(B) in the diagram. Minimum freeway capacities are related to the threshold boundary FtbB) in the diagram (Fig. 4(a)). Different flow rates qsum = qin + qon downstream of the bottleneck associated with the points (q on , q in ) between the boundaries FgB) and Ft(hB> in the diagram are also equal to the infinity of freeway capacities in free flow at the bottleneck. This is because at each of the corresponding flow rates qsum =q i n +q on an F—>S transition occurs spontaneously at the bottleneck during the time interval Tob with the probability P F B) , which satisfies the condition O
(27) B
B)
When the flow rate qsum increases beginning from qsum = q ' \ the probability PF (27) for traffic breakdown exhibits an exponentional growth (Fig. 4(c)). Such growth, which is observed in empirical observations (Persaud et al., 1998; Lorenz and Elefteriadou, 2000), is usual for each first-order phase transition in systems of natural science. This confirms that traffic breakdown is a first-order F—>S transition. These conclusions follow also from a probabilistic model for random traffic breakdown at the bottleneck, hi accordance with this model, the nucleation rate GFB) of traffic breakdown is (Kerner and Klenov, 2005)
G (B) =
U . \l/2 a (B) qde,em1,Fs£dAJ
V2*Nd
f 3/2\ ISNgAg)
\
S^J
w h e r e A
(B) _ Qdete^FS q«um qdB>em>FS
(2g)
Idet'erm FS , N d , and ^d are functions of qon . The nucleation rate G F |' determines the mean frequency [ min"1 ] with which for given qon and qjn random traffic breakdown occurs at the bottleneck. As the probability PFf' (Fig. 4(c)), the associated generation rate GFB) for traffic breakdown exhibits an exponentional growth if Ac (28) decreases, i.e., when qsum increases (curves 1 and 2 in Fig. 4(b) are related to GFB) = 1/3.5 and 1/60 [miiT1], respectively). For traffic flow, this growth is very sensible to the critical flow rate qdB)erm FS (22). This emphasizes an important impact of deterministic traffic breakdown on freeway capacity.
194 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction METASTABILITY OF CONGESTED PATTERNS AT ON-RAMP BOTTLENECK In this section, we show that at the same traffic demand depending on initial conditions and fluctuations in traffic flow qualitatively different congested patterns can occur at the same bottleneck. This effect is called the metastability effect of pattern formation.
Fig. 5. Metastability of congested pattern (Kerner and Klenov, 2003): (a) Initial short-time perturbations to the flow rate qon used for pattern excitation, (b-d) Different traffic patterns at the same flow rates qon and qjn : Free flow (b), an LSP (c), and an GP (d). No perturbation to qon (line 1 in (a)) is applied for free flow (b); for the excitation of the LSP (c) (line 2 in (a)) and of the GP (d) (line 3 in (a)) short-time perturbations to the flow rate qon are applied. hi Fig. 5, depending on the amplitude of an initial short-time perturbation applied to qon (Fig. 5(a)) either free flow (Fig. 5(b)) or an LSP (Fig. 5(c)), or else an GP (Fig. 5(d)) is excited at the bottleneck. The stability of these three states is markedly different. Whereas free flow (Fig. 5(b)) and the GP (Fig. 5(d)) remain stable for 120 min in 10 different calculated realizations, the LSP has transformed spontaneously into an GP in 6 of 10 realizations. INTENSIFICATION OF DOWNSTREAM CONGESTION DUE TO UPSTREAM CONGESTION In this section, based on the microscopic model discussed above we consider some results of numerical simulations of complex congested patterns, which emerge on a freeway with two adjacent on-ramp bottlenecks (Kerner and Klenov, 2003). We call the bottleneck with the flow rate to the on-ramp q^ p) , which is at a freeway location x = x^ p) upstream, the on-ramp 'U' (upstream bottleneck) and the on-ramp bottleneck with the flow rate to the on-ramp
Microscopic three-phase traffic theory and applications 195 q^ own) ,
which is at a location x = x^ own) downstream, the on-ramp
'D' (downstream
bottleneck). Accordingly, we call congestion that emerges upstream of the downstream bottleneck as "downstream congestion" and congestion that emerges upstream of the upstream bottleneck as "upstream congestion". One of the non-linear effects of complex pattern transformation and interaction found in this case is the effect of intensification of downstream congestion due to upstream congestion, which is considered below.
Fig. 6. Intensification of upstream congestion due to downstream congestion. DGP (a) transforms into an GP (b). In an GP (c) the frequency of moving jam emergence increases (d). The initial flow rate in free flow on the main road upstream of the on-ramp 'D' q^own) = q i n + q ^ p )
in each of the left panels of Fig. 6 is equal to the flow rate
q(down) _ ^
nea£^ of^e
+
q^up) j
the flow rate q^ own)
flow rate q-^
p)
associated right panels of Fig. 6. However, in Figs. 6(a, c),
= 0, whereas in Figs. 6(b, d), the flow rate q^p) > 0. The equality of the
in Figs. 6(a, b)
is realized due to higher flow rate qin in free flow upstream
of the upstream bottleneck in Fig. 6 (a) in comparison with the flow rate qin in Fig. 6(b). This is also valid for Figs. 6(c, d). Depending on the flow rate q|^p) and on the congested pattern type at the downstream bottleneck, different intensification phenomena for the initial downstream congestion are found. We consider only two of them.
Transformation of DGP into GP An initial DGP at the on-ramp 'D', where only one wide moving jam emerges (Fig. 6(a)), transforms into an GP at this bottleneck where an uninterrupted sequence of wide moving jams emerges (Fig. 6(b)). After the wide moving jam in the DGP (Fig. 6(a)) emerges, the
196 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction current flow rate upstream of the on-ramp 'D' q,-nOwn:> cannot be greater than qout (Fig. l(b)): qtdown) <. q ^ ^ j]^is decrease in q^cwn) occurs because vehicles merging onto the main road from the on-ramp 'U' must slow down when they reach the wide moving jam. When the wide moving jam is between the on-ramps 'D' and 'U', the flow rate q^ p) does not lead to an increase in the flow rate q,^0™"': Due to the flow rate q["p) only the jam inflow increases. hi Fig. 6(b), an LSP is induced at the on-ramp 'U' after the wide moving jam from an DGP (downstream congestion) has reached the on-ramp 'U'. After the wide moving jam has passed the on-ramp 'U', there are no wide moving jams between the on-ramps 'D' and 'U'. For this reason, vehicles merging onto the main road from the on-ramp 'U' cause an increase in q(down) j^-g f ] o w r a t e j s m u c j j greater than q out . This leads to subsequent moving jam emergence at the on-ramp 'D', and so on: An GP is formed at the on-ramp 'D' (Fig. 6(b)). The mean period of moving jam emergence in the GP is determined by the time of wide moving jam propagation to the on-ramp 'U'. Before a wide moving jam has passed the onramp 'U' the condition q|nOwn) < qout is satisfied, and no moving jam can emerge at the given flow rate q^own) to the on-ramp 'D'.
Increase in frequency of moving jam emergence The onset of upstream congestion can lead to intensification of downstream congestion that results in an increase in the mean frequency of moving jam emergence in an initial GP at the on-ramp 'D' (Fig. 6(d)). This effect is similar to the transformation of an DGP into an GP discussed above. After the first wide moving jam has emerged in the GP (Fig. 6(c)), the current flow rate upstream of the on-ramp 'D', q^ own) , has dropped to q\^°'m) < q out . At the flow rate q^own) < q out , the frequency of moving jam emergence in the GP upstream of the on-ramp 'D' is relatively low at the chosen flow rate q^own) to the on-ramp 'D' (Fig. 6(c)). In contrast, in Fig. 6(d) after the wide moving jam has passed the on-ramp 'U', first there are no wide moving jams between the on-ramps 'D' and V. Vehicles that merge from the onramp TJ' cause an increase in the flow rate q^own) upstream of the GP. This leads to wide moving jam emergence within the GP during a considerably shorter time interval than the mean time between wide moving jams in the GP shown in Fig. 6(c). As a result, the mean frequency of wide moving jam emergence in the GP at the on-ramp 'D' increases Fig. 6(d). FEEDBACK ON-RAMP METERING hi this section, based on numerical simulations of the model considered above we compare the ALINEA method for feedback on-ramp inflow control of Papageorgiou et al. (1991) (see references in Papageorgiou and Kotsialos (2002)) whose basic idea is to maintain free flow at an on-ramp bottleneck with a "congested pattern control approach" (ANCONA for short) of
Microscopic three-phase traffic theory and applications 197 the author (see references in Kerner (2004)). In ANCONA, congestion at the on-ramp bottleneck is allowed to set in. However, in ANCONA a congested pattern that emerges at the bottleneck should not propagate upstream; rather than propagating upstream the congested pattern should be localized on the main road in a small neighborhood of the bottleneck. In ALINEA, the flow rate q^°nt) of vehicles that can merge onto the main road from the onramp is (Papageorgiou et ah, 1991) (cont)/f \_-(cont)/- t
\ + v ('f)
C29"l
One of the realizations of ANCONA is as follows (Kerner, 2004)
q
°"
Cl)
lq on2
1 fv<->(t s ) >v c o n g -
(30)
In (29) and (30), t s = Tavs, s = 0,1, 2,...; Tav = 1 min is the averaging time interval for data measured by feedback control detectors. In ALINEA, these detectors are on the main road downstream of the on-ramp bottleneck. In contrast, in ANCONA the detectors are upstream of the bottleneck. In (29), o is the occupancy, Ko is a positive given constant, o ^ ' is the optimal occupancy; oj£™'' is the occupancy measured at the detectors in ALINEA. In (30), v(det) is the speed measured by the detectors in ANCONA; vcong is a "congestion speed" that is constant; qonl and qon2 are constants (q on2 > qoni)- hi ANCONA, there is no on-ramp control as long as free flow is at the bottleneck. On-ramp inflow control is first realized only after the onset of congestion has occurred at the bottleneck. Feedback control is performed when v(det) < v cong , i.e., the average speed v(det) is equal to or drops below v cong . Then the flow rate qon°nt) is reduced via light signal operation. The decrease in this flow rate should lead to an increase in v(det) above v cong . Then greater flow rate qon°nt) is allowed via light signal operation. If under this greater flow rate q|,™nt) the onset of congestion occurs at the bottleneck once more, an incipient congested pattern begins to propagate upstream. As a result, the speed at the detector for feedback control decreases: The condition v(det) < vcong is satisfied once more. This leads to a new decrease in the flow rate qOn°nt>, and so on. To compare ALINEA with ANCONA, we chose the flow rates qin and qon related to an onramp bottleneck at which an GP appears at the bottleneck when there is no on-ramp inflow control. We find that an appropriate choice of the optimal occupancy o ^ ' in the ALINEA method leads to a suppression of GP emergence due to a decrease in the flow rate (29) in comparison with qon using light signal operation in the on-ramp lane (Fig. 7(a)). At the same
198 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction traffic demand in ANCONA, an LSP remains at the bottleneck (Fig. 7(b)), i.e., congestion occurs that is localized at the bottleneck. Nevertheless, because the speed within the LSP is not very low (about 80 km/h) the difference between the travel times on the main road in these methods cannot almost be distinguished (Fig. 7(c)). In contrast, in ALINEA the waiting time at the light signal (curve 2) is considerably longer than in ANCONA (curve 1 in Fig. 7(d)). Simulations show that the throughput in ANCONA is greater than in ALINEA. Moreover, it turns out that if short-time perturbations in the flow rate qon and/or qin occur, then ALINEA cannot prevent GP emergence at the bottleneck. This is associated with the metastability of free flow with respect to congested pattern formation, which is realized between the boundaries FS(B) and Ft(hB) in the diagram of congested patterns (Fig. 4(a)). Strictly speaking, ALINEA can maintain reliably free flow at the bottleneck if the flow rate downstream of the bottleneck is less than minimum freeway capacities of free flow at the bottleneck. This is because only in this case the probability for speed breakdown is zero, hi ANCONA, congestion is allowed to set in at the bottleneck. Therefore, greater throughputs are possible. In contrast with ALINEA, in ANCONA perturbations in the flow rate qon and/or qm cannot cause GP emergence at the bottleneck.
Fig. 7. Comparison of the ALINEA and ANCONA methods, (a, b) Vehicle speed on the main road in space and time for the ALINEA method (a) and for the ANCONA method (b). (c, d) Dependence of the travel time on the main road (c) and in the on-ramp lane (d) on time. In (c, d) curves 1 for the ANCONA method and curves 2 for the ALINEA method are shown. Thus, benefits of the ANCONA method in comparison with the ALINEA method are: 1. Achievement of greater throughput under very high traffic demand when congestion has to occur somewhere in a traffic network. In the latter case, a more homogeneous distribution of congestion among bottlenecks in the network may be possible via the application of ANCONA.
Microscopic three-phase traffic theory and applications 199 2. Considerably shorter vehicle waiting times at the light signal in the on-ramp lane(s). 3. Upstream propagation of congestion on the main road does not occur regardless of short-time perturbations in traffic flow and even if a congested pattern occurs at the bottleneck: In ANCONA, the congested pattern is spatially localized at the bottleneck. EFFECT OF AUTOMATIC CRUISE CONTROL ON CONGESTED PATTERNS AT ON-RAMP BOTTLENECK In this section, based on numerical simulations of the model considered above we discuss an influence of automatic cruise control (ACC) vehicles on traffic flow at an on-ramp bottleneck (see references in Kerner (2004)). ACC is one of the important ways of enhancing driver comfort and safety in freeway traffic (e.g., Becker et al, 1994; van Arem et al, 1996). An ACC vehicle measures the space gap gn = xln - x n - d and the relative speed vgn - v n . The ACC vehicle calculates the current time gap between the ACC vehicle and the preceding vehicle. In real ACC systems, two or more ranges of speed can be chosen where different dynamic rules are used. For simplicity we will discuss a hypothetical ACC system in which there is only one dynamic rule for the ACC vehicle in the whole possible range of vehicle speed. In most known ACC systems, at least in one of the speed ranges the dynamic behavior of the ACC vehicle can be approximately described by the well-known equation (e.g., Becker et al, 1994; van Arem et al, 1996; McDonald and Wu, 1997): a =K 1 (g n -vnT) + K 2 (v, >n - v n ) ,
(31)
where aJ,ACC' is ACC vehicle acceleration; tj A C C ) is a desired time gap of the ACC vehicle; K, and K2 are coefficients of ACC adaptation. In simulations of ACC vehicle influence on congested patterns at the bottleneck, there are vehicles that have no ACC system and ACC vehicles. Vehicles that have no ACC system move in accordance with the model described above. The ACC vehicles are randomly distributed on the road between other vehicles that have no ACC system. The ACC vehicles move in accordance with Eq. (31) where, in addition, some limitations of ACC vehicle acceleration and deceleration as well as the safe speed are used to avoid collisions. Automatic cruise control with quick dynamic adaptation To study the influence of ACC vehicles on congested patterns, we assume that at chosen qin and qon an GP occurs at the bottleneck, if there are no ACC vehicles (Fig. 8(a)). ACC vehicles can decrease the amplitude of moving jams in the initial GP if the coefficients of ACC adaptation Kj and K 2 are large enough. In this case, the ACC vehicle quickly reacts to changes in time gap and speed difference to the preceding vehicle. Moving jam suppression in the initial GP due to ACC vehicles can be seen in Figs. 8(b-d). Here, at the same qon and qin as those in Fig. 8(a) the percentage of ACC vehicles, y, in the flow rates qon and qin
200 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction increases (Figs. 8(b-d)). There is some critical y = y cr . When this critical percentage of ACC vehicles is reached, there are almost no moving jams in the congested pattern on the main road upstream of the bottleneck. If y further increases, no new moving jams occur in the congested pattern. Thus, ACC vehicles can prevent moving jam emergence.
50 100 ACC percentage Fig. 8. Influence of ACC vehicles with quick dynamic adaptation on an GP at an on-ramp bottleneck, (a-d) - Speed on the main road at different y. (e, f, g) - Discharge flow rate (e), the flow rate within the congested pattern (f) and travel time (g) as functions of y. TjACC) = 1 s, ycr = 39% , K, = K| 0 ) /max(v n ,v m m ), K<0) = 4.5 m/s 3 , K2 = 0.9 s"1, vmm = 5 m / s . At a chosen T^ ACC) , the discharge flow rate qou°ttle\ i.e., the flow rate downstream of the bottleneck is an increasing function of y (Fig. 8(e)), whereas the flow rate qcon within the congested pattern first decreases (Fig. 8(f)). This is because the speed in the pattern upstream decreases, when y increases. Thus, ACC vehicles with quick dynamic adaptation prevent moving jam emergence, i.e., a more comfortable and safer driving experience is possible. However, ACC vehicles cannot prevent or dissolve traffic congestion. They even lead to
Microscopic three-phase traffic theory and applications 201 some increase in the travel time Ta (Fig. 8(g)). T^y) has a maximum when y
further
increases. Automatic cruise control with slow dynamic adaptation Another case occurs when an ACC vehicle reacts slowly to changes in gap and speed differences to the preceding vehicle, i.e., K, and K2 in (31) are small. Then ACC vehicles can induce congestion at the bottleneck even if there is no congestion without ACC vehicles.
Fig. 9. Influence of ACC vehicles with slow dynamic adaptation on the onset of congestion at the bottleneck. Speed on the main road at different y. KJ 0 '=1 m / s 3 , K 2 = 0.18 s"1, Ycr = 9% . Other parameters are the same as those in Fig. 8. In Fig. 9(a), where there are no ACC vehicles, free flow occurs at the bottleneck at the chosen flow rates qon and q in . There is some critical y = y cr . At the same qon and q in , if ACC vehicles appear on the freeway, then at y < ycr there is no influence of ACC vehicles: Free flow remains at the bottleneck. If in contrast y > y cr , then ACC vehicles induce the onset of congestion at the bottleneck (Fig. 9(b)). As a result, an GP appears at the bottleneck. The greater y, the greater the frequency of moving jam emergence in the GP (Figs. 9(c, d)). CONCLUSIONS 1. Three-phase traffic theory can explain and predict all known reproducible empirical features of phase transitions and congested patterns at freeway bottlenecks. 2. An F—>S transition governs phase transition phenomena in free flow at bottlenecks. Wide moving jams can occur spontaneously only in synchronized flow.
202 Transportation and Traffic Theory: Flow, Dynamics and Human Interaction 3. There is a deep connection between the diagram of congested patterns at a bottleneck with freeway capacity for free flow at the bottleneck: The threshold boundary for an F—>S transition in this diagram determines an infinity of the minimum freeway capacities, whereas the boundary at which the F -» S transition occurs spontaneously during a given time interval with the probability, which is equal to 1, determines an infinity of the maximum freeway capacities. 4. There are metastable regions in the diagram of congested patterns at the bottleneck in which different types of patterns can coexist. In other words, at the same traffic demand depending on perturbations in traffic flow various patterns can occur in an initial free flow at the bottleneck. However, the lifetime of these patterns, which is associated with pattern stability, can be qualitatively different. 5. If two adjacent bottlenecks are close to one another, complex patterns and nonlinear pattern interaction effects are realized. In particular, congestion at an upstream bottleneck can intensify congestion at a downstream bottleneck. 6. Different kinds of freeway traffic control methods and vehicle assistance systems can be investigated in simulations based on three-phase traffic theory concerning their influence on the efficiency of control systems, as well as comfortable and safe driving. This is because a microscopic simulation environment based on three-phase traffic theory is in accordance with empirical spatiotemporal features of congested patterns. Thus, this is a high-value instrument in a study of different freeway traffic control strategies and traffic assistance systems before they are introduced to the market. ACKNOWLEDGEMENTS I thank Sergey Klenov for his help. REFERENCES Becker, S., M. Bork, H. T. Dorissen, G. Geduld, O. Hofmann, K. Naab, G. Nocker, P. Rieth, J. Sonntag (1994). Summary of Experience with Autonomous Intelligent Cruise Control (AICC). In: Proceedings of the 1st World Congress on Applications of Transport Telematics and Intelligent Vehicle-Highway Systems, pp. 1828-1843. Elefteriadou, L., R. P. Roess and W. R. McShane (1995). Probabilistic nature of breakdown at freeway merge junctions. Transportation Research Record 1484, 80-89. Davis L.S. (2004). Multilane simulations of traffic phases. Phys. Rev. E, 69, 016108. Gartner, N. H., C. J. Messer and A. Rathi (eds.) (1997). Special Report 165: Revised Monograph on Traffic Flow Theory (Transportation Research Board, Washington, D.C.). Gipps, P. G. (1981) A behavioral car-following model for computer simulation. Trans. Res. B. 15,105-111. Hall, F. L., V. F. Hurdle and J. H. Banks (1992). Synthesis of Recent Work on the Nature of Speed-Flow and Flow-Occupancy (or Density) Relationships on Freeways. Transportation Research Record 1365, 12-18.
Microscopic three-phase traffic theory and applications 203 Helbing, D. (2001). Traffic and Related Self-Driven Many-Particle Systems. Rev. Mod. Phys. 73,1067-1141. Helbing, D., A. Hennecke and M. Treiber (1999). Phase diagram of traffic states in the presence of inhomogeneities. Phys. Rev. Lett., 82, 4360-4363. Jiang R. and Wu, Q.-S. (2004). Spatial-temporal patterns at an isolated on-ramp in a new cellular automata model based on three-phase traffic theory. /. Phys. A, 37, 81978213. Kerner, B. S. (1998). Experimental Features of Self-Organization in Traffic Flow. Phys. Rev. Lett, 81, 3797-3800. Kerner, B. S. (2002). Empirical macroscopic features of spatial-temporal traffic patterns at highway bottlenecks. Phys. Rev. E, 65, 046138. Kerner, B. S. (2004). The Physics of Traffic (Springer, Berlin, New-York, Tokyo). Kerner, B. S. and S. L. Klenov (2002). A microscopic model for phase transitions in traffic flow. J. Phys. A: Math. Gen., 35, L31-L43. Kerner, B. S. and S. L. Klenov (2003). A microscopic theory of spatial-temporal congested traffic patterns at highway bottlenecks. Phys. Rev. E, 68, 036130. Kerner, B. S. and S. L. Klenov (2004). Probabilistic Breakdown Phenomenon at On-Ramp Bottlenecks in Three-Phase Traffic Theory. Cond-mat/0502281. E-print in http://arxiv.org/abs/cond-mat/0502281. Kerner, B. S., P. Konhauser and M. Schilke (1995). Deterministic spontaneous appearance of traffic jams in slightly inhomogeneous traffic flow. Phys. Rev. E, 51, 6243-6246. KrauB, S., P. Wagner and C. Gawron (1997). Metastable states in a microscopic model of traffic flow. Phys. Rev. E, 53, 5597-5602. Lee, H. Y., H.-W. Lee and D. Kim (1998). Origin of synchronized traffic flow on highways and its dynamic phase transitions. Phys. Rev. Lett., 81, 1130-1133. Lee, H. K., R. Barlovic, M. Schreckenberg and D. Kim (2004). Mechanical restriction versus human overreaction triggering congested traffic states. Phys. Rev. Lett., 92, 238702. Lorenz, M., L. Elefteriadou (2000). A probabilistic approach to defining freeway capacity and breakdown. Transportation Research Circular E-C018, 84-95. Persaud, B., S. Yagar and R. Brownlee (1998). Exploration of the Breakdown Phenomenon in Freeway Traffic, Transportation Research Record, 1634, 64-69. McDonald, M. and J. Wu (1997). The Integrated Impacts of Autonomous Intelligent Cruise Control on Motorway Traffic Flow. In: Proceedings of the LSC 97 Conference. (Boston, USA 1997). Papageorgiou, M., H. Hadj-Salem and J.-M. Blosseville (1991). ALINEA: a local feedback control law for on-ramp metering. Transportation Research Record, 1320, 58-64. Papageorgiou M., and A. Kotsialos (2002). Freeway ramp metering: An overview. IEEE Transactions on ITS 3, 271-281. van Arem, B., J. H. Hogema and S. A. Smulders (1996). The Impact of Autonomous Intelligent Cruise Control on Traffic flow. In: Proceedings of 3rd World Congress on Intelligent Transport Systems.
This Page is intentionally Left Blank
11
A BEHAVIOURAL APPROACH TO INSTABILITY, STOP AND GO WAVES, WIDE JAMS AND CAPACITY DROP Chris Tampere, Department of Traffic and Infrastructure Katholieke Univer