Title page for ETD etd-62398-223925


Type of Document Master's Thesis
Author Lei, Peng
Author's Email Address peng.lei@vt.edu
URN etd-62398-223925
Title A Linear Programming Method for Synthesizing Origin-Destination (O-D) Trip Tables from Traffic Counts for Inconsistent Systems
Degree Master of Science
Department Industrial and Systems Engineering
Advisory Committee
Advisor Name Title
Sherali, Hanif D. Committee Chair
Kobza, John E. Committee Member
Loganathan, G. V. Committee Member
Keywords
  • origin-destination (OD) table
  • network flow
  • linear programming
  • equillibrium
  • object-oriented analysis
Date of Defense 1998-07-17
Availability unrestricted
Abstract
Origin-Destination (O-D) trip tables represent the demand-supply information of each directed zonal-pair in a given region during a given period of time. The effort of this research is to develop a linear programming methodology for estimating O-D trip tables based on observed link volumes. In order to emphasize the nature of uncertainty in the data and in the problem, the developed model permits the user's knowledge of path travel time to vary within a band-width of values, and accordingly modifies the user-optimality principle. The data on the observed flows might also not be complete and need not be perfectly matched. In addition, a prior trip table could also be specified in order to guide the updating process via the model solution. To avoid excessive computational demands required by a total numeration of all possible paths between each O-D pair, a Column Generation Algorithm (CGA) is adopted to exploit the special structures of the model. Based on the known capacity of each link, a simple formula is suggested to calculate the cost for the links having unknown volumes. An indexed cost is introduced to avoid the consideration of unnecessary passing-through-zone paths, and an algorithm for solving the corresponding minimum-cost-path problem is developed. General principles on the design of an object-oriented code are presented, and some useful programming techniques are suggested for this special problem. Some test results on the related models are presented and compared, and different sensitivity analyses are performed based on different scenarios. Finally, several research topics are recommended for future research.

Files
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  Ch1.pdf 14.71 Kb 00:00:04 00:00:02 00:00:01 < 00:00:01 < 00:00:01
  Ch2.pdf 51.48 Kb 00:00:14 00:00:07 00:00:06 00:00:03 < 00:00:01
  Ch3.pdf 110.09 Kb 00:00:30 00:00:15 00:00:13 00:00:06 < 00:00:01
  Ch4.pdf 119.77 Kb 00:00:33 00:00:17 00:00:14 00:00:07 < 00:00:01
  Ch5.pdf 49.95 Kb 00:00:13 00:00:07 00:00:06 00:00:03 < 00:00:01
  CH6.PDF 193.18 Kb 00:00:53 00:00:27 00:00:24 00:00:12 00:00:01
  Ch7.pdf 12.40 Kb 00:00:03 00:00:01 00:00:01 < 00:00:01 < 00:00:01
  HEADER.PDF 35.37 Kb 00:00:09 00:00:05 00:00:04 00:00:02 < 00:00:01
  Reff.pdf 20.15 Kb 00:00:05 00:00:02 00:00:02 00:00:01 < 00:00:01
  Vita.pdf 3.52 Kb < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.