全文获取类型
收费全文 | 235篇 |
免费 | 9篇 |
专业分类
公路运输 | 57篇 |
综合类 | 53篇 |
水路运输 | 63篇 |
铁路运输 | 62篇 |
综合运输 | 9篇 |
出版年
2022年 | 6篇 |
2021年 | 5篇 |
2020年 | 6篇 |
2019年 | 1篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 3篇 |
2014年 | 20篇 |
2013年 | 11篇 |
2012年 | 12篇 |
2011年 | 19篇 |
2010年 | 20篇 |
2009年 | 22篇 |
2008年 | 8篇 |
2007年 | 26篇 |
2006年 | 22篇 |
2005年 | 22篇 |
2004年 | 6篇 |
2003年 | 6篇 |
2002年 | 5篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1996年 | 4篇 |
1994年 | 1篇 |
1993年 | 3篇 |
排序方式: 共有244条查询结果,搜索用时 62 毫秒
211.
应用简化的软化桁架模型设计钢筋混凝土短牛腿 总被引:1,自引:1,他引:0
阐述了简化的软化桁架模型的传力途径、设计步骤.用简化的软化桁架模型对钢筋混凝土短牛腿进行抗剪强度分析和设计,考虑的参数包括混凝土强度、剪跨比和水平箍筋的数量.通过对一个钢筋混凝土短牛腿的实例进行了验算,与混凝土结构设计规范(GB50010-2002)规定方法的计算结果是一致的,证明了所提出的简化的软化桁架模型的有效性、实用性. 相似文献
212.
213.
214.
215.
216.
217.
A reliability‐based traffic assignment model for multi‐modal transport network under demand uncertainty
下载免费PDF全文
![点击此处可从《先进运输杂志》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In densely populated and congested urban areas, the travel times in congested multi‐modal transport networks are generally varied and stochastic in practice. These stochastic travel times may be raised from day‐to‐day demand fluctuations and would affect travelers' route and mode choice behaviors according to their different expectations of on‐time arrival. In view of these, this paper presents a reliability‐based user equilibrium traffic assignment model for congested multi‐modal transport networks under demand uncertainty. The stochastic bus frequency due to the unstable travel time of bus route is explicitly considered. By the proposed model, travelers' route and mode choice behaviors are intensively explored. In addition, a stochastic state‐augmented multi‐modal transport network is adopted in this paper to effectively model probable transfers and non‐linear fare structures. A numerical example is given to illustrate the merits of the proposed model. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
218.
219.
220.
This study investigates the time-dependent reliable shortest path problem (TD-RSPP), which is commonly encountered in congested urban road networks. Two variants of TD-RSPP are considered in this study. The first variant is to determine the earliest arrival time and associated reliable shortest path for a given departure time, referred to as the “forward” TD-RSPP. The second problem is to determine the latest departure time and associated reliable shortest path for a given preferred arrival time, referred as the “backward” TD-RSPP. It is shown in this article that TD-RSPP is not reversible. The backward TD-RSPP cannot be solved by the algorithms designed for the forward problem using the reverse search from destination to origin. In this study, two efficient solution algorithms are proposed to solve the forward and backward TD-RSPP exactly and the optimality of proposed algorithms is rigorously proved. The proposed solution algorithms have potential applications in both advanced traveler information systems and stochastic dynamic traffic assignment models. 相似文献