liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A Heuristic for the Estimation of Time-Dependent Origin Origin–Destination Matrices from Traffic Counts
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan. (Trafiksystem)
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan. (Trafiksystem)ORCID-id: 0000-0001-6880-8549
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan. (Trafiksystem)ORCID-id: 0000-0001-6405-5914
2007 (engelsk)Inngår i: Nordic MPS ’04, Norrköping, Sweden, October 21–23, 2004 and The 10th Jubilee Meeting of the EURO Working Group on Transportation, Poznan, Poland, September 13–16, 2005 and Transportforum, Linköping, Sweden, January 11–12, 2006, 2007Konferansepaper, Publicerat paper (Fagfellevurdert)
sted, utgiver, år, opplag, sider
2007.
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-14468OAI: oai:DiVA.org:liu-14468DiVA, id: diva2:23555
Konferanse
The 10th Jubilee Meeting of the EURO Working Group on Transportation, Poznan, Poland, September 13–16, 2005
Tilgjengelig fra: 2007-06-04 Laget: 2007-06-04 Sist oppdatert: 2018-08-23
Inngår i avhandling
1. The Origin-Destination Matrix Estimation Problem: Analysis and Computations
Åpne denne publikasjonen i ny fane eller vindu >>The Origin-Destination Matrix Estimation Problem: Analysis and Computations
2007 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

For most kind of analyses in the field of traffic planning, there is a need for origin--destination (OD) matrices, which specify the travel demands between the origin and destination nodes in the network. This thesis concerns the OD-matrix estimation problem, that is, the calculation of OD-matrices using observed link flows. Both time-independent and time-dependent models are considered, and we also study the placement of link flow detectors.

Many methods have been suggested for OD-matrix estimation in time-independent models, which describe an average traffic situation. We assume a user equilibrium to hold for the link flows in the network and recognize a bilevel structure of the estimation problem. A descent heuristic is proposed, in which special attention is given to the issue of calculating the change of a link flow with respect to a change of the travel demand in a certain pair of origin and destination nodes.

When a time-dimension is considered, the estimation problem becomes more complex. Besides the problem of distributing the travel demand onto routes, the flow propagation in time and space must also be handled. The time-dependent OD-matrix estimation problem is the subject for two studies. The first is a case study, where the conventional estimation technique is improved through introducing pre-adjustment schemes, which exploit the structure of the information contained in the OD-matrix and the link flow observations. In the second study, an algorithm for time-independent estimation is extended to the time-dependent case and tested for a network from Stockholm, Sweden.

Finally, we study the underlying problem of finding those links where traffic flow observations are to be performed, in order to ensure the best possible quality of the estimated OD-matrix. There are different ways of quantifying a common goal to cover as much traffic as possible, and we create an experimental framework in which they can be evaluated. Presupposing that consistent flow observations from all the links in the network yields the best estimate of the OD-matrix, the lack of observations from some links results in a relaxation of the estimation problem, and a poorer estimate. We formulate the problem to place link flow detectors as to achieve the least relaxation with a limited number of detectors.

sted, utgiver, år, opplag, sider
Institutionen för teknik och naturvetenskap, 2007. s. 40
Serie
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1102
Emneord
Traffic modelling, Travel demand, Origin--Destination matrix, Traffic flow observation, Detector allocation, Estimation., OD-matris, Trafikflödesobservation, Detektorallokering, Skattning, Trafikmodellering, Reseefterfrågan
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-8859 (URN)978-91-85831-95-1 (ISBN)
Disputas
2007-06-15, K2, Kåkenhus, Linköpings universitet, Campus Norrköping, Norrköping, 13:15 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2007-06-04 Laget: 2007-06-04 Sist oppdatert: 2018-08-23

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Link to Ph.D. thesis

Personposter BETA

Lundgren, Jan T.Peterson, AndersRydergren, Clas

Søk i DiVA

Av forfatter/redaktør
Lundgren, Jan T.Peterson, AndersRydergren, Clas
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric

urn-nbn
Totalt: 140 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf