全文获取类型
收费全文 | 5245篇 |
免费 | 321篇 |
专业分类
公路运输 | 1232篇 |
综合类 | 2028篇 |
水路运输 | 1213篇 |
铁路运输 | 712篇 |
综合运输 | 381篇 |
出版年
2024年 | 22篇 |
2023年 | 59篇 |
2022年 | 118篇 |
2021年 | 211篇 |
2020年 | 257篇 |
2019年 | 132篇 |
2018年 | 147篇 |
2017年 | 191篇 |
2016年 | 178篇 |
2015年 | 261篇 |
2014年 | 449篇 |
2013年 | 349篇 |
2012年 | 437篇 |
2011年 | 479篇 |
2010年 | 318篇 |
2009年 | 323篇 |
2008年 | 302篇 |
2007年 | 380篇 |
2006年 | 323篇 |
2005年 | 206篇 |
2004年 | 103篇 |
2003年 | 68篇 |
2002年 | 48篇 |
2001年 | 56篇 |
2000年 | 20篇 |
1999年 | 27篇 |
1998年 | 15篇 |
1997年 | 8篇 |
1996年 | 17篇 |
1995年 | 10篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1992年 | 10篇 |
1991年 | 6篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
排序方式: 共有5566条查询结果,搜索用时 93 毫秒
51.
多货物品种集装化运输的优化调度问题 总被引:2,自引:0,他引:2
用数学模型描述了供应商根据某一用户在各个不同时间段内对不同货物的需求量情况,利用各种不同型号的箱体进行分时段货物发送的问题。其最终目的是为了求得能够使运输成本和存储成本达到最小的货物发送方案,该问题是一个由批量问题和拼箱问题所组成的复合问题。就此问题,提出了一种三阶段算法。通过理论分析,该算法可以有效地解决此类问题。 相似文献
52.
53.
高速公路路线方案优选模型及其应用 总被引:8,自引:0,他引:8
利用灰色物元分析法,建立高速公路路线方案的优劣排序模型,对各路线方案进行多因素综合评价,为择优选择路线方案提供一种科学的评价方法。 相似文献
54.
55.
遗传算法在区段站到发线的应用研究 总被引:4,自引:2,他引:4
青学江 《西南交通大学学报》1998,33(4):387-393
为解决车站到发线的合理运用问题,采用遗传算建立了到发线运用的染色体结构和适应度函数,对这种复杂的非线性组合优化问题进行了仿真。 相似文献
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.
This paper introduces a rolling horizon algorithm to plan the delivery of vehicles to automotive dealers by a heterogeneous fleet of auto-carriers. The problem consists in scheduling the deliveries over a multiple-day planning horizon during which requests for transportation arrive dynamically. In addition, the routing of the auto-carriers must take into account constraints related to the loading of the vehicles on the carriers. The objective is to minimize the sum of traveled distances, fixed costs for auto-carrier operation, service costs, and penalties for late deliveries. The problem is solved by a heuristic that first selects the vehicles to be delivered in the next few days and then optimizes the deliveries by an iterated local search procedure. A branch-and-bound search is used to check the feasibility of the loading. To handle the dynamic nature of the problem, the complete algorithm is applied repeatedly in a rolling horizon framework. Computational results on data from a major European logistics service provider show that the heuristic is fast and yields significant improvements compared to the sequential solution of independent daily problems. 相似文献
60.
Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization. 相似文献