首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   730篇
  免费   33篇
公路运输   124篇
综合类   301篇
水路运输   131篇
铁路运输   112篇
综合运输   95篇
  2023年   3篇
  2022年   8篇
  2021年   13篇
  2020年   21篇
  2019年   13篇
  2018年   23篇
  2017年   22篇
  2016年   33篇
  2015年   29篇
  2014年   66篇
  2013年   48篇
  2012年   68篇
  2011年   68篇
  2010年   52篇
  2009年   51篇
  2008年   41篇
  2007年   54篇
  2006年   55篇
  2005年   27篇
  2004年   14篇
  2003年   6篇
  2002年   8篇
  2001年   11篇
  2000年   7篇
  1999年   4篇
  1998年   4篇
  1997年   3篇
  1996年   2篇
  1995年   1篇
  1993年   1篇
  1992年   1篇
  1991年   2篇
  1988年   2篇
  1987年   1篇
  1986年   1篇
排序方式: 共有763条查询结果,搜索用时 46 毫秒
171.
赵峰 《交通标准化》2012,(21):64-68
实现驾驶人实际道路考试的自动化,需要采集驾驶人、考车及周边静态物体、动态物体的各种参数,仅使用传统的传感检测技术难以满足要求.载波相位实时动态差分(RTK)GPS定位技术、超声波动态测距技术和驾驶人视线方向视频检测技术是三种新的检测技术,可大大提高实际道路考试的自动化检测率,提高整个实际道路考试系统的自动化考试程度,且能保证考试要求的检测精度和实时性要求.  相似文献   
172.
This study examined the network sensor location problem by using heterogeneous sensor information to estimate link-based network origin–destination (O–D) demands. The proposed generalized sensor location model enables different sensors’ traffic monitoring capabilities to be used efficiently and the optimal number and deployment locations of both passive- and active-type sensors to be determined simultaneously without path enumeration. The proposed sensor location model was applied to solve the network O–D demand estimation problem. One unique aspect of the proposed model and solution algorithms is that they provide satisfactory network O–D demand estimates without requiring unreasonable assumptions of known prior information on O–D demands, turning proportions, or route choice probabilities. Therefore, the proposed model and solution algorithms can be practically used in numerous offline transportation planning and online traffic operation applications.  相似文献   
173.
This paper describes a model to synchronize the management and query of temporal and spatially referenced transportation data in geographic information systems (GIS). The model employs a method referred to as dynamic location, which facilitates spatial intersect queries from geographic shapes without the use of topological relationships. This is the inverse of how dynamic segmentation works in GIS. In contrast to dynamic segmentation, dynamic location stores geometry as an object within a single database field. This is an efficient, precise iconic model superseding the need for data decomposition into a complex set of tables. As an object model, the dynamic location process lends itself to high performance in an Internet, data-intensive, enterprise environment. Linear events are stored as {x, y} features, and not referenced to any route system. Route systems are built from {x, y, m} values (m for measure) and serve as number lines for mathematical operations. Any {x, y} object can then be referenced to either the Cartesian grid or any selected number line. This method offers the benefits of linear referencing, while making full use of a stable geodetic datum. Combinations of any {x, y} events may be placed over any {x, y, m} number line (route) and an intersect determined by looking through stacked {x, y, m} vertices of the coincident shapes. Since both geometry and shape reside in the same record, the use of “begin” and “end” dates facilitates full spatial and temporal version control. From a business process perspective, this creates a spatially enabled database, pulling GIS business functions back into the information technology mainstream.  相似文献   
174.
The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin–destination pair. In the extensive literature on this challenging network design problem, it has widely been assumed that the subgraph induced by the hub nodes is complete. Relaxation of this basic assumption constitutes the starting point of the present work. In this study, we provide a uniform modeling treatment to all the single allocation variants of the existing hub location problems, under the incomplete hub network design. No network structure other than connectivity is imposed on the induced hub network. Within this context, the single allocation incomplete p-hub median, the incomplete hub location with fixed costs, the incomplete hub covering, and the incomplete p-hub center network design problems are defined, and efficient mathematical formulations for these problems with O(n3) variables are introduced. Computational analyses with these formulations are presented on the various instances of the CAB data set and on the Turkish network.  相似文献   
175.
新经济形态下,全球政治、经济形势瞬息万变,多种人为和自然因素导致商业供应链的生存环境日益严峻. 跨境供应链网络作为典型的时效性和运营环境等都具有极大不确定性的复杂网络,研究其鲁棒性问题具有一定的理论意义和实际应用场景. 首先阐明了跨境供应链网络的内涵,认为海外仓的选址优化是控制网络鲁棒性的重要手段;随后基于最小最大后悔值构建了海外仓的鲁棒性选址模型,利用情景松弛算法对模型进行求解. 算例分析结果证明,所构建的海外仓鲁棒性选址模型及算法适用于跨境供应链网络情景.  相似文献   
176.
徐建宁 《城市道桥与防洪》2020,(3):80-82,85,M0011
为保证某漫水桥的正常通行,在考虑施工现场条件的基础上,设计了一种施工便道用漫水桥结构。介绍该漫水桥的结构设计,对其结构安全进行检算,并从桥位、桥面高程、桥型、桥台和行车道等方面总结设计思路。结果表明,该施工便道用漫水桥结构设计总体上安全可靠,将该漫水桥应用于现场施工,使用期间漫水桥结构稳定,效果良好。  相似文献   
177.
This study is the first in the literature to model the joint equilibrium of departure time and parking location choices when commuters travel with autonomous vehicles (AVs). With AVs, walking from parking spaces to the work location is not needed. Instead, AVs will drop off the commuters at the workplace and then drive themselves to the parking spaces. In this context, the equilibrium departure/arrival profile is different from the literature with non-autonomous vehicles (non-AVs). Besides modeling the commuting equilibrium, this study further develops the first-best time-dependent congestion tolling scheme to achieve the system optimum. Also, a location-dependent parking pricing scheme is developed to replace the tolling scheme. Furthermore, this study discusses the optimal parking supply to minimize the total system cost (including both the travel cost and the social cost of parking supply) under either user equilibrium or system optimum traffic flow pattern. It is found that the optimal planning of parking can be different from the non-AV situation, since the vehicles can drive themselves to parking spaces that are further away from the city center and walking of commuters is avoided. This paper sheds light on future parking supply planning and traffic management.  相似文献   
178.
In this paper, we present a case study on planning the locations of public electric vehicle (EV) charging stations in Beijing, China. Our objectives are to incorporate the local constraints of supply and demand on public EV charging stations into facility location models and to compare the optimal locations from three different location models. On the supply side, we analyse the institutional and spatial constraints in public charging infrastructure construction to select the potential sites. On the demand side, interviews with stakeholders are conducted and the ranking-type Delphi method is used when estimating the EV demand with aggregate data from municipal statistical yearbooks and the national census. With the estimated EV demand, we compare three classic facility location models – the set covering model, the maximal covering location model, and the p-median model – and we aim to provide policy-makers with a comprehensive analysis to better understand the effectiveness of these traditional models for locating EV charging facilities. Our results show that the p-median solutions are more effective than the other two models in the sense that the charging stations are closer to the communities with higher EV demand, and, therefore, the majority of EV users have more convenient access to the charging facilities. From the experiments of comparing only the p-median and the maximal covering location models, our results suggest that (1) the p-median model outperforms the maximal covering location model in terms of satisfying the other’s objective, and (2) when the number of charging stations to be built is large, or when minor change is required, the solutions to both models are more stable as p increases.  相似文献   
179.
针对盐泰锡常宜铁路越江问题,分析区域沿江城市规划、区域过江通道、水文、地质特征与河势,提出长江桥位线路方案。最后,通过长江特大桥建桥条件及引入泰锡常地区条件等全面系统分析,选出江阴铁路大桥方案为合理方案。  相似文献   
180.
城市快速通道跨越铁路大型编组站桥梁方案比选研究   总被引:3,自引:2,他引:1  
郑州市农业路快速通道工程上跨郑州北铁路编组站30余股道线及京广铁路,同时桥下既有道路下穿郑州北编组站。桥址处密布框架桥、公路桥,桥梁建设的可行性墩位少,施工方案影响桥梁方案。研究并选择合理的桥梁方案对本工程十分必要。通过对桥址处多个可行性墩位的研究,选择合理的施工方案和孔跨布置方案,进而确定4个桥梁方案,再从铁路安全、技术、工期、经济等方面对桥梁方案进行详细的分析比较,推荐合理的桥梁方案。比选结果表明:(126+200+126)m双塔斜拉桥为推荐桥梁方案,该桥梁方案的研究过程及方法可为同类型涉铁工程设计提供参考和借鉴。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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