{"title":"拥挤交通网络中路由策略的集中与分散计算","authors":"H. Ng, U. Ozguner","doi":"10.1109/CDC.1984.272265","DOIUrl":null,"url":null,"abstract":"The computational problems associated with routing of traffic in congested networks is analyzed. An optimal and a suboptimal, but partially decentralized approach is presented. In the decentralized case infrequent updates of relative costs are allowed to give aggregate information about congestion downstream, and optimal controls are re-calculated with the horizon pushed-back at each update time.","PeriodicalId":269680,"journal":{"name":"The 23rd IEEE Conference on Decision and Control","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Centralized and decentralized computation of routing startegies in congested traffic networks\",\"authors\":\"H. Ng, U. Ozguner\",\"doi\":\"10.1109/CDC.1984.272265\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The computational problems associated with routing of traffic in congested networks is analyzed. An optimal and a suboptimal, but partially decentralized approach is presented. In the decentralized case infrequent updates of relative costs are allowed to give aggregate information about congestion downstream, and optimal controls are re-calculated with the horizon pushed-back at each update time.\",\"PeriodicalId\":269680,\"journal\":{\"name\":\"The 23rd IEEE Conference on Decision and Control\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 23rd IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1984.272265\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 23rd IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1984.272265","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Centralized and decentralized computation of routing startegies in congested traffic networks
The computational problems associated with routing of traffic in congested networks is analyzed. An optimal and a suboptimal, but partially decentralized approach is presented. In the decentralized case infrequent updates of relative costs are allowed to give aggregate information about congestion downstream, and optimal controls are re-calculated with the horizon pushed-back at each update time.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
