全文获取类型
收费全文 | 1737篇 |
免费 | 83篇 |
专业分类
公路运输 | 348篇 |
综合类 | 817篇 |
水路运输 | 279篇 |
铁路运输 | 189篇 |
综合运输 | 187篇 |
出版年
2024年 | 2篇 |
2023年 | 9篇 |
2022年 | 42篇 |
2021年 | 45篇 |
2020年 | 45篇 |
2019年 | 44篇 |
2018年 | 52篇 |
2017年 | 55篇 |
2016年 | 60篇 |
2015年 | 77篇 |
2014年 | 108篇 |
2013年 | 102篇 |
2012年 | 134篇 |
2011年 | 139篇 |
2010年 | 116篇 |
2009年 | 117篇 |
2008年 | 100篇 |
2007年 | 136篇 |
2006年 | 129篇 |
2005年 | 71篇 |
2004年 | 56篇 |
2003年 | 40篇 |
2002年 | 18篇 |
2001年 | 27篇 |
2000年 | 17篇 |
1999年 | 8篇 |
1998年 | 14篇 |
1997年 | 4篇 |
1996年 | 11篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 11篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1984年 | 3篇 |
排序方式: 共有1820条查询结果,搜索用时 15 毫秒
21.
从瀑布式程序设计的角度,综述了苛求系统软件生命周期各阶段的可靠性方法、技术和模型,包括需求形式化建模与验证、屏蔽设计错误的多版本软件容错、函数式程序设计以及可靠度评估模型等。总结比较各自适用的开发阶段、面向的目标错误类型及优缺点。 相似文献
22.
考虑支路路段双向车流相互影响的因素,从道路负荷与公平性的角度出发,优化单向交通组织方案。建立一主多从的双层规划模型,上层规划是多目标规划,以单行交通组织方案为决策,以路段饱和度超限量最小化降低道路负荷、以车辆绕行系数最小化提高公平性。下层规划是考虑支路路段双向车流相互影响的均衡交通分配(每个点对之间的最短路各自由1个下层规划确定,但所有下层规划确定的最短路可一次性求解)。双层规划可用模拟退火算法求解,求解效果明显优于支路路段通行能力等量划分为双向分道行驶的传统优化方法。 相似文献
23.
24.
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. 相似文献
25.
26.
27.
28.
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. 相似文献
29.
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. 相似文献
30.
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. 相似文献