全文获取类型
收费全文 | 3420篇 |
免费 | 124篇 |
专业分类
公路运输 | 594篇 |
综合类 | 1559篇 |
水路运输 | 784篇 |
铁路运输 | 437篇 |
综合运输 | 170篇 |
出版年
2024年 | 12篇 |
2023年 | 24篇 |
2022年 | 85篇 |
2021年 | 112篇 |
2020年 | 134篇 |
2019年 | 96篇 |
2018年 | 85篇 |
2017年 | 77篇 |
2016年 | 102篇 |
2015年 | 144篇 |
2014年 | 230篇 |
2013年 | 185篇 |
2012年 | 244篇 |
2011年 | 290篇 |
2010年 | 197篇 |
2009年 | 243篇 |
2008年 | 206篇 |
2007年 | 297篇 |
2006年 | 248篇 |
2005年 | 171篇 |
2004年 | 98篇 |
2003年 | 72篇 |
2002年 | 38篇 |
2001年 | 55篇 |
2000年 | 28篇 |
1999年 | 17篇 |
1998年 | 14篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 8篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1984年 | 1篇 |
排序方式: 共有3544条查询结果,搜索用时 125 毫秒
41.
Aircraft noise has been regarded as one of the major environmental issues related to air transport. Many airports have introduced a variety of measures to reduce its impact. Several air traffic assignment strategies have been proposed in order to allocate noise more wisely. Even though each decision regarding the assignment of aircraft to routes should consider population exposure to noise, none of the air traffic assignment strategies has addressed daily migrations of population and number of people exposed to noise. The aim of this research is to develop a mathematical model and a heuristic algorithm that could assign aircraft to departure and arrival routes so that number of people exposed to noise is as low as possible, taking into account temporal and spatial variations in population in an airport’s vicinity. The approach was demonstrated on Belgrade airport to show the benefits of the proposed model. Numerical example showed that population exposure to noise could be reduced significantly by applying the proposed air traffic assignment model. As a consequence of the proposed air traffic assignment, overall fuel consumption increased by less than 1%. 相似文献
42.
介绍了深度模拟器总体结构及工作原理,针对深度模拟器控制系统中PID算法及其相关参数进行了仿真研究。以深度模拟器液压系统为模型,利用AMESim仿真软件工具,对整个液压系统进行了仿真分析并对系统各元器件的参数进行了优化,为深度模拟器的进一步研究提供了理论基础。 相似文献
43.
44.
This paper studies the assignment of long-distance passenger traffic on a highway corridor network. First, we propose a traditional model for the long-distance traffic assignment considering interactions with local commuter traffic. It addresses the effect of local networks on highway corridors. An iterative algorithm is developed to solve for the exact solution. Then, to address the potential computational issues that arise therein, a decomposition method is proposed by introducing a new concept of corridor elasticity. An assignment procedure for long-distance passenger traffic is developed accordingly. Numerical tests show that the proposed decomposition method makes significant improvements in computational performance at a small loss of optimality. This decomposition method well approximates the exact assignment from the traditional formulation, especially when the highway corridors are near-saturation. The proposed decomposition method appears practical for application. 相似文献
45.
46.
47.
48.
Locating emergency vehicles with an approximate queuing model and a meta-heuristic solution approach
In this paper, the location of emergency service (ES) vehicles is studied on fully connected networks. Queuing theory is utilized to obtain the performance metrics of the system. An approximate queuing model the (AQM) is proposed. For the AQM, different service rate formulations are constructed. These formulations are tested with a simulation study for different approximation levels. A mathematical model is proposed to minimize the mean response time of ES systems based on AQM. In the model, multiple vehicles are allowed at a single location. The objective function of the model has no closed form expression. A genetic algorithm is constructed to solve the model. With the help of the genetic algorithm, the effect of assigning multiple vehicles on the mean response time is reported. 相似文献
49.
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. 相似文献
50.
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. 相似文献