全文获取类型
收费全文 | 478篇 |
免费 | 26篇 |
专业分类
公路运输 | 79篇 |
综合类 | 235篇 |
水路运输 | 34篇 |
铁路运输 | 20篇 |
综合运输 | 136篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 18篇 |
2017年 | 17篇 |
2016年 | 24篇 |
2015年 | 31篇 |
2014年 | 32篇 |
2013年 | 40篇 |
2012年 | 38篇 |
2011年 | 44篇 |
2010年 | 31篇 |
2009年 | 32篇 |
2008年 | 25篇 |
2007年 | 30篇 |
2006年 | 37篇 |
2005年 | 16篇 |
2004年 | 16篇 |
2003年 | 10篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 5篇 |
1999年 | 3篇 |
1998年 | 4篇 |
1996年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有504条查询结果,搜索用时 15 毫秒
11.
A number of approaches have been developed to evaluate the impact of land development on transportation infrastructure. While traditional approaches are either limited to static modeling of traffic performance or lack a strong travel behavior foundation, today’s advanced computational technology makes it feasible to model an individual traveler’s response to land development. This study integrates dynamic traffic assignment (DTA) with a positive agent-based microsimulation travel behavior model for cumulative land development impact studies. The integrated model not only enhances the behavioral implementation of DTA, but also captures traffic dynamics. It provides an advanced yet practical approach to understanding the impact of a single or series of land development projects on an individual driver’s behavior, as well as the aggregated impacts on the demand pattern and time-dependent traffic conditions. A simulation-based optimization (SBO) approach is proposed for the calibration of the modeling system. The SBO calibration approach enhances the transferability of this integrated model to other study areas. Using a case study that focuses on the cumulative land development impact along a congested corridor in Maryland, various regional and local travel behavior changes are discussed to show the capability of this tool for behavior side estimations and the corresponding traffic impacts. 相似文献
12.
This paper generalizes and extends classical traffic assignment models to characterize the statistical features of Origin-Destination (O-D) demands, link/path flow and link/path costs, all of which vary from day to day. The generalized statistical traffic assignment (GESTA) model has a clear multi-level variance structure. Flow variance is analytically decomposed into three sources, O-D demands, route choices and measurement errors. Consequently, optimal decisions on roadway design, maintenance, operations and planning can be made using estimated probability distributions of link/path flow and system performance. The statistical equilibrium in GESTA is mathematically defined. Its multi-level statistical structure well fits large-scale data mining techniques. The embedded route choice model is consistent with the settings of O-D demands considering link costs that vary from day to day. We propose a Method of Successive Averages (MSA) based solution algorithm to solve for GESTA. Its convergence and computational complexity are analyzed. Three example networks including a large-scale network are solved to provide insights for decision making and to demonstrate computational efficiency. 相似文献
13.
The development and calibration of complex traffic models demands parsimonious techniques, because such models often involve hundreds of thousands of unknown parameters. The Weighted Simultaneous Perturbation Stochastic Approximation (W-SPSA) algorithm has been proven more efficient than its predecessor SPSA (Spall, 1998), particularly in situations where the correlation structure of the variables is not homogeneous. This is crucial in traffic simulation models where effectively some variables (e.g. readings from certain sensors) are strongly correlated, both in time and space, with some other variables (e.g. certain OD flows). In situations with reasonably sized traffic networks, the difference is relevant considering computational constraints. However, W-SPSA relies on determining a proper weight matrix (W) that represents those correlations, and such a process has been so far an open problem, and only heuristic approaches to obtain it have been considered.This paper presents W-SPSA in a formally comprehensive way, where effectively SPSA becomes an instance of W-SPSA, and explores alternative approaches for determining the matrix W. We demonstrate that, relying on a few simplifications that marginally affect the final solution, we can obtain W matrices that considerably outperform SPSA. We analyse the performance of our proposed algorithm in two applications in motorway networks in Singapore and Portugal, using a dynamic traffic assignment model and a microscopic traffic simulator, respectively. 相似文献
14.
This paper presents a cost scaling based successive approximation algorithm, called ε-BA (ε-optimal bush algorithm), to solve the user equilibrium traffic assignment problem by successively refining ε-optimal flows. As ε reduces to zero, the user equilibrium solution is reached. The proposed method is a variant of bush-based algorithms, and also a variant of the min-mean cycle algorithm to solve the min-cost flow by successive approximation. In ε-BA, the restricted master problem, implying traffic equilibration restricted on a bush, is solved to ε-optimality by cost scaling before bush reconstruction. We show that ε-BA can reduce the number of flow operations substantially in contrast to Dial’s Algorithm B, as the former operates flows on a set of deliberately selected cycles whose mean values are sufficiently small. Further, the bushes can be constructed effectively even if the restricted master problem is not solved to a high level of convergence, by leveraging the ε-optimality condition. As a result, the algorithm can solve a highly precise solution with faster convergence on large-scale networks compared to our implementation of Dial’s Algorithm B. 相似文献
15.
16.
ABSTRACTThe deterministic traffic assignment problem based on Wardrop's first criterion of traffic network utilization has been widely studied in the literature. However, the assumption of deterministic travel times in these models is restrictive, given the large degree of uncertainty prevalent in urban transportation networks. In this context, this paper proposes a robust traffic assignment model that generalizes Wardrop's principle of traffic network equilibrium to networks with stochastic and correlated link travel times and incorporates the aversion of commuters to unreliable routes.The user response to travel time uncertainty is modeled using the robust cost (RC) measure (defined as a weighted combination of the mean and standard deviation of path travel time) and the corresponding robust user equilibrium (UE) conditions are defined. The robust traffic assignment problem (RTAP) is subsequently formulated as a Variational Inequality problem. To solve the RTAP, a Gradient Projection algorithm is proposed, which involves solving a series of minimum RC path sub-problems that are theoretically and practically harder than deterministic shortest path problems. In addition, an origin-based heuristic is proposed to enhance computational performance on large networks. Numerical experiments examine the computational performance and convergence characteristics of the exact algorithm and establish the accuracy and efficiency of the origin-based heuristic on various real-world networks. Finally, the proposed RTA model is applied to the Chennai road network using empirical data, and its benefits as a normative benchmark are quantified through comparisons against the standard UE and System Optimum (SO) models. 相似文献
17.
遗传算法、蚁群算法、粒子群优化算法等解决武器目标分配问题的典型方法尚不能满足工程应用的要求,为了提高舰艇对反舰导弹防御过程中的武器目标分配问题的工程化水平,采用系统分析的方法,提出一组适应舰艇火力通道组织的火力分配规则,设计了基于规则评价的武器目标分配方法,建立了评价函数及求解过程,并分析了算法的复杂度,该方法可以使目标分配结果与规则的符合度直观明确,更符合指挥员的自然决策思维过程,具有很好的工程实用价值。 相似文献
18.
Donghyung Yook 《运输规划与技术》2015,38(8):935-953
In this paper, the crowding effect in a transit vehicle is modeled in a time-expanded network that considers the daily variation in passenger flows. The study models the daily variation of in-vehicle crowding in a real large-scale transit system. A transit assignment for this real network is modeled and implemented by constructing a crowding cost function that follows the valuation of crowding and by using the reliable shortest path finding method. The direct application of the crowding model to a real network for the Utah Transit Authority indicates that crowd modeling with multi-user classes could influence public transportation system planning and affect the revenues of transit agencies. Moreover, the addition of the disutility factor, crowding, does not always appear to cause an increase in disutility for transit users. 相似文献
19.
In recent years, increasing attention has been drawn to the development of various applications of intelligent transportation systems (ITS), which are credited with the amelioration of traffic conditions in urban and regional environments. Advanced traveler information systems (ATIS) constitute an important element of ITS by providing potential travelers with information on the network's current performance both en-route and pre-trip. In order to tackle the complexity of such systems, derived from the difficulty of providing real-time estimations of current as well as forecasts of future traffic conditions, a series of models and algorithms have been initiated. This paper proposes the development of an integrated framework for real-time ATIS and presents its application on a large-scale network, that of Thessaloniki, Greece, concluding with a discussion on development and implementation challenges as well as on the advantages and limitations of such an effort. 相似文献
20.
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. 相似文献