全文获取类型
收费全文 | 744篇 |
免费 | 37篇 |
专业分类
公路运输 | 130篇 |
综合类 | 298篇 |
水路运输 | 227篇 |
铁路运输 | 99篇 |
综合运输 | 27篇 |
出版年
2024年 | 3篇 |
2023年 | 5篇 |
2022年 | 13篇 |
2021年 | 14篇 |
2020年 | 28篇 |
2019年 | 15篇 |
2018年 | 8篇 |
2017年 | 19篇 |
2016年 | 19篇 |
2015年 | 32篇 |
2014年 | 41篇 |
2013年 | 29篇 |
2012年 | 76篇 |
2011年 | 58篇 |
2010年 | 55篇 |
2009年 | 55篇 |
2008年 | 53篇 |
2007年 | 74篇 |
2006年 | 64篇 |
2005年 | 36篇 |
2004年 | 17篇 |
2003年 | 21篇 |
2002年 | 11篇 |
2001年 | 10篇 |
2000年 | 7篇 |
1999年 | 11篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1994年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有781条查询结果,搜索用时 0 毫秒
1.
2.
3.
4.
5.
This study investigates the important problem of determining a reliable path in a stochastic network with correlated link travel times. First, the distribution of path travel time is quantified by using trip records from GPS probe vehicles. Second, the spatial correlation of link travel time is explicitly considered by using a correlation coefficient matrix, which is incorporated into the α-reliable path problem by Cholesky decomposition. Third, the Lagrangian relaxation based framework is used to handle the α-reliable path problem, by which the intractable problem with a non-linear and non-additive structure can be decomposed into several easy-to-solve problems. Finally, the path-finding performance of this approach is tested on a real-world network. The results show that 15 iterations of calculation can yield a small relative gap between upper and lower bounds of the optimal solution and the average running time is about 5 s for most OD settings. The applicability of α-reliable path finding is validated by a case study. 相似文献
6.
Traffic metering offers great potential to reduce congestion and enhance network performance in oversaturated urban street networks. This paper presents an optimization program for dynamic traffic metering in urban street networks based on the Cell Transmission Model (CTM). We have formulated the problem as a Mixed-Integer Linear Program (MILP) capable of metering traffic at network gates with given signal timing parameters at signalized intersections. Due to the complexities of the MILP model, we have developed a novel and efficient solution approach that solves the problem by converting the MILP to a linear program and several CTM simulation runs. The solution algorithm is applied to two case studies under different conditions. The proposed solution technique finds solutions that have a maximum gap of 1% of the true optimal solution and guarantee the maximum throughput by keeping some vehicles at network gates and only allowing enough vehicles to enter the network to prevent gridlocks. This is confirmed by comparing the case studies with and without traffic metering. The results in an adapted real-world case study network show that traffic metering can increase network throughput by 4.9–38.9% and enhance network performance. 相似文献
7.
This paper generalizes and extends classical traffic assignment models to characterize the statistical features of Origin-Destination (O-D) demands, link/path flow and link/path costs, all of which vary from day to day. The generalized statistical traffic assignment (GESTA) model has a clear multi-level variance structure. Flow variance is analytically decomposed into three sources, O-D demands, route choices and measurement errors. Consequently, optimal decisions on roadway design, maintenance, operations and planning can be made using estimated probability distributions of link/path flow and system performance. The statistical equilibrium in GESTA is mathematically defined. Its multi-level statistical structure well fits large-scale data mining techniques. The embedded route choice model is consistent with the settings of O-D demands considering link costs that vary from day to day. We propose a Method of Successive Averages (MSA) based solution algorithm to solve for GESTA. Its convergence and computational complexity are analyzed. Three example networks including a large-scale network are solved to provide insights for decision making and to demonstrate computational efficiency. 相似文献
8.
Outlier Rejecting Multirate Model for State Estimation 总被引:1,自引:1,他引:0
IntroductionMeasured data is often contaminated by noisein state estimation.Kalman filter is a powerfultool for signal extracting.It is especially efficientin estimating spatially inhomogeneous signal whenthe noise is Gaussian.Due to process noise or non-stationary environment,the measured data is usu-ally corrupted by outliers.The performance is de-graded seriously.Generally,there are two kinds ofapproaches to handle this problem.Outlier can bedetected based on renovation[1],then be replace… 相似文献
9.
《Maritime Policy and Management》2012,39(8):957-966
ABSTRACTMaritime shipping necessitates flexible and cost-effective port access worldwide through the global shipping network. This paper presents an efficient method to identify major port communities, and analyses the network connectivity of the global shipping network based on community structure. The global shipping network is represented by a signless Laplacian matrix which can be decomposed to generate its eigenvectors and corresponding eigenvalues. The largest gaps between the eigenvalues were then used to determine the optimal number of communities within the network. The eigenvalue decomposition method offers the advantage of detecting port communities without relying on a priori assumption about the number of communities and the size of each community. By applying this method to a dataset collected from seven world leading liner shipping companies, we found that the ports are clustered into three communities in the global container shipping network, which is consistent with the major container trade routes. The sparse linkages between port communities indicate where access is relatively poor. 相似文献
10.
基于小波和粒子群算法的HEV行驶状况辨识方法研究 总被引:1,自引:0,他引:1
针对混合动力汽车(HEV)行驶状况(道路坡度和整车载荷)变化难以有效识别,导致驱动系统控制策略不能有效满足驾驶员意图问题,以混联式HEV为研究对象,提出了基于小波滤波和粒子群算法的HEV行驶状况辨识方法。首先建立了汽车行驶状况辨识模型,采用最小二乘法确立了优化目标函数,其次研究了基于小波滤波和粒子群算法的HEV行驶状况辨识原理,最后进行了行驶状况粒子群智能算法辨识试验。在采集实车数据的基础上,对实车数据进行小波滤波,并运用行驶状况辨识方法对道路坡度和整车载荷进行了辨识,并对辨识结果进行小波滤波,结果表明,试验工况下整车载荷辨识的相对误差绝对平均值为2.71%,道路坡度辨识的相对误差绝对平均值为3.85%,验证了所提出方法的有效性。 相似文献