.png){kind=icon}
返回
Two improved numerical algorithms for the continuous dynamic network loading problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0191-2615(02)00006-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The purpose of this paper is to present two improved numerical algorithms for the continuous dynamic network loading problem. These methods, which may be considered to be event-based simulations, represent a major improvement over the functional equations approaches which was developed by Wu et al. [Transportation Research 32 (1998) 173] and the solution method given by Xu et al. [Transportation Science 33 (1999) 341]. Computational results are given for the loading methods and their use as a subproblem in an algorithm for dynamic traffic assignment. (C) 2002 Elsevier Science Ltd. All rights reserved.
Keyword:
FORMULATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.6K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Order allocation for multi-item sourcing with supply disruptions in shipment quality and delivery
PREAI
分享收藏 没有更多内容
没有更多内容