{"title":"有限容量和回溢的连续动态网络平衡问题的数值解析模型","authors":"J. M. Rubio-Ardanaz, J. Wu, M. Florian","doi":"10.1109/ITSC.2001.948666","DOIUrl":null,"url":null,"abstract":"The analytical approaches to dynamic traffic assignment did not consider until now the limited capacity of arcs. In this paper a model and an algorithm are developed for this problem. The method was coded and computational results were obtained.","PeriodicalId":173372,"journal":{"name":"ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)","volume":"379 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A numerical analytical model for the continuous dynamic network equilibrium problem with limited capacity and spill back\",\"authors\":\"J. M. Rubio-Ardanaz, J. Wu, M. Florian\",\"doi\":\"10.1109/ITSC.2001.948666\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The analytical approaches to dynamic traffic assignment did not consider until now the limited capacity of arcs. In this paper a model and an algorithm are developed for this problem. The method was coded and computational results were obtained.\",\"PeriodicalId\":173372,\"journal\":{\"name\":\"ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)\",\"volume\":\"379 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITSC.2001.948666\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2001.948666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A numerical analytical model for the continuous dynamic network equilibrium problem with limited capacity and spill back
The analytical approaches to dynamic traffic assignment did not consider until now the limited capacity of arcs. In this paper a model and an algorithm are developed for this problem. The method was coded and computational results were obtained.