首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11315篇
  免费   334篇
公路运输   2785篇
综合类   1641篇
水路运输   3369篇
铁路运输   1312篇
综合运输   2542篇
  2023年   70篇
  2022年   256篇
  2021年   256篇
  2020年   155篇
  2019年   157篇
  2018年   255篇
  2017年   176篇
  2016年   222篇
  2015年   218篇
  2014年   398篇
  2013年   1430篇
  2012年   611篇
  2011年   687篇
  2010年   520篇
  2009年   633篇
  2008年   544篇
  2007年   542篇
  2006年   468篇
  2005年   467篇
  2004年   346篇
  2003年   222篇
  2002年   190篇
  2001年   177篇
  2000年   175篇
  1999年   113篇
  1998年   137篇
  1997年   118篇
  1996年   146篇
  1995年   160篇
  1994年   91篇
  1993年   192篇
  1992年   162篇
  1991年   78篇
  1990年   85篇
  1989年   58篇
  1988年   74篇
  1987年   65篇
  1986年   59篇
  1985年   77篇
  1984年   73篇
  1983年   73篇
  1982年   73篇
  1981年   95篇
  1980年   68篇
  1979年   91篇
  1978年   56篇
  1977年   69篇
  1976年   53篇
  1975年   65篇
  1974年   50篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
