全文获取类型
收费全文 | 3490篇 |
免费 | 124篇 |
专业分类
公路运输 | 587篇 |
综合类 | 1586篇 |
水路运输 | 807篇 |
铁路运输 | 435篇 |
综合运输 | 199篇 |
出版年
2024年 | 9篇 |
2023年 | 21篇 |
2022年 | 82篇 |
2021年 | 114篇 |
2020年 | 129篇 |
2019年 | 92篇 |
2018年 | 94篇 |
2017年 | 80篇 |
2016年 | 113篇 |
2015年 | 148篇 |
2014年 | 230篇 |
2013年 | 193篇 |
2012年 | 261篇 |
2011年 | 293篇 |
2010年 | 210篇 |
2009年 | 248篇 |
2008年 | 216篇 |
2007年 | 300篇 |
2006年 | 250篇 |
2005年 | 175篇 |
2004年 | 99篇 |
2003年 | 69篇 |
2002年 | 40篇 |
2001年 | 54篇 |
2000年 | 28篇 |
1999年 | 17篇 |
1998年 | 14篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有3614条查询结果,搜索用时 203 毫秒
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.
Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of expensive docking stations and kiosk machines. FFBS prevents bike theft and offers significant opportunities for smart management by tracking bikes in real-time with built-in GPS. However, like SBBS, the success of FFBS depends on the efficiency of its rebalancing operations to serve the maximal demand as possible.Bicycle rebalancing refers to the reestablishment of the number of bikes at sites to desired quantities by using a fleet of vehicles transporting the bicycles. Static rebalancing for SBBS is a challenging combinatorial optimization problem. FFBS takes it a step further, with an increase in the scale of the problem. This article is the first effort in a series of studies of FFBS planning and management, tackling static rebalancing with single and multiple vehicles. We present a Novel Mixed Integer Linear Program for solving the Static Complete Rebalancing Problem. The proposed formulation, can not only handle single as well as multiple vehicles, but also allows for multiple visits to a node by the same vehicle. We present a hybrid nested large neighborhood search with variable neighborhood descent algorithm, which is both effective and efficient in solving static complete rebalancing problems for large-scale bike sharing programs.Computational experiments were carried out on the 1 Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP) instances used previously in the literature and on three new sets of instances, two (one real-life and one general) based on Share-A-Bull Bikes (SABB) FFBS program recently launched at the Tampa campus of University of South Florida and the other based on Divvy SBBS in Chicago. Computational experiments on the 1-PDTSP instances demonstrate that the proposed algorithm outperforms a tabu search algorithm and is highly competitive with exact algorithms previously reported in the literature for solving static rebalancing problems in SBSS. Computational experiments on the SABB and Divvy instances, demonstrate that the proposed algorithm is able to deal with the increase in scale of the static rebalancing problem pertaining to both FFBS and SBBS, while deriving high-quality solutions in a reasonable amount of CPU time. 相似文献
48.
49.
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. 相似文献
50.
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. 相似文献