首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1124篇
  免费   10篇
公路运输   217篇
综合类   312篇
水路运输   74篇
铁路运输   90篇
综合运输   441篇
  2022年   6篇
  2021年   17篇
  2020年   9篇
  2019年   5篇
  2018年   55篇
  2017年   41篇
  2016年   53篇
  2015年   69篇
  2014年   78篇
  2013年   84篇
  2012年   60篇
  2011年   103篇
  2010年   41篇
  2009年   56篇
  2008年   65篇
  2007年   120篇
  2006年   100篇
  2005年   78篇
  2004年   40篇
  2003年   17篇
  2002年   10篇
  2001年   16篇
  2000年   2篇
  1999年   3篇
  1998年   3篇
  1997年   2篇
  1994年   1篇
排序方式: 共有1134条查询结果,搜索用时 328 毫秒
951.
Ramp metering (RM) is the most direct and efficient tool for the motorway traffic flow management. However, because of the usually short length of the on-ramps, RM is typically deactivated to avoid interference of the created ramp queue with adjacent street traffic. By the integration of local RM with mainstream traffic flow control (MTFC) enabled via variable speed limits (VSL), control operation upstream of active bottlenecks could be continued even if the on-ramp is full or if the RM lower bound has been reached. Such integration is proposed via the extension of an existing local cascade feedback controller for MTFC-VSL by use of a split-range-like scheme that allows different control periods for RM and MTFC-VSL. The new integrated controller remains simple yet efficient and suitable for field implementation. The controller is evaluated in simulation for a real motorway infrastructure (a ring-road) fed with real (measured) demands and compared to stand-alone RM or MTFC-VSL, both with feedback and optimal control results. The controller’s performance is shown to meet the specifications and to approach the optimal control results for the investigated scenario.  相似文献   
952.
The forecasting of short-term traffic flow is one of the key issues in the field of dynamic traffic control and management. Because of the uncertainty and nonlinearity, short-term traffic flow forecasting could be a challenging task. Artificial Neural Network (ANN) could be a good solution to this issue as it is possible to obtain a higher forecasting accuracy within relatively short time through this tool. Traditional methods for traffic flow forecasting generally based on a separated single point. However, it is found that traffic flows from adjacent intersections show a similar trend. It indicates that the vehicle accumulation and dissipation influence the traffic volumes of the adjacent intersections. This paper presents a novel method, which considers the travel flows of the adjacent intersections when forecasting the one of the middle. Computational experiments show that the proposed model is both effective and practical.  相似文献   
953.
We simultaneously analyze the effects of alternative noise sources to isolate their relative harms. This research adds to the literature, which has only analyzed one noise source or has aggregated the noise levels of different sources. Flight noise had the most negative effect on housing prices, and road and train noises had similar but smaller effects.  相似文献   
954.
This paper extends the continuum signalized intersection model exhaustively studied in Han et al. (2014) to more accurately account for three realistic complications: signal offsets, queue spillbacks, and complex signal phasing schemes. The model extensions are derived theoretically based on signal cycle, green split, and offset, and are shown to approximate well traffic operations at signalized intersections treated using the traditional (and more realistic) on-and-off model. We propose a generalized continuum signal model, which explicitly handles complex vehicle spillback patterns on signalized networks with provable error estimates. Under mild conditions, the errors are small and bounded by fixed values that do not grow with time. Overall, this represents a significant improvement over the original continuum model, which had errors that grew quickly with time in the presence of any queue spillbacks and for which errors were not explicitly derived for different offset cases. Thus, the new model is able to more accurately approximate traffic dynamics in large networks with multiple signals under more realistic conditions. We also qualitatively describe how this new model can be applied to several realistic intersection configurations that might be encountered in typical urban networks. These include intersections with multiple entry and exit links, complex signal phasing, all-red times, and the presence of dedicated turning lanes. Numerical tests of the models show remarkable consistency with the on-and-off model, as expected from the theory, with the added benefit of significant computational savings and higher signal control resolution when using the continuum model.  相似文献   
955.
This paper shows that the behavior of driver models, either individually or entangled in stochastic traffic simulation, is affected by the accuracy of empirical vehicle trajectories. To this aim, a “traffic-informed” methodology is proposed to restore physical and platoon integrity of trajectories in a finite time–space domain, and it is applied to one NGSIM I80 dataset. However, as the actual trajectories are unknown, it is not possible to verify directly whether the reconstructed trajectories are really “nearer” to the actual unknowns than the original measurements. Therefore, a simulation-based validation framework is proposed, that is also able to verify indirectly the efficacy of the reconstruction methodology. The framework exploits the main feature of NGSIM-like data that is the concurrent view of individual driving behaviors and emerging macroscopic traffic patterns. It allows showing that, at the scale of individual models, the accuracy of trajectories affects the distribution and the correlation structure of lane-changing model parameters (i.e. drivers heterogeneity), while it has very little impact on car-following calibration. At the scale of traffic simulation, when models interact in trace-driven simulation of the I80 scenario (multi-lane heterogeneous traffic), their ability to reproduce the observed macroscopic congested patterns is sensibly higher when model parameters from reconstructed trajectories are applied. These results are mainly due to lane changing, and are also the sought indirect validation of the proposed data reconstruction methodology.  相似文献   
956.
In this study, to incorporate realistic discrete stochastic capacity distribution over a large number of sampling days or scenarios (say 30–100 days), we propose a multi-scenario based optimization model with different types of traveler knowledge in an advanced traveler information provision environment. The proposed method categorizes commuters into two classes: (1) those with access to perfect traffic information every day, and (2) those with knowledge of the expected traffic conditions (and related reliability measure) across a large number of different sampling days. Using a gap function framework or describing the mixed user equilibrium under different information availability over a long-term steady state, a nonlinear programming model is formulated to describe the route choice behavior of the perfect information (PI) and expected travel time (ETT) user classes under stochastic day-dependent travel time. Driven by a computationally efficient algorithm suitable for large-scale networks, the model was implemented in a standard optimization solver and an open-source simulation package and further applied to medium-scale networks to examine the effectiveness of dynamic traveler information under realistic stochastic capacity conditions.  相似文献   
957.
With the availability of large volumes of real-time traffic flow data along with traffic accident information, there is a renewed interest in the development of models for the real-time prediction of traffic accident risk. One challenge, however, is that the available data are usually complex, noisy, and even misleading. This raises the question of how to select the most important explanatory variables to achieve an acceptable level of accuracy for real-time traffic accident risk prediction. To address this, the present paper proposes a novel Frequent Pattern tree (FP tree) based variable selection method. The method works by first identifying all the frequent patterns in the traffic accident dataset. Next, for each frequent pattern, we introduce a new metric, herein referred to as the Relative Object Purity Ratio (ROPR). The ROPR is then used to calculate the importance score of each explanatory variable which in turn can be used for ranking and selecting the variables that contribute most to explaining the accident patterns. To demonstrate the advantages of the proposed variable selection method, the study develops two traffic accident risk prediction models, based on accident data collected on interstate highway I-64 in Virginia, namely a k-nearest neighbor model and a Bayesian network. Prior to model development, two variable selection methods are utilized: (1) the FP tree based method proposed in this paper; and (2) the random forest method, a widely used variable selection method, which is used as the base case for comparison. The results show that the FP tree based accident risk prediction models perform better than the random forest based models, regardless of the type of prediction models (i.e. k-nearest neighbor or Bayesian network), the settings of their parameters, and the types of datasets used for model training and testing. The best model found is a FP tree based Bayesian network model that can predict 61.11% of accidents while having a false alarm rate of 38.16%. These results compare very favorably with other accident prediction models reported in the literature.  相似文献   
958.
This paper presents a trajectory clustering method to discover spatial and temporal travel patterns in a traffic network. The study focuses on identifying spatially distinct traffic flow groups using trajectory clustering and investigating temporal traffic patterns of each spatial group. The main contribution of this paper is the development of a systematic framework for clustering and classifying vehicle trajectory data, which does not require a pre-processing step known as map-matching and directly applies to trajectory data without requiring the information on the underlying road network. The framework consists of four steps: similarity measurement, trajectory clustering, generation of cluster representative subsequences, and trajectory classification. First, we propose the use of the Longest Common Subsequence (LCS) between two vehicle trajectories as their similarity measure, assuming that the extent to which vehicles’ routes overlap indicates the level of closeness and relatedness as well as potential interactions between these vehicles. We then extend a density-based clustering algorithm, DBSCAN, to incorporate the LCS-based distance in our trajectory clustering problem. The output of the proposed clustering approach is a few spatially distinct traffic stream clusters, which together provide an informative and succinct representation of major network traffic streams. Next, we introduce the notion of Cluster Representative Subsequence (CRS), which reflects dense road segments shared by trajectories belonging to a given traffic stream cluster, and present the procedure of generating a set of CRSs by merging the pairwise LCSs via hierarchical agglomerative clustering. The CRSs are then used in the trajectory classification step to measure the similarity between a new trajectory and a cluster. The proposed framework is demonstrated using actual vehicle trajectory data collected from New York City, USA. A simple experiment was performed to illustrate the use of the proposed spatial traffic stream clustering in application areas such as network-level traffic flow pattern analysis and travel time reliability analysis.  相似文献   
959.
Traffic flow theory has come to a point where conventional, fixed time averaged data are limiting our insight into critical behavior both at the macroscopic and microscopic scales. This paper develops a methodology to measure relationships of density and vehicle spacing on freeways. These relationships are central to most traffic flow theories but have historically been difficult to measure empirically. The work leads to macroscopic flow-density and microscopic speed-spacing relationships in the congested regime derived entirely from dual loop detector data and then verified against the NGSIM data set. The methodology eliminates the need to seek out stationary conditions and yields clean relationships that do not depend on prior assumptions of the curve shape before fitting the data. Upon review of the clean empirical relationships a key finding of this work is the fact that many of the critical parameters of the macroscopic flow-density and microscopic speed-spacing relationships depend on vehicle length, e.g., upstream moving waves should travel through long vehicles faster than through short vehicles. Thus, the commonly used assumption of a homogeneous vehicle fleet likely obscures these important phenomena. More broadly, if waves travel faster or slower depending on the length of the vehicles through which the waves pass, then the way traffic is modeled should be updated to explicitly account for inhomogeneous vehicle lengths.  相似文献   
960.
Vehicle flow forecasting is of crucial importance for the management of road traffic in complex urban networks, as well as a useful input for route planning algorithms. In general traffic predictive models rely on data gathered by different types of sensors placed on roads, which occasionally produce faulty readings due to several causes, such as malfunctioning hardware or transmission errors. Filling in those gaps is relevant for constructing accurate forecasting models, a task which is engaged by diverse strategies, from a simple null value imputation to complex spatio-temporal context imputation models. This work elaborates on two machine learning approaches to update missing data with no gap length restrictions: a spatial context sensing model based on the information provided by surrounding sensors, and an automated clustering analysis tool that seeks optimal pattern clusters in order to impute values. Their performance is assessed and compared to other common techniques and different missing data generation models over real data captured from the city of Madrid (Spain). The newly presented methods are found to be fairly superior when portions of missing data are large or very abundant, as occurs in most practical cases.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号