941.
Competition and disruption in a dynamic urban supply chain   总被引:1,自引:0,他引:1  
Rapid changes and complexities in business environments have stressed the importance of interactions between partners and competitors, leading supply chains to become the most important element of contemporary business environments. There is a concomitant need for foresight in describing supply chain performance in all operating environments, including those involving punctuated disruptions. Furthermore, the urban metropolis is now widely recognized to be an environment which is especially vulnerable to supply chain disruptions and for which integrated supply chain decisions can produce very substantial net benefits. Accordingly, this paper presents a dynamic supply chain network model formulated as a differential variational inequality; the model is fashioned to allow consideration of supply chain disruption threats to producers, freight carriers, and retail enterprises. The DVI is solved using a fixed-point algorithm, and a simple numerical example, introduced to illustrate how the impacts of supply chain disruptions may be quantified, is presented.  相似文献   
942.
943.
When analysing the effects of transport policies it is important to adequately control for heterogeneity: previous studies note that ignoring heterogeneity biases the estimated welfare effects of tolling. This paper examines the effects of tolling, in a bottleneck model, with a continuously distributed value of time. With homogeneous users, first-best public tolling has no effect on prices. With heterogeneity it does: low values of time lose, and high values of time gain. The average congestion externality decreases with the heterogeneity in the value of time. Consequently, the welfare gain of first-best tolling also decreases. The more heterogeneous the value of time is, the lower the relative efficiency of a public pay-lane. This finding contrasts with the previous literature. Earlier studies, using static flow congestion, conclude that the relative efficiency increases with this type of heterogeneity. With more heterogeneity in the value of time, the relative efficiency of a private pay-lane is also lower, while that of a public time-invariant toll is higher. Our results suggest that the welfare gains of different tolling schemes are affected differently by heterogeneity. Further, the impact of heterogeneity on the effects of a policy also depends on the type of congestion considered.  相似文献   
944.
In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.  相似文献   
945.
Node models for macroscopic simulation have attracted relatively little attention in the literature. Nevertheless, in dynamic network loading (DNL) models for congested road networks, node models are as important as the extensively studied link models. This paper provides an overview of macroscopic node models found in the literature, explaining both their contributions and shortcomings. A formulation defining a generic class of first order macroscopic node models is presented, satisfying a list of requirements necessary to produce node models with realistic, consistent results. Defining a specific node model instance of this class requires the specification of a supply constraint interaction rule and (optionally) node supply constraints. Following this theoretical discussion, specific macroscopic node model instances for unsignalized and signalized intersections are proposed. These models apply an oriented capacity proportional distribution of the available supply over the incoming links of a node. A computationally efficient algorithm to solve the node models exactly is included.  相似文献   
946.
In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.  相似文献   
947.
In this paper a new traffic flow model for congested arterial networks, named shockwave profile model (SPM), is presented. Taking advantage of the fact that traffic states within a congested link can be simplified as free-flow, saturated, and jammed conditions, SPM simulates traffic dynamics by analytically deriving the trajectories of four major shockwaves: queuing, discharge, departure, and compression waves. Unlike conventional macroscopic models, in which space is often discretized into small cells for numerical solutions, SPM treats each homogeneous road segment with constant capacity as a section; and the queuing dynamics within each section are described by tracing the shockwave fronts. SPM is particularly suitable for simulating traffic flow on congested signalized arterials especially with queue spillover problems, where the steady-state periodic pattern of queue build-up and dissipation process may break down. Depending on when and where spillover occurs along a signalized arterial, a large number of queuing patterns may be possible. Therefore it becomes difficult to apply the conventional approach directly to track shockwave fronts. To overcome this difficulty, a novel approach is proposed as part of the SPM, in which queue spillover is treated as either extending a red phase or creating new smaller cycles, so that the analytical solutions for tracing the shockwave fronts can be easily applied. Since only the essential features of arterial traffic flow, i.e., queue build-up and dissipation, are considered, SPM significantly reduces the computational load and improves the numerical efficiency. We further validated SPM using real-world traffic signal data collected from a major arterial in the Twin Cities. The results clearly demonstrate the effectiveness and accuracy of the model. We expect that in the future this model can be applied in a number of real-time applications such as arterial performance prediction and signal optimization.  相似文献   
948.
A recent study reported that the Macroscopic Fundamental Diagram of a medium size city exhibited a clockwise hysteresis loop on a day in which a major disturbance caused many drivers to use unfamiliar routes. It is shown below that, even in a perfectly symmetric network with uniform demand, clockwise loops are to be expected when there are disturbances, especially if the disturbances cause a significant fraction of the drivers to not change routes adaptively. It is also shown that when drivers are not adaptive networks are inherently more unstable as they recover from congestion than as they are loaded. In other words, during recovery congestion tends more strongly toward unevenness because very congested areas clear more slowly than less congested areas. Since it is known that uneven congestion distributions reduce network flows, it follows that lower network flows should arise during recovery, resulting in clockwise loops. Fortunately, the presence of a sufficient number of drivers that choose routes adaptively to avoid congested areas helps to even out congestion during recovery, increasing flow. Thus, clockwise loops are less likely to occur when driver adaptivity is high.  相似文献   
949.
This paper proposes a frequency-based assignment model that considers travellers probability of finding a seat in their perception of route cost and hence also their route choice. The model introduces a “fail-to-sit” probability at boarding points with travel costs based on the likelihood of travelling seated or standing. Priority rules are considered; in particular it is assumed that standing on-board passengers will occupy any available seats of alighting passengers before newly boarding passengers can fill any remaining seats. At the boarding point passengers are assumed to mingle, meaning that FIFO is not observed, as is the case for many crowded bus and metro stops, particularly in European countries. The route choice considers the common lines problem and an user equilibrium solution is sought through a Markov type network loading process and the method of successive averages. The model is first illustrated with a small example network before being applied to the inner zone of London’s underground network. The effect of different values passengers might attach to finding a seat are illustrated. Applications of the model for transit planning as well as for information provision at the journey planner stage are discussed.  相似文献   
950.
Microeconomic optimisation of scheduled public transport operations has traditionally focused on finding optimal values for the frequency of service, capacity of vehicles, number of lines and distance between stops. In addition, however, there exist other elements in the system that present a trade-off between the interests of users and operators that have not received attention in the literature, such as the optimal selection of a fare payment system and a designed running speed (i.e., the cruising speed that buses maintain in between two consecutive stops). Alternative fare payment methods (e.g., on-board and off-board, payment by cash, magnetic strip or smart card) have different boarding times and capital costs, with the more efficient systems such as a contactless smart card imposing higher amounts of capital investment. Based on empirical data from several Bus Rapid Transit systems around the world, we also find that there is a positive relationship between infrastructure cost per kilometre and commercial speed (including stops), achieved by the buses, which we further postulate as a linear relationship between infrastructure investment and running speed. Given this context, we develop a microeconomic model for the operation of a bus corridor that minimises total cost (users and operator) and has five decision variables: frequency, capacity of vehicles, station spacing, fare payment system and running speed, thus extending the traditional framework. Congestion, induced by bus frequency, plays an important role in the design of the system, as queues develop behind high demand bus stops when the frequency is high. We show that (i) an off-board fare payment system is the most cost effective in the majority of circumstances; (ii) bus congestion results in decreased frequency while fare and bus capacity increase, and (iii) the optimal running speed grows with the logarithm of demand.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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