全文获取类型
| 收费全文 | 575篇 |
| 免费 | 44篇 |
专业分类
| 公路运输 | 90篇 |
| 综合类 | 141篇 |
| 水路运输 | 132篇 |
| 铁路运输 | 143篇 |
| 综合运输 | 113篇 |
出版年
| 2025年 | 6篇 |
| 2024年 | 20篇 |
| 2023年 | 10篇 |
| 2022年 | 22篇 |
| 2021年 | 24篇 |
| 2020年 | 23篇 |
| 2019年 | 14篇 |
| 2018年 | 30篇 |
| 2017年 | 26篇 |
| 2016年 | 43篇 |
| 2015年 | 34篇 |
| 2014年 | 55篇 |
| 2013年 | 55篇 |
| 2012年 | 30篇 |
| 2011年 | 38篇 |
| 2010年 | 24篇 |
| 2009年 | 22篇 |
| 2008年 | 35篇 |
| 2007年 | 21篇 |
| 2006年 | 23篇 |
| 2005年 | 19篇 |
| 2004年 | 10篇 |
| 2003年 | 8篇 |
| 2002年 | 3篇 |
| 2001年 | 3篇 |
| 2000年 | 5篇 |
| 1999年 | 4篇 |
| 1998年 | 1篇 |
| 1997年 | 5篇 |
| 1995年 | 2篇 |
| 1993年 | 2篇 |
| 1992年 | 1篇 |
| 1989年 | 1篇 |
排序方式： 共有619条查询结果，搜索用时 15 毫秒
91.
Carpooling has been considered a solution for alleviating traffic congestion and reducing air pollution in cities. However, the quantification of the benefits of large-scale carpooling in urban areas remains a challenge due to insufficient travel trajectory data. In this study, a trajectory reconstruction method is proposed to capture vehicle trajectories based on citywide license plate recognition (LPR) data. Then, the prospects of large-scale carpooling in an urban area under two scenarios, namely, all vehicle travel demands under real-time carpooling condition and commuter vehicle travel demands under long-term carpooling condition, are evaluated by solving an integer programming model based on an updated longest common subsequence (LCS) algorithm. A maximum weight non-bipartite matching algorithm is introduced to find the optimal solution for the proposed model. Finally, road network trip volume reduction and travel speed improvement are estimated to measure the traffic benefits attributed to carpooling. This study is applied to a dataset that contains millions of LPR data recorded in Langfang, China for 1 week. Results demonstrate that under the real-time carpooling condition, the total trip volumes for different carpooling comfort levels decrease by 32–49%, and the peak-hour travel speeds on most road segments increase by 5–40%. The long-term carpooling relationship among commuter vehicles can reduce commuter trips by an average of 30% and 24% in the morning and evening peak hours, respectively, during workdays. This study shows the application potential and promotes the development of this vehicle travel mode. 相似文献
93.
Reliable travel behavior data is a prerequisite for transportation planning process. In large tourism dependent cities, tourists are the most dynamic population group whose size and travel choices remain unknown to planners. Traditional travel surveys generally observe resident travel behavior and rarely target tourists. Ubiquitous uses of social media platforms in smartphones have created a tremendous opportunity to gather digital traces of tourists at a large scale. In this paper, we present a framework on how to use location-based data from social media to gather and analyze travel behavior of tourists. We have collected data of about 67,000 users from Twitter using its search interface for Florida. We first propose several filtering steps to create a reliable sample from the collected Twitter data. An ensemble classification technique is proposed to classify tourists and residents from user coordinates. The accuracy of the proposed classifier has been compared against the state-of-the-art classification methods. Finally, different clustering methods have been used to find the spatial patterns of destination choices of tourists. Promising results have been found from the output clusters as they reveal most popular tourist spots as well as some of the emerging tourist attractions in Florida. Performance of the proposed clustering techniques has been assessed using internal clustering validation indices. We have analyzed temporal patterns of tourist and resident activities to validate the classification of the users in two separate groups of tourists and residents. Proposed filtering, identification, and clustering techniques will be significantly useful for building individual-level tourist travel demand models from social media data. 相似文献
94.
Chunsheng Li Shihui Luo Colin Cole Maksym Spiryagin Yanquan Sun 《Vehicle System Dynamics: International Journal of Vehicle Mechanics and Mobility》2017,55(12):1807-1822
This paper proposes a signal-based fault detection and isolation (FDI) system for heavy haul wagons considering the special requirements of low cost and robustness. The sensor network of the proposed system consists of just two accelerometers mounted on the front left and rear right of the carbody. Seven fault indicators (FIs) are proposed based on the cross-correlation analyses of the sensor-collected acceleration signals. Bolster spring fault conditions are focused on in this paper, including two different levels (small faults and moderate faults) and two locations (faults in the left and right bolster springs of the first bogie). A fully detailed dynamic model of a typical 40t axle load heavy haul wagon is developed to evaluate the deterioration of dynamic behaviour under proposed fault conditions and demonstrate the detectability of the proposed FDI method. Even though the fault conditions considered in this paper did not deteriorate the wagon dynamic behaviour dramatically, the proposed FIs show great sensitivity to the bolster spring faults. The most effective and efficient FIs are chosen for fault detection and classification. Analysis results indicate that it is possible to detect changes in bolster stiffness of ±25% and identify the fault location. 相似文献
95.
The turning behavior is one of the most challenging driving maneuvers under non-protected phase at mixed-flow intersections. Currently, one-dimensional simulation models focus on car-following and gap-acceptance behaviors in pre-defined lanes with few lane-changing behaviors, and they cannot model the lateral and longitudinal behaviors simultaneously, which has limitation in representing the realistic turning behavior. This paper proposes a three-layered “plan-decision-action” (PDA) framework to obtain acceleration and angular velocity in the turning process. The plan layer firstly calculates the two-dimensional optimal path and dynamically adjusts the trajectories according to interacting objects. The decision layer then uses the decision tree method to select a suitable behavior in three alternatives: car-following, turning and yielding. Finally, in the action layer, a set of corresponding operational models specify the decided behavior into control parameters. The proposed model is tested by reproducing 210 trajectories of left-turn vehicles at a two-phase mixed-flow intersection in Shanghai. As a result, the simulation reproduces the variation of trajectories, while the coverage rate of the trajectories is 88.8%. Meanwhile, both the travel time and post-encroachment time of simulation and empirical turning vehicles are similar and do not show statistically significant difference. 相似文献
96.
ABSTRACTTo avoid propagation of delays in dense railway timetables, it is important to ensure robustness. One strategy to improve robustness is to provide adequate amount of buffer times between trains. This study concerns how “scheduled minimum headways” should be determined in order to improve robustness in timetables. Scheduled minimum headways include technical minimum headway plus some buffer time. We propose a strategy to be implemented in timetables at the final stages of planning and prior to the operations. The main contributions of this study are 1) to propose a strategy where the size of the scheduled minimum headways is dependent on trains' travel times instead of a fixed-sized time slot and it is called “travel time dependent scheduled minimum headways” or TTDSMH, 2) to evaluate the effects of the new strategy on heterogeneity, speed, and the number of trains in timetables, 3) to show that a simple strategy can improve robustness without imposing major changes in timetables. The strategy is implemented in an Mixed Integer Linear Programming framework for timetabling and tested for some problem instances from Sweden. Results show that TTDSMH can improve robustness. The proposed strategy can be applied in intelligent transportation tools for railway timetabling. 相似文献
97.
This paper illustrates a ride matching method for commuting trips based on clustering trajectories, and a modeling and simulation framework with ride-sharing behaviors to illustrate its potential impact. It proposes data mining solutions to reduce traffic demand and encourage more environment-friendly behaviors. The main contribution is a new data-driven ride-matching method, which tracks personal preferences of road choices and travel patterns to identify potential ride-sharing routes for carpool commuters. Compared with prevalent carpooling algorithms, which allow users to enter departure and destination information for on-demand trips, the proposed method focuses more on regular commuting trips. The potential effectiveness of the approach is evaluated using a traffic simulation-assignment framework with ride-sharing participation using the routes suggested by our algorithm. Two types of ride-sharing participation scenarios, with and without carpooling information, are considered. A case study with the Chicago tested is conducted to demonstrate the proposed framework’s ability to support better decision-making for carpool commuters. The results indicate that with ride-matching recommendations using shared vehicle trajectory data, carpool programs for commuters contribute to a less congested traffic state and environment-friendly travel patterns. 相似文献
98.
99.
Traffic congestion has been a growing issue in many metropolitan areas during recent years, which necessitates the identification of its key contributors and development of sustainable strategies to help decrease its adverse impacts on traffic networks. Road incidents generally and crashes specifically have been acknowledged as the cause of a large proportion of travel delays in urban areas and account for 25% to 60% of traffic congestion on motorways. Identifying the critical determinants of travel delays has been of significant importance to the incident management systems, which constantly collect and store the incident duration data. This study investigates the individual and simultaneous differential effects of the relevant determinants on motorway crash duration probabilities. In particular, it applies parametric Accelerated Failure Time (AFT) hazard‐based models to develop in‐depth insights into how the crash‐specific characteristic and the associated temporal and infrastructural determinants impact the duration. AFT models with both fixed and random parameters have been calibrated on one year of traffic crash records from two major Australian motorways in South East Queensland, and the differential effects of determinants on crash survival functions have been studied on these two motorways individually. A comprehensive spectrum of commonly used parametric fixed parameter AFT models, including generalized gamma and generalized F families, has been compared with random parameter AFT structures in terms of goodness of fit to the duration data, and as a result, the random parameter Weibull AFT model has been selected as the most appropriate model. Significant determinants of motorway crash duration included traffic diversion requirement, crash injury type, number and type of vehicles involved in a crash, day of week and time of day, towing support requirement and damage to the infrastructure. A major finding of this research is that the motorways under study are significantly different in terms of crash durations; such that motorway 1 exhibits durations that are on average 19% shorter compared with the durations on motorway 2. The differential effects of explanatory variables on crash durations are also different on the two motorways. The detailed presented analysis confirms that looking at the motorway network as a whole, neglecting the individual differences between roads, can lead to erroneous interpretations of duration and inefficient strategies for mitigating travel delays along a particular motorway. 相似文献
100.
This article considers the optimisation of the sequence for clearing snow from stretches of the manoeuvring area of an airport. This issue involves the optimisation of limited resources to remove snow from taxiways and runways thereby leaving them in an acceptable condition for operating aircraft. The airfield is divided into subsets of significant stretches for the purpose of operations and target times are established during which these are open to aircraft traffic. The document contains several mathematical models each with different functions, such as the end time of the process, the sum of the end times of each stretch and gap between the estimated and the real end times. During this process, we introduce different operating restrictions on partial fulfilment of the operational targets as applied to zones of special interest, or relating to the operation of the snow‐clearing machines. The problem is solved by optimisation based on linear programming. The article gives the results of the computational tests carried out on five distinct models of the manoeuvring area, which cover increasingly complex situations and larger areas. The mathematical model is particularised for the case of the manoeuvring area of Adolfo Suarez Madrid—Barajas Airport. Copyright © 2016 John Wiley & Sons, Ltd.
- Highlights
- Optimal sequence for clearing snow from the manoeuvring area of an airport.
- Contains optimising algorithms solved using CPLEX LP‐based tree search.
- Restrictions on partial fulfilment of operational targets applied to subsets of significant stretches, used for planning the operation of snow‐clearing machines.
- Model applied to the case of the manoeuvring area of Adolfo Suárez Madrid Barajas Airport.
- Conclusions are given on the results of the computational tests carried out. There are five models of the manoeuvring area which cover increasingly complex situations and larger areas.