{"title":"基于路径求解算法的考虑排放的交通分配模型:比较与讨论","authors":"Ming-Wang Dong, W. Xiong","doi":"10.1109/ICCMS.2009.10","DOIUrl":null,"url":null,"abstract":"In this paper, we discuss a nonadditive path costs traffic assignment problem considering emission effects. Based on Venigalla's research, we put forward the traffic assignment model considering emissions at different engine operating modes. We also use two path-based algorithms, gradient projection (GP) algorithm and disaggregated simplicial decomposition (DSD) algorithm to solve the mathematic model respectively. Then, we apply the model as well as the algorithms into a real network and compare some computational characteristics of them. The results show that both GP and DSD algorithms have a rapid convergence speed than FW algorithm. The results also demonstrate that path-based algorithms can be widely used in solving large scale traffic assignment problem with nonadditive path costs.","PeriodicalId":325964,"journal":{"name":"2009 International Conference on Computer Modeling and Simulation","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Traffic Assignment Model Considering Emission Based on Path-based Solution Algorithm: Comparison and Discussion\",\"authors\":\"Ming-Wang Dong, W. Xiong\",\"doi\":\"10.1109/ICCMS.2009.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we discuss a nonadditive path costs traffic assignment problem considering emission effects. Based on Venigalla's research, we put forward the traffic assignment model considering emissions at different engine operating modes. We also use two path-based algorithms, gradient projection (GP) algorithm and disaggregated simplicial decomposition (DSD) algorithm to solve the mathematic model respectively. Then, we apply the model as well as the algorithms into a real network and compare some computational characteristics of them. The results show that both GP and DSD algorithms have a rapid convergence speed than FW algorithm. The results also demonstrate that path-based algorithms can be widely used in solving large scale traffic assignment problem with nonadditive path costs.\",\"PeriodicalId\":325964,\"journal\":{\"name\":\"2009 International Conference on Computer Modeling and Simulation\",\"volume\":\"122 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computer Modeling and Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCMS.2009.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computer Modeling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCMS.2009.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Traffic Assignment Model Considering Emission Based on Path-based Solution Algorithm: Comparison and Discussion
In this paper, we discuss a nonadditive path costs traffic assignment problem considering emission effects. Based on Venigalla's research, we put forward the traffic assignment model considering emissions at different engine operating modes. We also use two path-based algorithms, gradient projection (GP) algorithm and disaggregated simplicial decomposition (DSD) algorithm to solve the mathematic model respectively. Then, we apply the model as well as the algorithms into a real network and compare some computational characteristics of them. The results show that both GP and DSD algorithms have a rapid convergence speed than FW algorithm. The results also demonstrate that path-based algorithms can be widely used in solving large scale traffic assignment problem with nonadditive path costs.