全文获取类型
收费全文 | 1807篇 |
免费 | 82篇 |
专业分类
公路运输 | 290篇 |
综合类 | 832篇 |
水路运输 | 275篇 |
铁路运输 | 308篇 |
综合运输 | 184篇 |
出版年
2024年 | 3篇 |
2023年 | 6篇 |
2022年 | 36篇 |
2021年 | 40篇 |
2020年 | 35篇 |
2019年 | 39篇 |
2018年 | 46篇 |
2017年 | 51篇 |
2016年 | 61篇 |
2015年 | 66篇 |
2014年 | 106篇 |
2013年 | 92篇 |
2012年 | 155篇 |
2011年 | 143篇 |
2010年 | 128篇 |
2009年 | 132篇 |
2008年 | 101篇 |
2007年 | 141篇 |
2006年 | 144篇 |
2005年 | 87篇 |
2004年 | 58篇 |
2003年 | 38篇 |
2002年 | 23篇 |
2001年 | 35篇 |
2000年 | 19篇 |
1999年 | 15篇 |
1998年 | 15篇 |
1997年 | 7篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 13篇 |
1993年 | 10篇 |
1992年 | 4篇 |
1991年 | 10篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1984年 | 3篇 |
排序方式: 共有1889条查询结果,搜索用时 258 毫秒
31.
以广州地铁4号线和首都机场线引进的、国际领先水平的新型轨道结构(直线电机牵引系统)为研究对象,结合轨道工程施工实际,分析日本直线电机牵引和加拿大庞巴迪直线电机牵引城轨整体道床(尤其是道岔)铺设施工的技术特点,着重阐述首都机场线施工中的关键技术及解决方法。 相似文献
32.
Storage space allocation in container terminals 总被引:7,自引:0,他引:7
Chuqian Zhang Jiyin Liu Yat-wah Wan Katta G. Murty Richard J. Linn 《Transportation Research Part B: Methodological》2003,37(10):883-903
Container terminals are essential intermodal interfaces in the global transportation network. Efficient container handling at terminals is important in reducing transportation costs and keeping shipping schedules. In this paper, we study the storage space allocation problem in the storage yards of terminals. This problem is related to all the resources in terminal operations, including quay cranes, yard cranes, storage space, and internal trucks. We solve the problem using a rolling-horizon approach. For each planning horizon, the problem is decomposed into two levels and each level is formulated as a mathematical programming model. At the first level, the total number of containers to be placed in each storage block in each time period of the planning horizon is set to balance two types of workloads among blocks. The second level determines the number of containers associated with each vessel that constitutes the total number of containers in each block in each period, in order to minimize the total distance to transport the containers between their storage blocks and the vessel berthing locations. Numerical runs show that with short computation time the method significantly reduces the workload imbalance in the yard, avoiding possible bottlenecks in terminal operations. 相似文献
33.
城市公交线网优化的线性模型 总被引:10,自引:1,他引:10
为了对现有公交线网进行优化,有效利用现有交通资源,解决城市交通问题,运用系统科学的思想,通过对城市公交线网优化的主要内容、优化原则、优化目标以及约束条件的分析,兼顾考虑乘客出行时间、公交线网密度和公交企业的利益以及公交线网的布局对整个城市的交通系统的影响,提出了优化目标的函数表达式及相应约束条件的数学表达式,建立了公交线网优化的线性模型,并给出了运用逐步筛选法对所提出的数学模型进行求解的方法。 相似文献
34.
分段线性变参数控制在数字式自动找平控制系统中的应用 总被引:2,自引:0,他引:2
为了验证分段线性变参数控制在自动找平控制系统中的应用前景,对自动找平控制系统的结构、控制方式进行了介绍;分析了分段线性控制方式的工作原理及特点,在实验室建立了沥青混凝土摊铺机数字式自动找平控制系统试验台,设计了3套试验方案,即普通电磁阀方案、高速开关阀方案和分段线性控制方案;对这3种控制方案进行了试验比较,得出了在阶跃干扰作用下,3种控制方案的响应速度及产生超调时的超调量。结果表明:分段线性控制方案具有较快的响应速度,但在系统产生超调时,其超调量相对较大。 相似文献
35.
36.
37.
To curb emissions, containerized shipping lines face the traditional trade-off between cost and emissions (CO2 and SOx) reduction. This paper considers this element in the context of liner service design and proposes a mixed integer linear programming (MILP) model based on a multi-commodity pickup and delivery arc-flow formulation. The objective is to maximize the profit by selecting the ports to be visited, the sequence of port visit, the cargo flows between ports, as well as the number/operating speeds of vessels on each arc of the selected route. The problem also considers that Emission Control Areas (ECAs) exist in the liner network and accounts for the vessel carrying capacity. In addition to using the MILP solver of CPLEX, we develop in the paper a specific genetic algorithm (GA) based heuristic and show that it gives the possibility to reach an optimal solution when solving large size instances. 相似文献
38.
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. 相似文献
39.
40.