首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   93篇
  免费   0篇
公路运输   5篇
综合类   2篇
水路运输   25篇
铁路运输   1篇
综合运输   60篇
  2022年   1篇
  2021年   4篇
  2020年   4篇
  2019年   1篇
  2018年   4篇
  2017年   1篇
  2016年   8篇
  2015年   1篇
  2014年   1篇
  2013年   17篇
  2012年   3篇
  2011年   9篇
  2010年   4篇
  2009年   4篇
  2008年   8篇
  2007年   2篇
  2006年   1篇
  2005年   1篇
  2004年   1篇
  2003年   2篇
  2002年   1篇
  2000年   1篇
  1998年   2篇
  1996年   1篇
  1986年   1篇
  1985年   4篇
  1984年   1篇
  1983年   1篇
  1981年   1篇
  1980年   2篇
  1979年   1篇
排序方式: 共有93条查询结果,搜索用时 0 毫秒
51.
    
Abstract

In this paper, the latent stochastic frontier model is used to estimate the technical efficiency of UK airports. These airports are ranked according to their technical efficiency for the period 2000–06 and the airports are disentangled and segmented by the cost frontier model, which leads us to advise the implementation of policies by segments. Economic implications arising from the study are also considered.  相似文献   
52.
    
Abstract

This paper analyzes urban multimodal transportation systems in an aggregated way. To describe the aggregate behavior of traffic in cities, use is made of an idea that is now receiving some attention: the macroscopic fundamental diagram (MFD). We demonstrate through simulation how the MFD can be used to monitor and control a real network, in this case a portion of San Francisco, using readily available input data. We then show how different modes interact on the same network and discuss how these interactions might be incorporated into an MFD for multimodal networks. The work unveils two main results: first, it confirms recent results showing that restricting access to a city's congested areas can improve mobility for all travelers, including those who endure the restrictions; and second, that dedicating street space to collective transport modes can improve accessibility for all modes, even those from which space is taken away.  相似文献   
53.
    
Abstract

This article applies a methodology for selecting carriers for the transportation of dangerous goods by road, with a special focus on risk management aspects. The methodology makes use of Stated Preference techniques and verifies the most critical risk-related variables influencing decision-making from the shippers' point of view. It embraces the planning and execution stages, an evaluation of the contracted company and a feedback process. The methodology was effectively applied to the case of liquid fuel shippers in the Brazilian middle-west region where it proved possible to identify which dangerous goods road transport company to contract in accordance with the risk management factors selected by the decision makers.  相似文献   
54.
This paper analyses the performance of freight transportation modes in Brazil – namely air, water, rail and road – from February 1996 to August 2012 by investigating their long memory properties using fractional integration and autoregressive models on monthly tonnage data. Two important features are analysed: the degree of dependence of transportation traffic across time and its seasonal structure over the period. Furthermore, the stability of parameters across the sample period is investigated, incorporating potential structural breaks in the data, which describe discontinuity in freight transportation traffic. Some policy implications are derived.  相似文献   
55.
    
We propose a dynamic linear model (DLM) for the estimation of day‐to‐day time‐varying origin–destination (OD) matrices from link counts. Mean OD flows are assumed to vary over time as a locally constant model. We take into account variability in OD flows, route flows, and link volumes. Given a time series of observed link volumes, sequential Bayesian inference is applied in order to estimate mean OD flows. The conditions under which mean OD flows may be estimated are established, and computational studies on two benchmark transportation networks from the literature are carried out. In both cases, the DLM converged to the unobserved mean OD flows when given sufficient observations of traffic link volumes despite assuming uninformative prior OD matrices. We discuss limitations and extensions of the proposed DLM. Copyright © 2017 John Wiley & Sons, Ltd.  相似文献   
56.
    
The purpose of this paper to present a cooperative scheduling algorithm for solving the Dynamic Pickup and Delivery Problem with Time Windows (DPDPTW). The idea behind cooperative waiting strategies is to calculate simultaneously the waiting times for all nodes in the solution. Classical non‐cooperative scheduling algorithms perform the scheduling for each route independently of the scheduling of the other routes. We present the Cooperative Scheduling Problem (CSP) based on the elliptical areas generated by vehicles waiting at their nodes. The CSP is solved by means of a genetic algorithm and is evaluated by using a set of benchmarks based on real‐life data found in the literature. Initially, two waiting strategies are presented: Wait‐Early‐Time scheduling and Balanced‐Departure scheduling. Extensive empirical simulations have been carried out by analyzing the degree of dynamism and the average waiting time, a new concept defined to take into account the gap between the time windows of pickup and delivery nodes. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   
57.
Present traffic assignment methods require that all possible origins and destinations of trips taking place within a study area be represented as if they were taking place to and from a small set of points or centroids. Each centroid is supposed to represent the location of all trip-ends within a given zone, and this necessarily misrepresents points located at the edges of the zone.In order to alleviate this problem (which we refer to as the spatial aggregation problem) one could use smaller zones and more centroids, but existing traffic assignment algorithms cannot efficiently handle many centroids.This paper introduces an algorithm procedure which is designed to handle a substantially larger number of centroids. In the paper that follows, the technique is further developed to take into account a continuous distribution of population.  相似文献   
58.
Transportation - This paper presents a systematic way of understanding and modeling traveler behavior in response to on-demand mobility services. We explicitly consider the sequential and yet...  相似文献   
59.
Real data show that reserving a lane for carpools on congested freeways induces a smoothing effect that is characterized by significantly higher bottleneck discharge flows (capacities) in adjacent lanes. The effect is reproducible across days and freeway sites: it was observed, without exception, in all cases tested. Predicted by an earlier theory, the effect arises because disruptive vehicle lane changing diminishes in the presence of a carpool lane. We therefore conjecture that smoothing can also be induced by other means that would reduce lane changing.The benefits can be large. Queueing analysis shows that the smoothing effect greatly reduces the times spent by people and vehicles in queues. For example, by ignoring the smoothing effect at one of the sites we analyzed one would predict that its carpool lane increased both the people-hours and the vehicle-hours traveled by well over 300%. In reality, the carpool lane reduced both measures due to smoothing. The effect is so significant that even a severely underused carpool lane can in some instances increase a freeway bottleneck’s total discharge flow. This happens for the site we analyzed when carpool demand is as low as 1200 vph.  相似文献   
60.
A field experiment in Yokohama (Japan) reveals that a macroscopic fundamental diagram (MFD) linking space-mean flow, density and speed exists on a large urban area. The experiment used a combination of fixed detectors and floating vehicle probes as sensors. It was observed that when the somewhat chaotic scatter-plots of speed vs. density from individual fixed detectors were aggregated the scatter nearly disappeared and points grouped neatly along a smoothly declining curve. This evidence suggests, but does not prove, that an MFD exists for the complete network because the fixed detectors only measure conditions in their proximity, which may not represent the whole network. Therefore, the analysis was enriched with data from GPS-equipped taxis, which covered the entire network. The new data were filtered to ensure that only full-taxi trips (i.e., representative of automobile trips) were retained in the sample. The space-mean speeds and densities at different times-of-day were then estimated for the whole study area using relevant parts of the detector and taxi data sets. These estimates were still found to lie close to a smoothly declining curve with deviations smaller than those of individual links – and entirely explained by experimental error. The analysis also revealed a fixed relation between the space-mean flows on the whole network, which are easy to estimate given the existence of an MFD, and the trip completion rates, which dynamically measure accessibility.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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