全文获取类型
收费全文 | 556篇 |
免费 | 18篇 |
专业分类
公路运输 | 52篇 |
综合类 | 245篇 |
水路运输 | 114篇 |
铁路运输 | 120篇 |
综合运输 | 43篇 |
出版年
2024年 | 2篇 |
2022年 | 11篇 |
2021年 | 14篇 |
2020年 | 10篇 |
2019年 | 6篇 |
2018年 | 14篇 |
2017年 | 15篇 |
2016年 | 17篇 |
2015年 | 20篇 |
2014年 | 25篇 |
2013年 | 24篇 |
2012年 | 39篇 |
2011年 | 44篇 |
2010年 | 46篇 |
2009年 | 43篇 |
2008年 | 35篇 |
2007年 | 45篇 |
2006年 | 43篇 |
2005年 | 37篇 |
2004年 | 23篇 |
2003年 | 16篇 |
2002年 | 13篇 |
2001年 | 16篇 |
2000年 | 10篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1992年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有574条查询结果,搜索用时 31 毫秒
1.
2.
采用数学规划的方法从静力和动力两方面对斜腿刚构桥的几何布局进行优化设计。静力优化设计的优化目标是截面截面应力平方均值最小,动力优化设计的优化目标是结构自振周期平方和最小。采用了直接搜索法寻优。通过算例可知,这两种优化设计方法均可行,且均为刚性设计。 相似文献
3.
介绍基于设计模式的高校科研项目管理系统的设计。针对科研项目管理系统的开发,提出一个基于模式的设计方案,解决系统开发过程中功能扩展以及代码重用等问题。 相似文献
4.
基于红外搜索系统的被动测距技术研究 总被引:1,自引:0,他引:1
红外搜索系统是一种被动探测系统,量测数据中无目标的距离量;而评判来袭目标的威胁程度离不开其距离量。介绍了基于红外搜索系统的被动测距技术测量目标距离的算法、原理框图以及仿真试验与结果。 相似文献
5.
基于嵌入式系统在船舶监控方面应用的研究 总被引:1,自引:0,他引:1
采用以μCOS-Ⅱ嵌入式操作系统为平台设计的嵌入式系统控制板,实现船舶机舱(engine room)的自动监控和数据传输。涉及到数据的采集和web server的功能,使从机舱监控的数据可以直接通过船舶的局域网传送到每一个相关人员的工作间,甚至是房间里。 相似文献
6.
根据摘挂列车编组调车作业原理,将摘挂列车下落问题抽象为排序问题,提出一种基于排序二叉树的编组钩计划自动编制方法.根据待编列车序列构造排序二叉树;利用排序二叉树的有序性快速搜索出有序车组序列,将其作为下落方案的可选集.考虑邻组、暂合列内收编固定组组别和空闲组别、端组等因素,从可选集中筛选出较优的下落方案.通过定义收编固定组简化列车收编过程,实现列车收编过程的计算机自动编制.通过实例验证,采用该方法降低了选择下落方案的复杂性,减少了列车编组钩计划的调车钩数,而且可根据实际调车线数灵活调整方案. 相似文献
7.
Transportation research relies heavily on a variety of data. From sensors to surveys, data supports day-to-day operations as well as long-term planning and decision-making. The challenges that arise due to the volume and variety of data that are found in transportation research can be effectively addressed by ontologies. This opportunity has already been recognized – there are a number of existing transportation ontologies, however the relationship between them is unclear. The goal of this work is to provide an overview of the opportunities for ontologies in transportation research and operation, and to present a survey of existing transportation ontologies to serve two purposes: (1) to provide a resource for the transportation research community to aid in understanding (and potentially selecting between) existing transportation ontologies; and (2) to identify future work for the development of transportation ontologies, by identifying areas that may be lacking. 相似文献
8.
Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of expensive docking stations and kiosk machines. FFBS prevents bike theft and offers significant opportunities for smart management by tracking bikes in real-time with built-in GPS. However, like SBBS, the success of FFBS depends on the efficiency of its rebalancing operations to serve the maximal demand as possible.Bicycle rebalancing refers to the reestablishment of the number of bikes at sites to desired quantities by using a fleet of vehicles transporting the bicycles. Static rebalancing for SBBS is a challenging combinatorial optimization problem. FFBS takes it a step further, with an increase in the scale of the problem. This article is the first effort in a series of studies of FFBS planning and management, tackling static rebalancing with single and multiple vehicles. We present a Novel Mixed Integer Linear Program for solving the Static Complete Rebalancing Problem. The proposed formulation, can not only handle single as well as multiple vehicles, but also allows for multiple visits to a node by the same vehicle. We present a hybrid nested large neighborhood search with variable neighborhood descent algorithm, which is both effective and efficient in solving static complete rebalancing problems for large-scale bike sharing programs.Computational experiments were carried out on the 1 Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP) instances used previously in the literature and on three new sets of instances, two (one real-life and one general) based on Share-A-Bull Bikes (SABB) FFBS program recently launched at the Tampa campus of University of South Florida and the other based on Divvy SBBS in Chicago. Computational experiments on the 1-PDTSP instances demonstrate that the proposed algorithm outperforms a tabu search algorithm and is highly competitive with exact algorithms previously reported in the literature for solving static rebalancing problems in SBSS. Computational experiments on the SABB and Divvy instances, demonstrate that the proposed algorithm is able to deal with the increase in scale of the static rebalancing problem pertaining to both FFBS and SBBS, while deriving high-quality solutions in a reasonable amount of CPU time. 相似文献
9.
公共交通乘务调度问题是一个将车辆工作切分为一组合法班次的过程,它是NP难问题,许多求解方法的效率都与班次评价密不可分,本文通过裁剪TOPSIS方法(Technique for Order Preference by Similarity to an Ideal Solution)设计了TOPSIS班次评价方法.此外,通过裁剪变邻域搜索算法使之适合求解乘务调度问题,提出了基于变邻域搜索的乘务调度方法(Crew Scheduling Approach Based on Variable Neighbourhood Search,VNS),其中,并入了TOPSIS班次评价方法在调度过程中进行班次评价,设计了两种带概率的复合邻域结构以增加搜索的多样性,帮助跳出局部最优,在VNS中利用模拟退火算法进行局部搜索.利用中国公共交通中的11组实例进行了测试,测试结果表明,VNS优于两种新近提出的乘务调度方法,且其结果关于班次数接近于下界. 相似文献
10.
The present paper examines a Vehicle Routing Problem (VRP) of major practical importance which is referred to as the Load-Dependent VRP (LDVRP). LDVRP is applicable for transportation activities where the weight of the transported cargo accounts for a significant part of the vehicle gross weight. Contrary to the basic VRP which calls for the minimization of the distance travelled, the LDVRP objective is aimed at minimizing the total product of the distance travelled and the gross weight carried along this distance. Thus, it is capable of producing sensible routing plans which take into account the variation of the cargo weight along the vehicle trips. The LDVRP objective is closely related to the total energy requirements of the vehicle fleet, making it a credible alternative when the environmental aspects of transportation activities are examined and optimized. A novel LDVRP extension which considers simultaneous pick-up and delivery service is introduced, formulated and solved for the first time. To deal with large-scale instances of the examined problems, we propose a local-search algorithm. Towards an efficient implementation, the local-search algorithm employs a computational scheme which calculates the complex weighted-distance objective changes in constant time. Solution results are presented for both problems on a variety of well-known test cases demonstrating the effectiveness of the proposed solution approach. The structure of the obtained LDVRP and VRP solutions is compared in pursuit of interesting conclusions on the relative suitability of the two routing models, when the decision maker must deal with the weighted distance objective. In addition, results of a branch-and-cut procedure for small-scale instances of the LDVRP with simultaneous pick-ups and deliveries are reported. Finally, extensive computational experiments have been performed to explore the managerial implications of three key problem characteristics, namely the deviation of customer demands, the cargo to tare weight ratio, as well as the size of the available vehicle fleet. 相似文献