全文获取类型
收费全文 | 1265篇 |
免费 | 66篇 |
专业分类
公路运输 | 234篇 |
综合类 | 663篇 |
水路运输 | 264篇 |
铁路运输 | 93篇 |
综合运输 | 77篇 |
出版年
2024年 | 4篇 |
2023年 | 10篇 |
2022年 | 13篇 |
2021年 | 34篇 |
2020年 | 46篇 |
2019年 | 27篇 |
2018年 | 32篇 |
2017年 | 36篇 |
2016年 | 37篇 |
2015年 | 64篇 |
2014年 | 66篇 |
2013年 | 71篇 |
2012年 | 92篇 |
2011年 | 98篇 |
2010年 | 67篇 |
2009年 | 106篇 |
2008年 | 86篇 |
2007年 | 97篇 |
2006年 | 114篇 |
2005年 | 78篇 |
2004年 | 35篇 |
2003年 | 27篇 |
2002年 | 21篇 |
2001年 | 25篇 |
2000年 | 12篇 |
1999年 | 4篇 |
1998年 | 13篇 |
1997年 | 3篇 |
1996年 | 6篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有1331条查询结果,搜索用时 0 毫秒
141.
特征选择是模式识别中的一个关键问题。在很多实际问题中,很难找到那些最重要的特征,或受条件限制不能对它们进行测量,从而使特征选择成为模式识别系统最困难的任务之一。遗传算法作为一种智能化的优化方法,具有适合特征选择的优势。对遗传算法做了简约介绍,通过相应的程序并结合汽车故障实例进行了分析。 相似文献
142.
143.
通过分析目前国内在产品创新设计领域研究的现状与各种算法的优缺点,提出了一种利用基于语义的遗传算法在产品形态创新设计的一种新型的算法,并且阐述了该算法的应用方式与步骤.通过一个桌面设计的实例验证了算法的可行性与实用性.结果显示,该算法能生成具有一定创新性的产品形态,并验证利用该算法进行创新设计是非常容易的. 相似文献
144.
轮乘制下的铁路乘务排班系统 总被引:1,自引:0,他引:1
张波 《铁路通信信号工程技术》2008,5(3):33-36
针对铁路乘务制度由包乘制改为轮乘制,建立基于回溯算法的乘务排班系统,完成乘务计划快速自动编排,降低乘务成本。 相似文献
145.
研究随机环境下车流径路的选择问题,首先给出路网车流径路方案可靠性的定义,并在此基础上建立随机环境下车流径路选择问题的随机相关机会多目标规划模型。模型考虑了车流具有不同权重的情况,目标为极大化车流径路方案的可靠性及极小化期望总费用。用C++语言编写K短路算法,并在Visual Studio 6.0上基于该算法开发了软件,用于计算网络上任意两点之间的K短路。以该软件计算出的K短路作为节点间的可选径路集,提出一种基于随机模拟的混合遗传算法。算例表明,在不同交叉和变异概率的条件下算法均可在给定进化代数内收敛至相同的最优解,有较强的适应性。 相似文献
146.
Multi-objective optimization of a road diet network design 总被引:1,自引:0,他引:1
Keemin Sohn 《Transportation Research Part A: Policy and Practice》2011,45(6):499-511
The present study focuses on the development of a model for the optimal design of a road diet plan within a transportation network, and is based on rigorous mathematical models. In most metropolitan areas, there is insufficient road space to dedicate a portion exclusively for cyclists without negatively affecting existing motorists. Thus, it is crucial to find an efficient way to implement a road diet plan that both maximizes the utility for cyclists and minimizes the negative effect on motorists. A network design problem (NDP), which is usually used to find the best option for providing extra road capacity, is adapted here to derive the best solution for limiting road capacity. The resultant NDP for a road diet (NDPRD) takes a bi-level form. The upper-level problem of the NDPRD is established as one of multi-objective optimization. The lower-level problem accommodates user equilibrium (UE) trip assignment with fixed and variable mode-shares. For the fixed mode-share model, the upper-level problem minimizes the total travel time of both cyclists and motorists. For the variable mode-share model, the upper-level problem includes minimization of both the automobile travel share and the average travel time per unit distance for motorists who keep using automobiles after the implementation of a road diet. A multi-objective genetic algorithm (MOGA) is mobilized to solve the proposed problem. The results of a case study, based on a test network, guarantee a robust approximate Pareto optimal front. The possibility that the proposed methodology could be adopted in the design of a road diet plan in a real transportation network is confirmed. 相似文献
147.
针对战场保障网络常常遭受敌人打击的现象,建立了考虑路段失效的军事配送中心可靠选址模型.模型为双层规划形式,上层规划的目标是优化系统在无路段失效和出现路段失效时所覆盖的总的需求量,下层规划的目标是最小化某一路段失效时系统覆盖的需求量.采用启发式算法求解下层规划,运用遗传算法求解整个模型.通过一个算例验证模型的优越性和算法的有效性.算例结果表明,尽管模型所得选址方案在无路段失效时覆盖的需求量,小于不考虑路段失效的最大覆盖模型选址方案覆盖的需求量,但在最佳路段失效时模型选址方案的覆盖效果优于后者. 相似文献
148.
149.
Train rescheduling model with train delay and passenger impatience time in urban subway network 下载免费PDF全文
This paper considers the train rescheduling problem with train delay in urban subway network. With the objective of minimizing the negative effect of train delay to passengers, which is quantified with a weighted combination of travel time cost and the cost of giving up the planned trips, train rescheduling model is proposed to jointly synchronize both train delay operation constraints and passenger behavior choices. Space–time network is proposed to describe passenger schedule‐based path choices and obtain the shortest travel times. Impatience time is defined to describe the intolerance of passengers to train delay. By comparing the increased travel time due to train delay with the passenger impatience time, a binary variable is defined to represent whether the passenger will give up their planned trips or not. The proposed train rescheduling model is implemented using genetic algorithm, and the model effectiveness is further examined through numerical experiments of real‐world urban subway train timetabling test. Duration effects of the train delay to the optimization results are analyzed. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献
150.
Two-dimensional multi-objective optimizations have been used for decades for the problems in traffic engineering although only few times so far in the optimization of signal timings. While the other engineering and science disciplines have utilized visualization of 3-dimensional Pareto fronts in the optimization studies, we have not seen many of those concepts applied to traffic signal optimization problems. To bridge the gap in the existing knowledge this study presents a methodology where 3-dimensional Pareto Fronts of signal timings, which are expressed through mobility, (surrogate) safety, and environmental factors, are optimized by use of an evolutionary algorithm. The study uses a segment of 5 signalized intersections in West Valley City, Utah, to test signal timings which provide a balance between mobility, safety and environment. In addition, a set of previous developed signal timing scenarios, including some of the Connected Vehicle technologies such as GLOSA, were conducted to evaluate the quality of the 3-dimensional Pareto front solutions. The results show success of 3-dimensinal Pareto fronts moving towards optimality. The resulting signal timing plans do not show large differences between themselves but all improve on the signal timings from the field, significantly. The commonly used optimization of standard single-objective functions shows robust solutions. The new set of Connected Vehicle technologies also shows promising benefits, especially in the area of reducing inter-vehicular friction. The resulting timing plans from two optimization sets (constrained and unconstrained) show that environmental and safe signal timings coincide but somewhat contradict mobility. Further research is needed to apply similar concepts on a variety of networks and traffic conditions before generalizing findings. 相似文献