HEURISTIC ALGORITHMS FOR THE BILEVEL ORIGIN-DESTINATION MATRIX ESTIMATION PROBLEM

Recently, a bilevel programming approach has been used for estimation of origin-destination (O-D) matrix in congested networks. This approach integrates the conventional generalized least squares estimation model and the standard netork equilibrium model into one process. The researchers extend this approach and develop a more general model and efficient heuristic algorithms to handle more realistic situation where link flow interaction cannot be ignored. The extended model is formulated in the form of a bilevel programming problem with variational inequality constraints. The upper-level problem seeks to minimize the sum of error measurements in traffic counts and O-D matrices, while the lower-level problem represents a network equilibrium problem formulated as variational inequalities, which guarantees that the estimated O-D matrix and corresponding link flows satisfy the network equilibrium conditions. Two computational techniques are presented for solving the bilevel O-D matrix estimation model. One is a heuristic iterative algorithm between traffic assignment and O-D matrix estimation and the other one is a sensitivity analysis based heuristic algorithm.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/01912615
• Corporate Authors:

  Elsevier

  The Boulevard, Langford Lane
  Kidlington, Oxford  United Kingdom  OX5 1GB
• Authors:
  • Yang, Huajie
• Publication Date: 1995-8

Language

• English

Media Info

• Pagination: p. 231-242
• Serial:
  • Transportation Research Part B: Methodological
  • Volume: 29
  • Issue Number: 4
  • Publisher: Elsevier
  • ISSN: 0191-2615
  • Serial URL: http://www.sciencedirect.com/science/journal/01912615

Subject/Index Terms

• TRT Terms: Algorithms; Least squares method; Matrices (Mathematics); Origin and destination; Traffic counts; Traffic estimation
• Subject Areas: Highways; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00711476
• Record Type: Publication
• Files: TRIS, ATRI
• Created Date: Sep 25 1995 12:00AM