首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   461篇
  免费   34篇
公路运输   87篇
综合类   152篇
水路运输   179篇
铁路运输   33篇
综合运输   44篇
  2023年   4篇
  2022年   4篇
  2021年   9篇
  2020年   16篇
  2019年   10篇
  2018年   14篇
  2017年   16篇
  2016年   17篇
  2015年   31篇
  2014年   32篇
  2013年   36篇
  2012年   32篇
  2011年   27篇
  2010年   22篇
  2009年   26篇
  2008年   34篇
  2007年   42篇
  2006年   45篇
  2005年   25篇
  2004年   14篇
  2003年   9篇
  2002年   9篇
  2001年   5篇
  2000年   4篇
  1999年   2篇
  1998年   2篇
  1996年   1篇
  1995年   1篇
  1994年   1篇
  1993年   1篇
  1992年   2篇
  1990年   1篇
  1987年   1篇
排序方式: 共有495条查询结果,搜索用时 974 毫秒
291.
Regenerative braking is an energy recovery mechanism that converts the kinetic energy during braking into electricity, also known as regenerative energy. In general, most of the regenerative energy is transmitted backward along the pantograph and fed back into the overhead contact line. To reduce the trains’ energy consumption, this paper develops a scheduling approach to coordinate the arrivals and departures of all trains located in the same electricity supply interval so that the energy regenerated from braking trains can be more effectively utilized to accelerate trains. Firstly, we formulate an integer programming model with real-world speed profiles to minimize the trains’ energy consumption with dwell time control. Secondly, we design a genetic algorithm and an allocation algorithm to find a good solution. Finally, we present numerical examples based on the real-life operation data from the Beijing Metro Yizhuang Line in Beijing, China. The results show that the proposed scheduling approach can reduce energy consumption by 6.97% and save about 1,054,388 CNY (or 169,223 USD) each year in comparison with the current timetable. Compared to the cooperative scheduling (CS) approach, the proposed scheduling approach can improve the utilization of regenerative energy by 36.16% and reduce the total energy consumption by 4.28%.  相似文献   
292.
The objective of this study is to analyze the public acceptability of deep subterranean railway systems, which will be constructed in the space 40 m below ground level and will be operated at twice the speed of the existing subway system. Although such railway systems have been feasible in terms of construction technologies and economics, public acceptability must be considered for the successful introduction of such a new public infrastructure. Therefore, to perform the analysis of public acceptability, a telephone-based survey was conducted for residents in the vicinity of the planned the deep subterranean railway systems. As a result, about 70% of the respondents answered that they took a neutral or opposing attitude to introducing the deep subterranean railway systems. Awareness of the deep subterranean railway systems has a positive impact on its acceptability. In addition, the acceptability is found to show a negative relationship with environment and inconvenience factors. Based on the analysis results, an affective approach through soft measures such as awareness campaigns and advertisements is recommended to effectively address and mitigate the concerns and issues raised by the public.  相似文献   
293.
Car-following models are always of great interest of traffic engineers and researchers. In the age of mass data, this paper proposes a nonparametric car-following model driven by field data. Different from most of the existing car-following models, neither driver’s behaviour parameters nor fundamental diagrams are assumed in the data-driven model. The model is proposed based on the simple k-nearest neighbour, which outputs the average of the most similar cases, i.e., the most likely driving behaviour under the current circumstance. The inputs and outputs are selected, and the determination of the only parameter k is introduced. Three simulation scenarios are conducted to test the model. The first scenario is to simulate platoons following real leaders, where traffic waves with constant speed and the detailed trajectories are observed to be consistent with the empirical data. Driver’s rubbernecking behaviour and driving errors are simulated in the second and third scenarios, respectively. The time–space diagrams of the simulated trajectories are presented and explicitly analysed. It is demonstrated that the model is able to well replicate periodic traffic oscillations from the precursor stage to the decay stage. Without making any assumption, the fundamental diagrams for the simulated scenario coincide with the empirical fundamental diagrams. These all validate that the model can well reproduce the traffic characteristics contained by the field data. The nonparametric car-following model exhibits traffic dynamics in a simple and parsimonious manner.  相似文献   
294.
A double-layer data-driven framework for the automated vision inspection of the rail surface cracks is proposed in this paper. Based on images of rails, the proposed framework is capable to detect the location of cracks firstly and next automatically obtain the boundary of cracks via a feature-based linear iterative crack aggregation (FLICA). Extended Haar-like features are applied to develop significant features for identifying cracks in images. Built on extended Haar-like features, a cascading classifier ensemble integrating three single cascading classifiers with a major voting scheme is proposed to decide the presence of cracks in the image. Each single cascading classifier is composed of a sequence of stage classifiers trained by the LogitBoost algorithm. A scalable sliding window carrying the cascading classifier ensemble is applied to scan images of rail tracks, which is identified by the Otsu’s method, and detect cracks. After completing the crack registration in the first layer, the FLICA is developed to discover boundaries of cracks. The effectiveness of the proposed data-driven framework for identifying rail surface cracks is validated with the rail images provided by the China Railway Corporation and Hong Kong Mass Transit Railway (MRT). Six benchmarking methods, the Otsu’s method, mean shift, the visual detection system, the geometrical approach, fully convolutional networks and the U-net, are utilized to prove advantages of the proposed framework. Results of the validation and comparative analyses demonstrate that the proposed framework is most effective in the rail surface crack detection.  相似文献   
295.
This paper presents a Distributed-Coordinated methodology for signal timing optimization in connected urban street networks. The underlying assumption is that all vehicles and intersections are connected and intersections can share information with each other. The novelty of the work arises from reformulating the signal timing optimization problem from a central architecture, where all signal timing parameters are optimized in one mathematical program, to a decentralized approach, where a mathematical program controls the timing of only a single intersection. As a result of this distribution, the complexity of the problem is significantly reduced thus, the proposed approach is real-time and scalable. Furthermore, distributed mathematical programs continuously coordinate with each other to avoid finding locally optimal solutions and to move towards global optimality. We proposed a real-time and scalable solution technique to solve the problem and applied it to several case study networks under various demand patterns. The algorithm controlled queue length and maximized intersection throughput (between 1% and 5% increase compared to the actuated coordinated signals optimized in VISTRO) and reduced travel time (between 17% and 48% decrease compared to actuated coordinated signals) in all cases.  相似文献   
296.
This paper introduces a new dynamic green bike repositioning problem (DGBRP) that simultaneously minimizes the total unmet demand of the bike-sharing system and the fuel and CO2 emission cost of the repositioning vehicle over an operational period. The problem determines the route and the number of bikes loaded and unloaded at each visited node over a multi-period operational horizon during which the cycling demand at each node varies from time to time. To handle the dynamic nature of the problem, this study adopts a rolling horizon approach to break down the proposed problem into a set of stages, in which a static bike repositioning sub-problem is solved in each stage. An enhanced artificial bee colony (EABC) algorithm and a route truncation heuristic are jointly used to optimize the route design in each stage, and the loading and unloading heuristic is used to tackle the loading and unloading sub-problem along the route in a given stage. Numerical results show that the EABC algorithm outperforms Genetic Algorithm in solving the routing sub-problem. Computation experiments are performed to illustrate the effect of the stage duration on the two objective values, and the results show that longer stage duration leads to higher total unmet demand and total fuel and CO2 emission cost. Numerical studies are also performed to illustrate the effects of the weight and the loading and unloading times on the two objective values and the tradeoff between the two objectives.  相似文献   
297.
京杭运河韩庄一线、复线船闸共用引航道,船闸灌、泄水过程中形成非恒定流,水流十分复杂。为确保引航道内船舶航行和停泊安全,采用MIKE21水动力模型对船闸上下游不同水位组合情况下引航道复杂非恒定流进行深入研究,模拟计算引航道、靠船墩、口门区纵向流速、横向流速及环流分布情况。研究表明:泄洪条件下韩庄一线、复线船闸不满足通航要求;针对泄洪期存在的水力学问题,提出了有效工程措施——格栅及局部疏浚。  相似文献   
298.
宋双  黄志扬  张建锋  陈中 《水运工程》2015,(11):110-114
大丰港进港航道地处苏北辐射沙洲北缘的西洋水道,目前为自然水深航道。由于苏北辐射沙洲地区缺少航道开挖的工程实践,为了科学审慎地推进大丰港区15万吨级深水航道的建设,于2012—2013年在工程海域开展了航道试挖工程。试挖槽挖泥厚度约3.1 m,监测期12个半月内累计淤积厚度1.72 m,稳定期月平均回淤强度为0.12 m,在正常年份大风作用下来出现明显淤积。试挖工程监测研究成果为大丰深水航道的建设提供了技术支撑,也为辐射沙洲海域航道建设提供了科学参考。  相似文献   
299.
采用应变测力法,测试了导管架竖直和水平杆件上的波浪力随时间的变化过程。利用测得的数据,并基于莫里森方程和微幅波理论,用最小二乘法求得惯性力系数CM和绕流阻力系数CD;再通过拟合法得到惯性力系数CM及绕流阻力系数CD随KC变化的公式,试验结果为导管架浮游稳定性计算提供了技术支持。  相似文献   
300.
针对连云港港区25万吨级进港航道回淤总量小于15万吨级的现象,从航道回淤实测资料、工程前后水动力环境等入手,借助于潮流数学模型,研究了该现象产生的原因。研究结果表明:疏浚工程和环抱式防波堤工程均会对进港航道的回淤产生一定的影响,但防波堤的影响起主要作用。疏浚工程导致航道流速以减弱为主,因而使得航道回淤略有增加;而环抱式防波堤工程,将使口门附近流速显著增加,从而导致进港航道回淤大幅减小。此外,环抱式防波堤的掩护作用,在很大程度上阻挡了泥沙进入港区,从而使口内航道段回淤也大幅降低。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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