首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1023篇
  免费   45篇
公路运输   139篇
综合类   355篇
水路运输   350篇
铁路运输   82篇
综合运输   142篇
  2024年   2篇
  2023年   2篇
  2022年   14篇
  2021年   16篇
  2020年   23篇
  2019年   19篇
  2018年   23篇
  2017年   29篇
  2016年   37篇
  2015年   47篇
  2014年   78篇
  2013年   61篇
  2012年   103篇
  2011年   100篇
  2010年   79篇
  2009年   77篇
  2008年   63篇
  2007年   79篇
  2006年   76篇
  2005年   42篇
  2004年   28篇
  2003年   13篇
  2002年   13篇
  2001年   12篇
  2000年   8篇
  1999年   6篇
  1998年   4篇
  1996年   2篇
  1994年   1篇
  1993年   3篇
  1992年   1篇
  1991年   2篇
  1990年   4篇
  1989年   1篇
排序方式: 共有1068条查询结果,搜索用时 31 毫秒
1.
交通信息发布机构提供描述信息和规范信息给不同的出行者,描述信息接收者依据信息和经验更新路径行程时间认知,根据认知选择路径;规范信息接收者仅根据经验更新认知.规范信息遵从者选择推荐路径,非遵从者依据认知选择路径.两类信息遵从率都取决于信息准确度.依据非线性动力学理论分析了模型性质,研究表明,模型不动点存在但是不一定唯一,不动点状态与信息混合使用情况有关.数值试验结果表明,模型不动点与随机用户均衡点不同,以恰当比例混合使用两类信息可提高交通流稳定性.  相似文献   
2.
为刻画拥堵空间排队与溢出现象对交通流分配的影响,提出考虑拥堵空间排队与溢出的道路网静态交通流分配问题,并构建相关的求解算法,用于描述交通需求在起讫点移动过程中路网整体的宏观运行状态。首先,丰富和完善考虑拥堵空间排队与溢出的静态交通流分配的相关假设,提出次生瓶颈、拥堵干扰与渗透和分段化路段阻抗等基本概念和理论,来刻画拥堵交通瓶颈、拥堵空间排队等交通现象;其次,建立网络瓶颈识别算法和空间排队回溯算法,基于此构建考虑拥堵空间排队和溢出的增量分配算法,用于求解交通流分配的结果;最后,通过使用一个具有说明型的算例进行对比分析。研究结果表明:建立的瓶颈识别、排队回溯和增量分配算法可以识别路网中的瓶颈位置及其拥堵排队区域,并可计算得到各路段上的分段分配流量;与点排队只影响瓶颈路段的运行状况和均一的路段分配结果相比,可有效描述路网整体的宏观运行状态以及由于拥堵空间排队所导致的拥堵干扰与渗透现象;不同于“时间片”的伪动态交通流分配模型,新建算法的分配结果是“全时段”与“整体性”的路网宏观运行状态,包含了拥堵瓶颈的具体位置和空间排队的干扰与渗透情况;一般拥堵点排队模型和基于“时间片”的拥堵空间排队模型难以刻画拥堵干扰与渗透现象以及路网整体的宏观运行状态,故所建立的分配方法是对传统拥堵交通流分配的丰富和发展。  相似文献   
3.
The design problem of a two-bag air suspension system for heavy-duty vehicles is formulated as a two-level (suspension system level and component level) optimization problem. At the suspension system level, optimal stiffness matrix of leaf spring, characteristics of damper and upper rod layout are determined by solving a multi-objective constrained optimization problem with response surface. At the component level, shape and thickness of the leaf spring are formed using cubic-spline curves to make the stiffness matrix as close to the target values cascaded from suspension system level as possible. Simulations using a vehicle model described by multi-body model and FEM of the novel leaf spring validate the suspension system thus derived.  相似文献   
4.
随着高速公路的大规模建设,2005年我国高速公路通车里程突破4万km,其在社会经济发展中作用日益凸显,如何保证高速公路持续、稳定的运营,以满足不断增长的交通运输需求就显得尤为重要.应用目标持续性评价的理论方法对渝长高速公路的可持续发展能力进行了分析,有助于确保项目在运营期内提高质量的运输服务.  相似文献   
5.
针对铁路场景下入侵异物的特点,采用智能视频技术,对监控视频图像序列中入侵运动目标检测方法进行研究.提出基于参考点的“相对背景差分法”、基于目标特征的跟踪算法和基于透视规律的目标分类方法,实现对多目标场景运动目标的实时检测识别。典型场景实验结果表明:上述算法实现了铁路入侵运动目标的高效检测,与基础背景差分法相比,误检率和漏检率分别减小了24.56%和54.17%;与基于区域的传统目标跟踪方法相比,误匹配率和漏匹配率分别减小了64.78%和22.58%,且算法具有较强的实时性和鲁棒性。  相似文献   
6.
应用交通仿真软件PARAMICS验证交通分配模型   总被引:2,自引:0,他引:2  
为了考察交通分配模型能够在多大程度上反映现实的交通状况,需要对交通分配模型进行验证,本文阐述了利用微观交通仿软件PARAMICS对交通分配模型进行验证的研究思路。通过建模工具Modeller提供的图形界面,研究者不但能够非常直观地观察交通分配模型的效果,而且可以利用其分析工具Analyser对结果全面分析。因此RARAMICS是一个验证交通分配模型性能优良的平台。  相似文献   
7.
This paper studies the assignment of long-distance passenger traffic on a highway corridor network. First, we propose a traditional model for the long-distance traffic assignment considering interactions with local commuter traffic. It addresses the effect of local networks on highway corridors. An iterative algorithm is developed to solve for the exact solution. Then, to address the potential computational issues that arise therein, a decomposition method is proposed by introducing a new concept of corridor elasticity. An assignment procedure for long-distance passenger traffic is developed accordingly. Numerical tests show that the proposed decomposition method makes significant improvements in computational performance at a small loss of optimality. This decomposition method well approximates the exact assignment from the traditional formulation, especially when the highway corridors are near-saturation. The proposed decomposition method appears practical for application.  相似文献   
8.
Akamatsu et al. (2006) proposed a new transportation demand management scheme called “tradable bottleneck permits” (TBP), and proved its efficiency properties for a single bottleneck model. This paper explores the properties of a TBP system for general networks. An equilibrium model is first constructed to describe the states under the TBP system with a single OD pair. It is proved that equilibrium resource allocation is efficient in the sense that the total transportation cost in a network is minimized. It is also shown that the “self-financing principle” holds for the TBP system. Furthermore, theoretical relationships between TBP and congestion pricing (CP) are discussed. It is demonstrated that TBP has definite advantages over CP when demand information is not perfect, whereas both TBP and CP are equivalent for the perfect information case. Finally, it is shown that the efficiency result also holds for more general demand conditions.  相似文献   
9.
In the field of Swarm Intelligence, the Bee Colony Optimization (BCO) has proven to be capable of solving high-level combinatorial problems, like the Flight-Gate Assignment Problem (FGAP), with fast convergence performances. However, given that the FGAP can be often affected by uncertainty or approximation in data, in this paper we develop a new metaheuristic algorithm, based on the Fuzzy Bee Colony Optimization (FBCO), which integrates the concepts of BCO with a Fuzzy Inference System. The proposed method assigns, through the multicriteria analysis, airport gates to scheduled flights based on both passengers’ total walking distance and use of remote gates, to find an optimal flight-to-gate assignment for a given schedule. Comparison of the results with the schedules of real airports has allowed us to show the characteristics of the proposed concepts and, at the same time, it stressed the effectiveness of the proposed method.  相似文献   
10.
The airline schedule planning problem is defined as the sequence of decisions that need to be made to obtain a fully operational flight schedule. Historically, the airline scheduling problem has been sequentially solved. However, there have already been many attempts in order to obtain airline schedules in an integrated way. But due to tractability issues it is nowadays impossible to determine a fully operative and optimal schedule with an integrated model which accounts for all the key airline related aspects such as competitive effects, stochastic demand figures and uncertain operating conditions. Airlines usually develop base schedules, which are obtained much time in advance to the day of operations and not accounting for all the related uncertainty. This paper proposes a mathematical model in order to update base schedules in terms of timetable and fleet assignments while considering stochastic demand figures and uncertain operating conditions, and where robust itineraries are introduced in order to ameliorate miss-connected passengers. The proposed model leads to a large-scale problem which is difficult to be solved. Therefore, a novel improved and accelerated Benders decomposition approach is proposed. The analytical work is supported with case studies involving the Spanish legacy airline, IBERIA. The presented approach shows that the number of miss-connected passengers may be reduced when robust planning is applied.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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