全文获取类型
收费全文 | 3508篇 |
免费 | 574篇 |
专业分类
公路运输 | 709篇 |
综合类 | 1666篇 |
水路运输 | 849篇 |
铁路运输 | 658篇 |
综合运输 | 200篇 |
出版年
2025年 | 57篇 |
2024年 | 116篇 |
2023年 | 119篇 |
2022年 | 124篇 |
2021年 | 174篇 |
2020年 | 173篇 |
2019年 | 126篇 |
2018年 | 132篇 |
2017年 | 107篇 |
2016年 | 139篇 |
2015年 | 164篇 |
2014年 | 231篇 |
2013年 | 197篇 |
2012年 | 249篇 |
2011年 | 287篇 |
2010年 | 192篇 |
2009年 | 247篇 |
2008年 | 205篇 |
2007年 | 295篇 |
2006年 | 240篇 |
2005年 | 167篇 |
2004年 | 95篇 |
2003年 | 70篇 |
2002年 | 35篇 |
2001年 | 52篇 |
2000年 | 26篇 |
1999年 | 17篇 |
1998年 | 14篇 |
1997年 | 4篇 |
1996年 | 7篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有4082条查询结果,搜索用时 15 毫秒
611.
由实物模型子系统、控制子系统和智能调度子系统搭建基于运行图驱动的列车运行控制半实物仿真系统。采用实物微缩模型与抽象模型相结合的方法,构建列车运行控制过程的半实物仿真环境及仿真算法;基于DxdcNet/LocoNet通信协议,定义用于各子系统间数据交互的数据格式及通信协议;采用C#编程语言编制相关系统软件。对以京津城际铁路为背景搭建的基于运行图驱动的列车运行控制半实物仿真系统进行测试,结果表明:可以直观地仿真三显示、四显示和准移动闭塞模式下的列车运行全过程,在1h内完成全日运行图的行车组织过程演练并获取相关数据,为列车运行计划的编制和安全实施提供科学依据。该系统已投入实际使用,并在调度指挥教学、运行图动态性能检测等方面均取得了良好效果。 相似文献
612.
对规划新建的城市轨道交通,可通过合理地制定快慢车停站方案,来提高其服务水平,降低企业运营成本,实现城市轨道交通系统运营效益最大化。在详细分析乘客旅行时间及企业运营成本构成的基础上,考虑乘客在快慢车之间的选择行为,以停站方案及快慢车发车频率为决策变量,以乘客旅行时间最短和企业运营成本最小为目标,建立了城市轨道交通快慢车组合方案优化多目标整体规划模型,并设计结合模糊优化思想的遗传-模拟退火(GA-SA)算法求解。算例分析结果表明:开行快慢车后,乘客总旅行时间可节约8.7%,企业运营成本可降低5.9%。 相似文献
613.
通过对图像传感器输出的轨距左右偏移信号和左右高低偏移信号、加速度计输出信号和车体惯性平台输出的轨道倾角信号进行合成处理,得到准确的轨距和轨向测量结果。从理论上推导轨向的合成算法,对安装于轨距测量梁中心的轨向加速度计的响应进行重力和旋转运动修正后,与三角窗函数卷积运算,得到轨距测量梁中心横向位移的二阶差分,然后再通过二次积分和滤波得到左右轨向值。通过设计模拟低通滤波和相应的数字滤波器,实现了加速度滤波器的幅频响应与检测车速度无关,保证了系统的检测精度。对轨向加速度计测得的位移和摄像式轨距系统测得的位移进行比较,验证了系统测量原理和合成算法的正确性。经静态验证和现场试验,结果证明构架式轨距—轨向检测系统具有检测精度高、性能稳定和故障率低的优点。 相似文献
614.
旅客列车过站径路优化模型与算法 总被引:1,自引:0,他引:1
在给定铁路客运站站形布局和列车运行图的前提下,研究旅客列车过站径路优化问题。过站径路由列车的接车作业进路、占用的到发线和发车作业进路拼接而成。以旅客列车的接发车作业进路为决策,以道岔和到发线占用相容性为约束,以最大化接发车作业进路效用和到发线运用效用为优化目标,建立旅客列车过站径路优化的0-1规划模型。设计基于极大列车过站径路方案k剔除邻域系的模拟退火算法。以某客运站为例验证该模型和算法的合理性。结果表明:模型对实际问题的描述准确,算法效率较高,适用于求解大规模铁路客运站旅客列车过站径路优化问题。 相似文献
615.
技术站广义配流问题模型与算法 总被引:1,自引:0,他引:1
根据列车解编顺序是否确定,将阶段计划中的广义配流问题分为广义静态配流问题和广义动态配流问题。以阶段内发出配流车数最多和车辆在站平均停留时间最短为目标函数,以列车解体开始时刻、车流分配、车流接续和列车编组开始时刻为约束条件,建立广义动态配流问题的多目标非线性混合整数规划模型。综合考虑优先排空、优先发送较近编组去向车流,模拟车站调度员编制阶段计划时的思维过程,设计搜索算法,解决广义静态配流问题(给定列车解编顺序的广义动态配流问题)。以有7个编组去向的某技术站为例,运用该算法可以在较短时间内得到列车解编方案和配流方案,表明了该算法的实用性和可行性。 相似文献
616.
针对目前电网谐波治理,考虑到无源滤渡器设计的现状,以及现有优化设计方法中假设条件较多、寻优能力不强等问题,提出了一种无源滤波器的多目标优化设计方法.利用混沌算法,将无源滤波器的初期投资、无功功率补偿、滤波后电网谐波含量作为目标,进行无源滤波器的参数优化设计.实践证明,该方法设计的无源滤波器具有较好的综合性能. 相似文献
617.
在基坑工程中,传统的位移反分析方法计算量较大,不易掌握,且求得的岩土体力学性能参数的精度较低。为此,提出应用克隆选择算法求解位移反分析问题的新方法,其核心是采用BP网络为正演工具代替有限元方法,描述土体力学性能参数和位移的非线性映射,可减少计算量,并利用克隆选择算法为反演工具,通过反演分析确定土体力学性能参数,具有较高的精度。依据该反分析方法获得的岩土体力学性能参数又可以估算下一工况的基坑位移。仿真试验结果表明了新方法的可行性和有效性。 相似文献
618.
Trip purpose is crucial to travel behavior modeling and travel demand estimation for transportation planning and investment decisions. However, the spatial-temporal complexity of human activities makes the prediction of trip purpose a challenging problem. This research, an extension of work by Ermagun et al. (2017) and Meng et al. (2017), addresses the problem of predicting both current and next trip purposes with both Google Places and social media data. First, this paper implements a new approach to match points of interest (POIs) from the Google Places API with historical Twitter data. Therefore, the popularity of each POI can be obtained. Additionally, a Bayesian neural network (BNN) is employed to model the trip dependence on each individual’s daily trip chain and infer the trip purpose. Compared with traditional models, it is found that Google Places and Twitter information can greatly improve the overall accuracy of prediction for certain activities, including “EatOut”, “Personal”, “Recreation” and “Shopping”, but not for “Education” and “Transportation”. In addition, trip duration is found to be an important factor in inferring activity/trip purposes. Further, to address the computational challenge in the BNN, an elastic net is implemented for feature selection before the classification task. Our research can lead to three types of possible applications: activity-based travel demand modeling, survey labeling assistance, and online recommendations. 相似文献
619.
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. 相似文献
620.
In this research, we present a data-splitting algorithm to optimally solve the aircraft sequencing problem (ASP) on a single runway under both segregated and mixed-mode of operation. This problem is formulated as a 0–1 mixed-integer program (MIP), taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting, with the objective of maximizing the total throughput. Varied scenarios of large scale realistic instances of this problem, which is NP-hard in general, are computationally difficult to solve with the direct use of commercial solver as well as existing state-of-the-art dynamic programming method. The design of the algorithm is based on a recently introduced data-splitting algorithm which uses the divide-and-conquer paradigm, wherein the given set of flights is divided into several disjoint subsets, each of which is optimized using 0–1 MIP while ensuring the optimality of the entire set. Computational results show that the difficult instances can be solved in real-time and the solution is efficient in comparison to the commercial solver and dynamic programming, using both sequential, as well as parallel, implementation of this pleasingly parallel algorithm. 相似文献