全文获取类型
收费全文 | 2950篇 |
免费 | 126篇 |
专业分类
公路运输 | 606篇 |
综合类 | 1313篇 |
水路运输 | 581篇 |
铁路运输 | 373篇 |
综合运输 | 203篇 |
出版年
2024年 | 9篇 |
2023年 | 11篇 |
2022年 | 43篇 |
2021年 | 54篇 |
2020年 | 64篇 |
2019年 | 47篇 |
2018年 | 56篇 |
2017年 | 81篇 |
2016年 | 77篇 |
2015年 | 103篇 |
2014年 | 195篇 |
2013年 | 185篇 |
2012年 | 221篇 |
2011年 | 243篇 |
2010年 | 197篇 |
2009年 | 198篇 |
2008年 | 217篇 |
2007年 | 287篇 |
2006年 | 247篇 |
2005年 | 143篇 |
2004年 | 76篇 |
2003年 | 53篇 |
2002年 | 52篇 |
2001年 | 54篇 |
2000年 | 34篇 |
1999年 | 21篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 11篇 |
1995年 | 8篇 |
1994年 | 13篇 |
1993年 | 12篇 |
1992年 | 11篇 |
1991年 | 7篇 |
1990年 | 9篇 |
1989年 | 8篇 |
1988年 | 6篇 |
1987年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有3076条查询结果,搜索用时 187 毫秒
101.
To determine the spatial distribution of rental stations and bikeways in a public bike system, this paper proposes a facility location and network design model. The model is developed as a multi-objective programing problem that considers four objectives (minimizing cyclist risk, maximizing cyclist comfort, minimizing adverse impacts on traffic and maximizing service coverage) and multiple constraints (monetary budget, network connectivity, station spacing, bikeway types, station number and value ranges of decision variables). The ε-constraint method solves the programing problem for the public bike system in Daan District, Taipei City, Taiwan. The nine non-dominated alternatives generated are all markedly better than existing locations of rental stations and bikeways. Scenario analysis results indicate that increasing the construction budget for bikeways significantly improves cyclist safety and comfort whilst increasing the adverse impact on traffic. Planners can use this model to develop public bike systems that spatially integrate rental stations and bikeway networks. 相似文献
102.
Shuaian Wang 《Maritime Policy and Management》2017,44(1):62-80
This study examines how to incorporate the inventory costs of containerized cargoes into existing liner service planning models such that the designed networks could be improved while not causing extra modeling/computational burden. Two approaches are compared: (i) not considering the inventory costs at all and (ii) incorporating the inventory costs associated with onboard time and those related to transshipment by assuming a fixed connection time. The two models are compared with the ideal model capturing the exact inventory costs on a route choice problem and a capacity planning problem based on extensive randomly generated and practical numerical experiments. The results show that: first, ignoring the inventory costs in service planning models may lead to network design with much higher costs (poor network design decisions); second, in service planning models assuming weekly frequency, the inventory costs associated with onboard time could be formulated exactly, and those related to the connection time of weekly services could be approximated by assuming fixed connection time of 3.5 days for ports with 1 day’s minimum connection time and 4.5 days for ports with 2 days’ minimum connection time. 相似文献
103.
Due to the asymmetry between the time required to retrieve a container to vessel and the time required to register a container at the gate, the storage space allocation problem solves the best allocation policy of these containers that minimizes the potential number of gantry movements during the assigning process and the future retrieval process. A decision rule-based heuristic is proposed, and three properties are discovered in this research. Comprehensive numerical experiments show that the proposed heuristic can solve the real-sized instances within a second, making it possible to account for uncertainty because the re-optimization effort is negligible. Moreover, when applying the proposed heuristic to a container yard at the Port of Kaohsiung in Taiwan and considering the extreme cases, the heuristic performs even better when the number of containers increases and still requires less than 1 s to solve these extreme cases. Finally, the proposed heuristic can be applied to different layouts of storage space and various material handling machines. 相似文献
104.
105.
In this paper, three innovative car-sharing systems for urban areas are proposed, based on fleets of individual intelligent vehicles with three service characteristics: instant access, open-ended reservations and one-way trips. These features provide high flexibility but create an uneven distribution of vehicles among stations. Therefore, relocation of vehicles must be performed. Three different system procedures are proposed: in the first system, relocations are performed by users; in the other two, vehicles relocate automatically, thanks to their automation. In the first two systems, vehicles are accessible only at stations, whereas in the third they are also accessible along roads. In order to provide transport managers with a tool to test systems in different realities, an object-oriented simulator is developed. The simulation provides outputs of system performance, in terms of user waiting times and system efficiency. The proposed systems are simulated for the city of Genoa, in Italy, and a comparative analysis is presented. 相似文献
106.
结合道路运输行业安全监管现状,从道路运输行业安全监管职责和内容、监管方式、安全检查方面对道路运输行业安全监管存在的问题进行分析,并有针对性的提出了相应的建议和对策。 相似文献
107.
为了评价城市绿色交通,建立了城市绿色交通评价体系,包括环保性指标等3个评价项目和道路绿化率等8个评价指标,文章通过案例分析发现,价值函数法适用于城市绿色交通评价。采用专家打分法确定指标权重系数,并对指标进行无量纲化、同趋向化等处理,采用价值函数法计算评价体系得分。 相似文献
108.
Katharina ParryMartin L. Hazelton 《Transportation Research Part B: Methodological》2012,46(1):175-188
Estimation of origin-destination (OD) matrices from link count data is a challenging problem because of the highly indeterminate relationship between the observations and the latent route flows. Conversely, estimation is straightforward if we observe the path taken by each vehicle. We consider an intermediate problem of increasing practical importance, in which link count data is supplemented by routing information for a fraction of vehicles on the network. We develop a statistical model for these combined data sources and derive some tractable normal approximations thereof. We examine likelihood-based inference for these normal models under the assumption that the probability of vehicle tracking is known. We show that the likelihood theory can be non-standard because of boundary effects, and provide conditions under which such irregular behaviour will be observed in practice. For regular cases we outline connections with existing generalised least squares methods. We then consider estimation of OD matrices under estimated and/or misspecified models for the probability of vehicle tracking. Theoretical developments are complemented by simulation experiments and an illustrative example using a section of road network from the English city of Leicester. 相似文献
109.
压气条件下泥膜进气值测量试验研究 总被引:1,自引:0,他引:1
在压气条件下,进气是泥膜透气失效的起始点。为测量并研究泥膜在气压下的进气压力值(进气值),通过自制的试验装置,在不同压气条件下对3种泥膜进行进气值测量试验。试验结果表明: 1)由闭气排水与固结排水的差值可以辨别泥膜是否进气,得到泥膜进气值; 2)采用泥膜特征孔径D90/2代入推导公式可近似计算泥膜进气值; 3)泥膜在不同压气条件下进气值不同,增压速率越低,泥膜进气值越大; 4)在较快和较慢的增压速率下存在进气值变化趋于稳定的现象,最大进气值为最小值的2倍以上。 相似文献
110.
A vehicle assignment problem (VAP) in a road, long‐haul, passenger transportation company with heterogeneous fleet of buses is considered in the paper. The mathematical model of the VAP is formulated in terms of multiobjective, combinatorial optimization. It has a strategic, long‐term character and takes into account four criteria that represent interests of both passengers and the company's management. The decision consists in the definition of weekly operating frequency (number of rides per week) of buses on international routes between Polish and Western European cities. The VAP is solved in a step‐wise procedure. In the first step a sample of efficient (Pareto‐optimal) solutions is generated using an original metaheuristic method called Pareto Memetic Algorithm (PMA). In the second step this sample is reviewed and evaluated by the Decision Maker (DM). In this phase an interactive, multiple criteria analysis method with graphical facilities, called Light Beam Search (LBS), is applied. The method helps the DM to define his/her preferences, direct the search process and select the most satisfactory solution. 相似文献