首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1024篇
  免费   39篇
公路运输   148篇
综合类   533篇
水路运输   125篇
铁路运输   115篇
综合运输   142篇
  2024年   2篇
  2023年   5篇
  2022年   23篇
  2021年   27篇
  2020年   27篇
  2019年   24篇
  2018年   38篇
  2017年   33篇
  2016年   37篇
  2015年   46篇
  2014年   52篇
  2013年   61篇
  2012年   67篇
  2011年   79篇
  2010年   72篇
  2009年   70篇
  2008年   54篇
  2007年   75篇
  2006年   70篇
  2005年   39篇
  2004年   38篇
  2003年   22篇
  2002年   16篇
  2001年   20篇
  2000年   12篇
  1999年   6篇
  1998年   9篇
  1997年   2篇
  1996年   8篇
  1995年   3篇
  1994年   5篇
  1993年   6篇
  1992年   1篇
  1991年   7篇
  1990年   4篇
  1989年   1篇
  1988年   1篇
  1984年   1篇
排序方式: 共有1063条查询结果,搜索用时 0 毫秒
461.
介绍青藏铁路行车安全监控系统实时监控程序的开发背景,分析监控需求,研究、设计程序结构,并实现各项监控功能.  相似文献   
462.
从路段流量估计OD交通量的新算法   总被引:5,自引:0,他引:5  
首先给出了一种增广的用户平衡配流问题的优化模型及求解算法,然后提出了一个从 路段流量估计OD交通量的双层规划棋型及求解算法.由于新方法再生迭代无需计算和存贮路 径流量,只需用到路段流量,因此可以适用于大型城市交通网的OD需求估计向题.  相似文献   
463.
阐述了数据分析软件BusinessObjects的运行机制,以及使用Document Agent Server模块自动生成Web页面的过程和方法,并给出了具体的应用和程序.  相似文献   
464.
The routing, scheduling and fleet deployment is an important integrated planning problem faced by liner shipping companies which also lift load from the spot market. This paper is concerned with coordinating the decisions of the assignment of ships to contractual and spot voyages, and the determination of ship routes and schedules in order to maximize profit. We propose a new model for representing voyages as nodes of a directed graph which is used to build a mixed integer programming formulation. Besides contractual and spot nodes, another type of node is put forward to represent a combination of a contractual voyage with one or more spot voyages. In addition, the concept of dominated nodes is introduced in order to discard them and reduce the effort of the search for an optimal solution. A set of test problems has been generated taking into account real world assumptions. The test problems are solved by an optimization software and computational results are reported. The results show the potential of the approach to solve test problems of moderate size.  相似文献   
465.
In this paper, we consider the continuous road network design problem with stochastic user equilibrium constraint that aims to optimize the network performance via road capacity expansion. The network flow pattern is subject to stochastic user equilibrium, specifically, the logit route choice model. The resulting formulation, a nonlinear nonconvex programming problem, is firstly transformed into a nonlinear program with only logarithmic functions as nonlinear terms, for which a tight linear programming relaxation is derived by using an outer-approximation technique. The linear programming relaxation is then embedded within a global optimization solution algorithm based on range reduction technique, and the proposed approach is proved to converge to a global optimum.  相似文献   
466.
This paper presents a method for estimating missing real-time traffic volumes on a road network using both historical and real-time traffic data. The method was developed to address urban transportation networks where a non-negligible subset of the network links do not have real-time link volumes, and where that data is needed to populate other real-time traffic analytics. Computation is split between an offline calibration and a real-time estimation phase. The offline phase determines link-to-link splitting probabilities for traffic flow propagation that are subsequently used in real-time estimation. The real-time procedure uses current traffic data and is efficient enough to scale to full city-wide deployments. Simulation results on a medium-sized test network demonstrate the accuracy of the method and its robustness to missing data and variability in the data that is available. For traffic demands with a coefficient of variation as high as 40%, and a real-time feed in which as much as 60% of links lack data, we find the percentage root mean square error of link volume estimates ranges from 3.9% to 18.6%. We observe that the use of real-time data can reduce this error by as much as 20%.  相似文献   
467.
为了解决喷水推进船在各种工况下,喷泵工作在气蚀区的问题,利用Simulink与MFC(Microsoft Foundation Class)集成的方法开发出了可用于制定喷水推进装置在回转、加速等工况下,避免喷泵在空化区运行的工作制的仿真程序.利用开发出的仿真程序对特定工况下的最大柴油机转速、最大喷泵转角以及最短加速时间做了仿真计算.该计算结果对喷水推进艇避免喷泵气蚀的操作规程有一定的参考价值.  相似文献   
468.
This paper presents a modelling and optimisation framework for deriving ramp metering and variable speed control strategies. We formulate the optimal control problems aiming to minimise the travel delay on motorways based upon a macroscopic cell transmission model of traffic. The optimal ramp metering optimisation is formulated as a linear programming (LP) while the variable speed control problem is formulated as a mixed integer LP. The optimisation models are applied to a real scenario over a section of M25 motorway in the UK. This paper also includes various analyses on the sensitivity of the optimal control solutions with respect to different network configurations and model assumptions.  相似文献   
469.
针对公路工程施工招标最高限价编制和审查中,容易忽视的问题,提出自己的观点和看法,供同行参考。  相似文献   
470.
In a transportation network, decision making parameters may change and may cause the optimum value of objective function to vary in a specific range. Therefore, managers try to identify the effects of these changes by sensitive analysis to find appropriate solutions. In this paper, first, a model for cross‐dock transportation network considering direct shipment is presented, and then an algorithm based on branch and bound algorithm and dual price concept for sensitive analysis is developed. When managers encounter problems such as budget limit, they may decide to change the capacity of trucks as a procedure to reduce the transportation costs of the network. The algorithm provides a useful lower bound on the solutions of the problems and makes it easy for the managers to eliminate inappropriate options of truck capacities, which cannot lead to cost reduction. To verify the algorithm, an example will be given at the end of the paper. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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