首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2493篇
  免费   135篇
公路运输   534篇
综合类   1028篇
水路运输   378篇
铁路运输   310篇
综合运输   378篇
  2024年   5篇
  2023年   14篇
  2022年   33篇
  2021年   50篇
  2020年   71篇
  2019年   60篇
  2018年   86篇
  2017年   84篇
  2016年   136篇
  2015年   130篇
  2014年   216篇
  2013年   166篇
  2012年   187篇
  2011年   202篇
  2010年   141篇
  2009年   164篇
  2008年   145篇
  2007年   181篇
  2006年   160篇
  2005年   99篇
  2004年   56篇
  2003年   38篇
  2002年   31篇
  2001年   58篇
  2000年   17篇
  1999年   23篇
  1998年   8篇
  1997年   16篇
  1996年   8篇
  1995年   3篇
  1994年   12篇
  1993年   6篇
  1992年   5篇
  1991年   3篇
  1990年   5篇
  1989年   2篇
  1988年   5篇
  1986年   1篇
  1984年   1篇
排序方式: 共有2628条查询结果,搜索用时 93 毫秒
831.
为了解决传统匝道控制车流汇入时车辆需要减速至停止,从而造成延误时间过长的问题,提出了一种智能网联车环境下的高速匝道汇入车辆轨迹优化的两阶段优化模型,其中,第1 阶段优化车辆进入匝道口的时序;第2 阶段基于第1 阶段的最优时序,优化车辆轨迹. 根据所构建的模型设计了一种启发式算法优化车辆通过匝道冲突区域的时序,然后结合 GPOPS工具优化车辆的轨迹.为了验证所提出方法的有效性,将所提出的方法应用到20 min 随机到达的车流,进行仿真实验.实验结果表明,与先进先出的方法相比,本文所提出的方法能够使总延误减少59.7%,总油耗减少10.5%,说明该方法能够实现车辆以较高的速度通过匝道冲突区域,有效地减少了车辆汇入延误,同时也节约了油耗.  相似文献   
832.
针对复杂供输机构非平衡监测数据导致性能退化数据不足的问题,提出一种基于时间序列数据扩增的供输机构性能退化程度评估方法.在滤波算法处理实测数据基础上,利用动态时间规整算法(DTW)扩增性能退化阶段运动加速度参数,并将扩增数据与理论计算值作比较.实装试验结果表明:本文所提方法能够有效解决供输机构监测数据不平衡的问题.  相似文献   
833.
介绍了符号时间序列分析中的直方图、Shannon熵和高阶矩等,结合排放的体积百分数,对TOYOTA2500汽油机瞬态排放中的CO进行了分析.在节气门匀速变化时和匀加速变化时,比较速度值不同时的瞬态排放质量.  相似文献   
834.
首先阐述了交通运输网络可靠性研究的意义,并介绍了连通可靠性,出行时间可靠性,通行能力可靠性和出行需求满意可靠性等的基本概念,紧接着简述了国内外有关交通运输网络可靠性的研究概况,指出了交通运输网络可靠性研究的关键技术,最后探讨了交通运输网络可靠性研究的一些未来发展方向.  相似文献   
835.
结合理论与实践,全面论述了变频器的合理选择与使用方面的有关问题,包括变频器容量与型式的选择,使用频率与起停时间的设置,以及和其它调速方法的结合.  相似文献   
836.
主要介绍物流安全库存确定的新方法-系统动力学方法,建立安全库存系统动力学模型,对该模型进行运行及结果分析.  相似文献   
837.
A schedule consisting of an appropriate arrival time at each time control point can ensure reliable transport services. This paper develops a novel time control point strategy coupled with transfer coordination for solving a multi‐objective schedule design problem to improve schedule adherence and reduce intermodal transfer disutility. The problem is formulated using a robust mixed‐integer nonlinear programming model. The mixed‐integer nonlinear programming model is equivalently transformed into a robust mixed‐integer linear programming model, which is then approximated by a deterministic mixed‐integer linear programming model through Monte Carlo simulation. Thus, the optimal scheduled arrival time at each time control point can be precisely obtained using cplex . Numerical experiments based on three bus lines and the mass rapid transit system in Singapore are presented, and the results show that the schedule determined using the developed model is able to provide not only reliable bus service but also a smooth transfer experience for passengers. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   
838.
This paper estimates the traffic volume and travel time effects of the road congestion pricing implemented on the San Francisco-Oakland Bay Bridge. I employ both difference-in-differences and regression discontinuity approaches to analyze previously unexploited data for the two years spanning the price change and obtain causal estimates of the hourly average treatment effects of the policy. I find evidence of peak spreading in traffic volume and decreases in travel time during peak hours. I also find suggestive evidence of substitution to a nearby bridge and decreases in travel time variability. In addition, I calculate own- and cross-price elasticities.  相似文献   
839.
Demand for public transportation is highly affected by passengers’ experience and the level of service provided. Thus, it is vital for transit agencies to deploy adaptive strategies to respond to changes in demand or supply in a timely manner, and prevent unwanted deterioration in service quality. In this paper, a real time prediction methodology, based on univariate and multivariate state-space models, is developed to predict the short-term passenger arrivals at transit stations. A univariate state-space model is developed at the station level. Through a hierarchical clustering algorithm with correlation distance, stations with similar demand patterns are identified. A dynamic factor model is proposed for each cluster, capturing station interdependencies through a set of common factors. Both approaches can model the effect of exogenous events (such as football games). Ensemble predictions are then obtained by combining the outputs from the two models, based on their respective accuracy. We evaluate these models using data from the 32 stations on the Central line of the London Underground (LU), operated by Transport for London (TfL). The results indicate that the proposed methodology performs well in predicting short-term station arrivals for the set of test days. For most stations, ensemble prediction has the lowest mean error, as well as the smallest range of error, and exhibits more robust performance across the test days.  相似文献   
840.
This paper studies last train coordination problem for metro networks, aiming to maximize the total number of passengers who can reach their destinations by metro prior to the end of operation. The concept of last boarding time is defined as the latest time that passengers can board the last trains and reach final destinations. The corresponding method for calculating last boarding time is also put forward. With automatic fare collection system data, an optimization model for coordinating last trains is proposed. The objective function optimizes the number of passengers who can reach their final destinations during the train period using departure times and headways of last trains for each line as decision variables. Afterwards, an adaptive genetic algorithm is put forward to solve this model and is applied to a case study of the Shanghai metro system. Copyright © 2017 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号