{"title":"一种求解I/O和O/D表的求解方法","authors":"A. Bakó, István Szüts, P. Földesi","doi":"10.1109/INES.2010.5483850","DOIUrl":null,"url":null,"abstract":"The Origin-Destination (O/D) matrix is intensively used in long term traffic network planning. The matrix is used for forecasting the future traffic between the sections and for distributing the traffic. Several methods are known as a solution for this problem. In this paper it is shown that all these methods can be solved by the RAS algorithm. Furthermore we present the Input-Output table problem which also can be solved by this RAS method.","PeriodicalId":118326,"journal":{"name":"2010 IEEE 14th International Conference on Intelligent Engineering Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A solution method for solving I/O and O/D tables\",\"authors\":\"A. Bakó, István Szüts, P. Földesi\",\"doi\":\"10.1109/INES.2010.5483850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Origin-Destination (O/D) matrix is intensively used in long term traffic network planning. The matrix is used for forecasting the future traffic between the sections and for distributing the traffic. Several methods are known as a solution for this problem. In this paper it is shown that all these methods can be solved by the RAS algorithm. Furthermore we present the Input-Output table problem which also can be solved by this RAS method.\",\"PeriodicalId\":118326,\"journal\":{\"name\":\"2010 IEEE 14th International Conference on Intelligent Engineering Systems\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 14th International Conference on Intelligent Engineering Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INES.2010.5483850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 14th International Conference on Intelligent Engineering Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INES.2010.5483850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Origin-Destination (O/D) matrix is intensively used in long term traffic network planning. The matrix is used for forecasting the future traffic between the sections and for distributing the traffic. Several methods are known as a solution for this problem. In this paper it is shown that all these methods can be solved by the RAS algorithm. Furthermore we present the Input-Output table problem which also can be solved by this RAS method.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
