The methodology of Q-analysis is motivated by the need for understanding and control in the planning and design of complex human—physical systems. It is based on a fundamental distinction between relational structure (backcloth) and dynamic system behaviour represented by numerical functions defined on that structure (traffic). A dynamic computer simulation of road-traffic systems is described in the context of a new hierarchical representation. This is intended as a research tool for investigating backcloth—traffic mechanisms in a controlled laboratory environment.
Get full access to this article
View all access options for this article.
References
1.
• References of interest not cited in text.
2.
AshworthR, 1968, “A note on the selection of gap acceptance criteria for traffic simulation studies”Transportation Research2171–175
3.
AtkinR H, 1972, “From cohomology in physics to q-connectivity in social science”International Journal of Man—Machine Studies4139–167
4.
AtkinR H, 1974Mathematical Structure in Human Affairs (Heinemann Educational Books, London)
5.
AtkinR H, 1977Combinatorial Connectivities in Social Systems (Birkhäuser, Basel)
6.
• Ben-AkivaCynaMPalmaA, 1984, “Dynamic model of peak period congestion”Transportation Research18B339–355
7.
BirkhofG, 1940Lattice theoryAmerican Mathematical Society Colloquium Publications, Providence, RI
8.
BlumA E, 1970, “A general purpose digital traffic simulator”Simulation149–25
9.
BrownF EJohnsonJ H, 1985, “An interactive computer model of urban development: The rules governing the morphology of mediaeval London”Environment and Planning B: Planning and Design12377–400
10.
BruggermanJ M, 1971, “Network flow simulation for urban traffic control system”Peat Marwick and Co., General Applied Science Laboratories Inc., Technical Information Service, Springfield, VA
11.
ChinH C, 1985, “SIMRO: A model to simulate traffic at roundabouts”Traffic Engineering and Control26109–113
12.
DijkstraE W, 1959, “A note on two problems in connection with graphs”Numerical Math1269–271
13.
DowkerC H, 1952, “Homology groups of relations”Annals of Math5684–95
14.
EarlC FJohnsonJ H, 1981, “Graph theory and Q-analysis”Environment and Planning B8367–392
15.
GasparJGouldP, 1981, “The Cova da Beira: An applied structural analysis of agriculture and communication” in Space and Time in Geography Ed. PredA (Gleerup, Lund) pp 183–214
16.
GippsP G, 1981, “A behavioural car-following model for computer simulation”Transportation Research15B102–111
17.
GouldPJohnsonJ HChapmanG P, 1984The Structure of Television (Pion, London)
18.
GriffithsH E, 1983, “Using mathematics to simplify Q-analysis”Environment and Planning B: Planning and Design10403–422
19.
HaightF, 1963Mathematical Theories of Traffic Flow (Academic Press, New York)
20.
HallM DVan VlietDWillumsenL G, 1980, “SATURN—a simulation—assignment model for the evaluation of traffic management schemes”Traffic Engineering and Control21168–176
21.
HoY-S, 1982, “The planning process: Structure of verbal descriptions”Environment and Planning B9397–420
22.
HollisE M, 1979, “A program to model flows, queues and delays at a roundabout”Traffic Engineering and Control20163–165
23.
HsuY SMunjalP K, 1974, “Freeway digital simulation models”Highway Research Recordnumber 509, 29–41
24.
HudsonR, 1976, “Linking studies of the individual with models of aggregate behavour: An empirical example”Transactions of The Institute of British Geographers1159–173
25.
IshidaYAdachiNTokumaruH K, 1985, “A topological approach to failure diagnosis of large scale systems”IEEE Transactions on Systems, Man and CyberneticsSMC-15327–333
26.
JohnsonJ H, 1976, “The Q-analysis of road intersections”International Journal of Man—Machine Studies8531–548
27.
JohnsonJ H, 1981, “The Q-analysis of road systems”Environment and Planning B8141–189
28.
JohnsonJ H, 1982, “q-transmission in simplicial complexes”International Journal of Man—Machine Studies16351–377
29.
JohnsonJ H, 1983a, “Hierarchical set definition by Q-analysis: The hierarchical backcloth”International Journal of Man—Machine Studies18337–359
30.
JohnsonJ H, 1983b, “Q-analysis: A theory of stars”Environment and Planning B10457–469
31.
JohnsonJ H, 1984, “Latent structure in road systems”Transportation Research18B87–100
32.
JohnsonJ H, 1986a, “A theory of stars in complex system” in Complexity, Language and Life: Mathematical Approaches Eds CastiJKarlqvistA (Springer, Berlin) forthcoming
33.
JohnsonJ H, 1986b, “Stars, rectangles, lattices: A new perspective on Q-analysis”International Journal of Man—Machine Studies24293–299
34.
JohnsonJ HSeidmanS, 1986, 13–4, “A hierarchical minimum path algorithm”Centre for Configurationl Studies, The Open University, Milton Keynes (in preparation)
35.
KatzJ H, 1963, “Simulation of a traffic network”Communications of the ACM6480–486
36.
• KhasnabisSHeimbachC L, 1977, “Traffic simulation as highway design tool”Proceedings of the American Society of Civil Engineers, Transportation Journal103369–384
37.
LeonardD RToughJ BBaguleyP C, 1978, “CONTRAM: a traffic assignment model for predicting flows and queues during peak periods” Report 841, Transport and Road Research Laboratory, Crowthorne, Berks
38.
LiebermanE B, 1972, “Simulation of corridor traffic: The SCOT model”Highway Research Recordnumber 409, 34–45
39.
LiebermanE BWorralR DBruggermanJ M, 1972, “Logical design and demonstration of UTCS-1 network simulation model”Highway Research Recordnumber 409, 46–56
40.
• LighthillJ MWhithamG B, 1955, “On kinematic waves: II. Theory of traffic flow on long crowded roads”Proceedings of the Royal Society, Series A229317–345
RobertsonD I, 1969, “TRANSYT: a traffic network study tool” report LR 253, Transport and Road Research Laboratory, Crowthorne, Berks
48.
• RumseyA FHartleyM G, 1972, “Simulation of a pair of intersections”Traffic Engineering and Control13522–523
49.
• SakaiTNagaoM, 1969, “Simulation of traffic flows in a network”Communications of the ACM12311–318
50.
• SaleebSHartleyM G, 1968, “Simulation of traffic behaviour through a linked pair of intersections”Transportation Research251–61
51.
• SalterR J, 1971, “A simulation of traffic flow at priority intersections”Journal of the Institution of Municipal Engineers98239–248
52.
SalterR J, 1974Highway Traffic Analysis and Design (Macmillan, London)
53.
SchumateR PDirksenJ B, 1965, “A simulation system for study of traffic flow behaviour”Highway Research Recordnumber 72, 19–39
54.
SeddonP A, 1972, “A program for simulating the dispersal of platoons of road traffic”Simulation1881–90
55.
SeidmanS B, 1981, “Structures induced by collections of subsets: A hypergraph approach”Mathematical Social Sciences1381–396
56.
SeidmanS B, 1986, 13–4, “Combinatorial models for social systems” paper given at the 11th International Conference on Cybernetics, Namur, Belgium, 25–29 August; copy obtainable from the author at Department of Computer Science, George Mason University, Fairfax, VA
57.
SkabardonisA, 1985, “Modelling traffic behaviour at grade-separated interchanges”Traffic Engineering and Control26411–415
58.
TannerJ C, 1962, “A theoretical analysis of delays of an uncontrolled intersection”Biometrika49163–170
59.
TannerJ C, 1967, “The capacity of an uncontrolled intersection”Biometrika54657–658
60.
Transport and Road Research Laboratory, 1966, “Traffic signals” TP56, Transport and Road Research Laboratory, Crowthorne, Berks
61.
• VararhelyiB, 1976, “Stochastic simulation of the traffic of an uncontrolled road intersection”Transportation Research10255–261
• WardropJ G, 1952, “Some theoretical aspects of road traffic research”Proceedings of the Institute of Civil Engineers, Part II pp 325–378
64.
• WicksD ALiebermanE B, 1980Development and Testing of INTRAS, a Microscopic Freeway Simulation Model4 volumes. National Technical Information Service, Springfield, VA
