基于路径流量的交通分配方法－DSD算法

shoregh

[这个贴子最后由shoregh在 2006/05/29 11:10am 第 1 次编辑]

目前网络交通分配算法主要都是基于路段流量的，其实也可以从路径流量入手，1992年的transportation science上就有一篇文章对此做了介绍simplicial decomposition with disaddregated representation for the traffic assignment problem，简称DSD算法。虽然1992年改算法就已出现，现在却研究甚少。
现贴上这篇文章（不知道有没有贴上，或者去邮箱ISTTT2005@126.com,123456），大家探讨探讨。

shoregh

traffic

Dear Sir/Madam,
Based on the prior literature, we can find that many papers have studied this topic, i.e., the solution algotithm of traffic assignment. In general, there are link-based and path-based algorithms. They includes F-W algorithm, DSD, and projection algorithm etc. I think that the sentence"现在却研究甚少" is wrong. In fact, there exist still many researchers who are engaged in it now, such Chen, A., Lee, D.H. and Chen H.K.
We can find these algorithms have been compared in dynamic and static environments.

shoregh

梯度投影法

shoregh

TRB99年的一篇文章，对比DSD和梯度投影法的
Path-based algorithm for large scale traffic equilibrium problems--- a comparison between DSD and GP

wt428

谢谢楼上传的东西，我也是东大的，今年也选了程老师的课。不知你的第一篇文章是在哪里找的，就是simplicial decomposition with disaddregated representation for the traffic assignment problem.是在图书馆的数据库里吗？谢谢。有空交流交流心得。

shoregh

东大图书馆的EBSCO数据库里面有transportation science ，我也找了很久没有找到，还是任老师告诉我的，不过好像下载很麻烦，速度也慢，这个数据库不如Elsevier Science(全文)好用。呵呵，以后多交流。

lovemyangel

楼主是东南大学的，如何联系？

kikihappy

呵呵，我也是刚接触交通工程不久
谢谢楼上的慷慨相助了