全文获取类型
收费全文 | 6409篇 |
免费 | 290篇 |
专业分类
公路运输 | 1227篇 |
综合类 | 2757篇 |
水路运输 | 1260篇 |
铁路运输 | 887篇 |
综合运输 | 568篇 |
出版年
2024年 | 16篇 |
2023年 | 37篇 |
2022年 | 122篇 |
2021年 | 167篇 |
2020年 | 200篇 |
2019年 | 163篇 |
2018年 | 172篇 |
2017年 | 178篇 |
2016年 | 249篇 |
2015年 | 277篇 |
2014年 | 467篇 |
2013年 | 372篇 |
2012年 | 498篇 |
2011年 | 532篇 |
2010年 | 378篇 |
2009年 | 450篇 |
2008年 | 382篇 |
2007年 | 528篇 |
2006年 | 462篇 |
2005年 | 308篇 |
2004年 | 168篇 |
2003年 | 125篇 |
2002年 | 73篇 |
2001年 | 121篇 |
2000年 | 52篇 |
1999年 | 45篇 |
1998年 | 28篇 |
1997年 | 25篇 |
1996年 | 16篇 |
1995年 | 10篇 |
1994年 | 21篇 |
1993年 | 13篇 |
1992年 | 10篇 |
1991年 | 7篇 |
1990年 | 8篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1986年 | 1篇 |
1984年 | 3篇 |
排序方式: 共有6699条查询结果,搜索用时 750 毫秒
91.
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. 相似文献
92.
93.
94.
95.
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. 相似文献
96.
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. 相似文献
97.
This paper provides a review of research performed by Svenson with colleagues and others work on mental models and their practical implications. Mental models describe how people perceive and think about the world including covariances and relationships between different variables, such as driving speed and time. Research on mental models has detected the time-saving bias [Svenson, O. (1970). A functional measurement approach to intuitive estimation as exemplified by estimated time savings. Journal of Experimental Psychology, 86, 204–210]. It means that drivers relatively overestimate the time that can be saved by increasing speed from an already high speed, for example, 90–130?km/h, and underestimate the time that can be saved by increasing speed from a low speed, for example, 30–45?km/h. In congruence with this finding, mean speed judgments and perceptions of mean speeds are also biased and higher speeds given too much weight and low speeds too little weight in comparison with objective reality. Replacing or adding a new speedometer in the car showing min per km eliminated or weakened the time-saving bias. Information about braking distances at different speeds did not improve overoptimistic judgments of braking capacity, but information about collision speed with an object suddenly appearing on the road did improve judgments of braking capacity. This is relevant to drivers, politicians and traffic regulators. 相似文献
98.
Estimating the travel time reliability (TTR) of urban arterial is critical for real-time and reliable route guidance and provides theoretical bases and technical support for sophisticated traffic management and control. The state-of-art procedures for arterial TTR estimation usually assume that path travel time follows a certain distribution, with less consideration about segment correlations. However, the conventional approach is usually unrealistic because an important feature of urban arterial is the dependent structure of travel times on continuous segments. In this study, a copula-based approach that incorporates the stochastic characteristics of segments travel time is proposed to model arterial travel time distribution (TTD), which serves as a basis for TTR quantification. First, segments correlation is empirically analyzed and different types of copula models are examined. Then, fitting marginal distributions for segment TTD is conducted by parametric and non-parametric regression analysis, respectively. Based on the estimated parameters of the models, the best-fitting copula is determined in terms of the goodness-of-fit tests. Last, the model is examined at two study sites with AVI data and NGSIM trajectory data, respectively. The results of path TTD estimation demonstrate the advantage of the proposed copula-based approach, compared with the convolution model without capturing segments correlation and the empirical distribution fitting methods. Furthermore, when considering the segments correlation effect, it was found that the estimated path TTR is more accurate than that by the convolution model. 相似文献
99.
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. 相似文献
100.
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. 相似文献