{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/31143"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/31143","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Fundamental properties of Synthetic O-D Generation Formulations and Solutions","abstract":"Origin-Destination (O-D) matrices are required in order to model traffic routing behavior in networks. Direct techniques for collecting O-D information from home and roadside interviews have historically been utilized to estimate O-D tables. However, these techniques are not only very costly, labor intensive, and disruptive to trip makers, but traditionally also do not capture traffic peaking behavior, which is often required for traffic operational purposes. Consequently, more cost-effective indirect or synthetic O-D estimation techniques have been developed, and continue to be developed. They utilize readily available traffic volume counts to estimate the most likely O-D tables that may have generated the observed link counts. This thesis describes the basic formulations that have been proposed to formulate and solve the static O-D problem synthetically using link flow observations based on Maximum Entropy techniques. As is the case with many mathematical solutions to engineering problems, a number of simplifying assumptions have been made in order to solve the synthetic O-D problem. Unfortunately, the descriptions of these simplifying assumptions are often not fully described in the literature, and in some cases, these assumptions are not mentioned at all. Furthermore, the literature fails to systematically demonstrate what impact these assumptions have on the final O-D table estimate. Therefore, this thesis utilizes simple hypothetical networks to; 1. Demonstrate and compare the two main types of synthetic O-D formulations, namely the trip and volume based formulations. 2. Track the O-D estimation procedure from its initial formulation to its final formulation, demonstrating all significant assumptions that have been made and the implications of these assumptions on the final solution. 3. Demonstrate to what extent the final O-D estimation formulation remains valid when these assumptions are invoked. 4. Test the applicability of some packages which implement the various formulations and solution techniques that are available.","abstract_html":"Origin-Destination (O-D) matrices are required in order to model traffic routing behavior in networks. Direct techniques for collecting O-D information from home and roadside interviews have historically been utilized to estimate O-D tables. However, these techniques are not only very costly, labor intensive, and disruptive to trip makers, but traditionally also do not capture traffic peaking behavior, which is often required for traffic operational purposes. Consequently, more cost-effective indirect or synthetic O-D estimation techniques have been developed, and continue to be developed. They utilize readily available traffic volume counts to estimate the most likely O-D tables that may have generated the observed link counts. This thesis describes the basic formulations that have been proposed to formulate and solve the static O-D problem synthetically using link flow observations based on Maximum Entropy techniques. As is the case with many mathematical solutions to engineering problems, a number of simplifying assumptions have been made in order to solve the synthetic O-D problem. Unfortunately, the descriptions of these simplifying assumptions are often not fully described in the literature, and in some cases, these assumptions are not mentioned at all. Furthermore, the literature fails to systematically demonstrate what impact these assumptions have on the final O-D table estimate. Therefore, this thesis utilizes simple hypothetical networks to; 1. Demonstrate and compare the two main types of synthetic O-D formulations, namely the trip and volume based formulations. 2. Track the O-D estimation procedure from its initial formulation to its final formulation, demonstrating all significant assumptions that have been made and the implications of these assumptions on the final solution. 3. Demonstrate to what extent the final O-D estimation formulation remains valid when these assumptions are invoked. 4. Test the applicability of some packages which implement the various formulations and solution techniques that are available.","abstract_has_math":false,"creators":["Paramahamsan, Harinarayan"],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Civil Engineering","degree_department":"Civil Engineering","school":null,"contributors":[],"advisors":[],"committee_chairs":["Van Aerde, Michael W."],"committee_members":["Trani, Antonio A.","Rakha, Hesham A."],"year":1999,"date_issued":"1999-01-22","date_published":"1999-01-22","updated_at":"2026-07-22T22:19:22Z","subjects":["Maximum Likelihood","Maximum Entropy","O-D","Synthetic"],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-020599-151231"],"render_values":[{"text":"etd-020599-151231","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/31143","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Van Aerde, Michael W."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Trani, Antonio A.","Rakha, Hesham A."]},{"key":"dc:contributor.department","label":"Department","values":["Civil Engineering"]},{"key":"dc:creator","label":"Author","values":["Paramahamsan, Harinarayan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T20:31:32Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T20:31:32Z","1999-02-17"]},{"key":"dc:date.issued","label":"Date","values":["1999-01-22"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Civil Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Maximum Likelihood","Maximum Entropy","O-D","Synthetic"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-020599-151231"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/31143"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Origin-Destination (O-D) matrices are required in order to model traffic routing behavior in networks. Direct techniques for collecting O-D information from home and roadside interviews have historically been utilized to estimate O-D tables. However, these techniques are not only very costly, labor intensive, and disruptive to trip makers, but traditionally also do not capture traffic peaking behavior, which is often required for traffic operational purposes. Consequently, more cost-effective indirect or synthetic O-D estimation techniques have been developed, and continue to be developed. They utilize readily available traffic volume counts to estimate the most likely O-D tables that may have generated the observed link counts. This thesis describes the basic formulations that have been proposed to formulate and solve the static O-D problem synthetically using link flow observations based on Maximum Entropy techniques. As is the case with many mathematical solutions to engineering problems, a number of simplifying assumptions have been made in order to solve the synthetic O-D problem. Unfortunately, the descriptions of these simplifying assumptions are often not fully described in the literature, and in some cases, these assumptions are not mentioned at all. Furthermore, the literature fails to systematically demonstrate what impact these assumptions have on the final O-D table estimate. Therefore, this thesis utilizes simple hypothetical networks to; 1. Demonstrate and compare the two main types of synthetic O-D formulations, namely the trip and volume based formulations. 2. Track the O-D estimation procedure from its initial formulation to its final formulation, demonstrating all significant assumptions that have been made and the implications of these assumptions on the final solution. 3. Demonstrate to what extent the final O-D estimation formulation remains valid when these assumptions are invoked. 4. Test the applicability of some packages which implement the various formulations and solution techniques that are available."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:title","label":"Title","values":["Fundamental properties of Synthetic O-D Generation Formulations and Solutions"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Van Aerde, Michael W."],"dc:contributor.committeemember":["Trani, Antonio A.","Rakha, Hesham A."],"dc:contributor.department":["Civil Engineering"],"dc:creator":["Paramahamsan, Harinarayan"],"dc:date.accessioned":["2014-03-14T20:31:32Z"],"dc:date.available":["2014-03-14T20:31:32Z","1999-02-17"],"dc:date.issued":["1999-01-22"],"dc:description.abstract":["Origin-Destination (O-D) matrices are required in order to model traffic routing behavior in networks. Direct techniques for collecting O-D information from home and roadside interviews have historically been utilized to estimate O-D tables. However, these techniques are not only very costly, labor intensive, and disruptive to trip makers, but traditionally also do not capture traffic peaking behavior, which is often required for traffic operational purposes. Consequently, more cost-effective indirect or synthetic O-D estimation techniques have been developed, and continue to be developed. They utilize readily available traffic volume counts to estimate the most likely O-D tables that may have generated the observed link counts. This thesis describes the basic formulations that have been proposed to formulate and solve the static O-D problem synthetically using link flow observations based on Maximum Entropy techniques. As is the case with many mathematical solutions to engineering problems, a number of simplifying assumptions have been made in order to solve the synthetic O-D problem. Unfortunately, the descriptions of these simplifying assumptions are often not fully described in the literature, and in some cases, these assumptions are not mentioned at all. Furthermore, the literature fails to systematically demonstrate what impact these assumptions have on the final O-D table estimate. Therefore, this thesis utilizes simple hypothetical networks to; 1. Demonstrate and compare the two main types of synthetic O-D formulations, namely the trip and volume based formulations. 2. Track the O-D estimation procedure from its initial formulation to its final formulation, demonstrating all significant assumptions that have been made and the implications of these assumptions on the final solution. 3. Demonstrate to what extent the final O-D estimation formulation remains valid when these assumptions are invoked. 4. Test the applicability of some packages which implement the various formulations and solution techniques that are available."],"dc:description.degree":["Master of Science"],"dc:identifier.other":["etd-020599-151231"],"dc:identifier.uri":["http://hdl.handle.net/10919/31143"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Maximum Likelihood","Maximum Entropy","O-D","Synthetic"],"dc:title":["Fundamental properties of Synthetic O-D Generation Formulations and Solutions"],"dc:type":["Thesis"],"thesis:degree_discipline":["Civil Engineering"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:22Z"}