首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4235篇
  免费   253篇
公路运输   1087篇
综合类   1406篇
水路运输   1154篇
铁路运输   614篇
综合运输   227篇
  2024年   24篇
  2023年   61篇
  2022年   114篇
  2021年   198篇
  2020年   220篇
  2019年   116篇
  2018年   93篇
  2017年   153篇
  2016年   140篇
  2015年   215篇
  2014年   379篇
  2013年   293篇
  2012年   368篇
  2011年   410篇
  2010年   259篇
  2009年   242篇
  2008年   219篇
  2007年   291篇
  2006年   229篇
  2005年   147篇
  2004年   79篇
  2003年   49篇
  2002年   31篇
  2001年   43篇
  2000年   14篇
  1999年   20篇
  1998年   12篇
  1997年   7篇
  1996年   10篇
  1995年   10篇
  1994年   4篇
  1993年   9篇
  1992年   8篇
  1991年   6篇
  1990年   8篇
  1989年   4篇
  1988年   1篇
  1985年   1篇
  1984年   1篇
排序方式: 共有4488条查询结果,搜索用时 866 毫秒
51.
城市道路由于受到建设条件制约经常会采用较小的平、纵线形指标,其中地下道路和高架道路的曲线路段由于受到中隔墙、侧墙、结构顶板或防撞墙、防眩设施、声屏障等结构物的影响,易造成视距不足,为道路运营带来了安全隐患。在总结分析行车视距验算方法及规范要求值的基础上,采用数值解析法计算得到城市道路不同设计速度和视距要求下的平曲线、竖曲线半径对应值,并提出了视距不足时的优化设计措施,以期为日后的相关工作提供参考。  相似文献   
52.
用于车身制造质量控制的白车身测点布置及优化   总被引:3,自引:1,他引:3  
在对检测点进行分类定义后阐述了车身设计阶段各类测点的布置原则,在此基础上提出了面向制造偏差诊断的测点布置位置优化方法。  相似文献   
53.
高速公路路线方案优选模型及其应用   总被引:8,自引:0,他引:8  
利用灰色物元分析法,建立高速公路路线方案的优劣排序模型,对各路线方案进行多因素综合评价,为择优选择路线方案提供一种科学的评价方法。  相似文献   
54.
利用遗传算法对公路工程工期成本优化问题进行探讨,给出利用遗传算法对整个问题的求解设计思路,在公路工程工期成本优化中利用遗传算法优化时染色体设计、优秀个体的充分利用以及遗传操作后不合理结果的处理提出解决方法,为今后遗传算法在公路工程进度优化中的应用提供有益的思路。最后设计求解流程图。  相似文献   
55.
遗传算法在区段站到发线的应用研究   总被引:4,自引:2,他引:4  
为解决车站到发线的合理运用问题,采用遗传算建立了到发线运用的染色体结构和适应度函数,对这种复杂的非线性组合优化问题进行了仿真。  相似文献   
56.
城市公交线网优化的线性模型   总被引:10,自引:1,他引:10  
为了对现有公交线网进行优化,有效利用现有交通资源,解决城市交通问题,运用系统科学的思想,通过对城市公交线网优化的主要内容、优化原则、优化目标以及约束条件的分析,兼顾考虑乘客出行时间、公交线网密度和公交企业的利益以及公交线网的布局对整个城市的交通系统的影响,提出了优化目标的函数表达式及相应约束条件的数学表达式,建立了公交线网优化的线性模型,并给出了运用逐步筛选法对所提出的数学模型进行求解的方法。  相似文献   
57.
58.
The rapid growth in air traffic has resulted in increased emission and noise levels in terminal areas, which brings negative environmental impact to surrounding areas. This study aims to optimize terminal area operations by taking into account environmental constraints pertaining to emission and noise. A multi-objective terminal area resource allocation problem is formulated by employing the arrival fix allocation (AFA) problem, while minimizing aircraft holding time, emission, and noise. The NSGA-II algorithm is employed to find the optimal assignment of terminal fixes with given demand input and environmental considerations, by incorporating the continuous descent approach (CDA). A case study of the Shanghai terminal area yields the following results: (1) Compared with existing arrival fix locations and the first-come-first-serve (FCFS) strategy, the AFA reduces emissions by 19.6%, and the areas impacted by noise by 16.4%. AFA and CDA combined reduce the emissions by 28% and noise by 38.1%; (2) Flight delays caused by the imbalance of demand and supply can be reduced by 72% (AFA) and 81% (AFA and CDA) respectively, compared with the FCFS strategy. The study demonstrates the feasibility of the proposed optimization framework to reduce the environmental impact in terminal areas while improving the operational efficiency, as well as its potential to underpin sustainable air traffic management.  相似文献   
59.
60.
Adjusting traffic signal timings is a practical way for agencies to manage urban traffic without the need for significant infrastructure investments. Signal timings are generally selected to minimize the total control delay vehicles experience at an intersection, particularly when the intersection is isolated or undersaturated. However, in practice, there are many other potential objectives that might be considered in signal timing design, including: total passenger delay, pedestrian delays, delay inequity among competing movements, total number of stopping maneuvers, among others. These objectives do not tend to share the same relationships with signal timing plans and some of these objectives may be in direct conflict. The research proposes the use of a new multi-objective optimization (MOO) visualization technique—the mosaic plot—to easily quantify and identify significant tradeoffs between competing objectives using the set of Pareto optimal solutions that are normally provided by MOO algorithms. Using this tool, methods are also proposed to identify and remove potentially redundant or unnecessary objectives that do not have any significant tradeoffs with others in an effort to reduce problem dimensionality. Since MOO procedures will still be needed if more than one objective remains and MOO algorithms generally provide a set of candidate solutions instead of a single final solution, two methods are proposed to rank the set of Pareto optimal solutions based on how well they balance between the competing objectives to provide a final recommendation. These methods rely on converting the objectives to dimensionless values based on the optimal value for each specific objectives, which allows for direct comparison between and weighting of each. The proposed methods are demonstrated using a simple numerical example of an undersaturated intersection where all objectives can be analytically obtained. However, they can be readily applied to other signal timing problems where objectives can be obtained using simulation outputs to help identify the signal timing plan that provides the most reasonable tradeoff between competing objectives.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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