全文获取类型
收费全文 | 470篇 |
免费 | 31篇 |
专业分类
公路运输 | 49篇 |
综合类 | 249篇 |
水路运输 | 94篇 |
铁路运输 | 57篇 |
综合运输 | 52篇 |
出版年
2024年 | 3篇 |
2023年 | 1篇 |
2022年 | 13篇 |
2021年 | 16篇 |
2020年 | 13篇 |
2019年 | 12篇 |
2018年 | 17篇 |
2017年 | 22篇 |
2016年 | 22篇 |
2015年 | 26篇 |
2014年 | 31篇 |
2013年 | 33篇 |
2012年 | 37篇 |
2011年 | 44篇 |
2010年 | 43篇 |
2009年 | 32篇 |
2008年 | 29篇 |
2007年 | 23篇 |
2006年 | 22篇 |
2005年 | 20篇 |
2004年 | 17篇 |
2003年 | 5篇 |
2002年 | 6篇 |
2001年 | 7篇 |
2000年 | 3篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1992年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有501条查询结果,搜索用时 15 毫秒
91.
在B2C外包环境下,选择合适的第三方物流提供商对成功实施物流外包至关重要。在遵循市场规律下,引入产品的需求一价格弹性因素,在考虑电商和第三方物流市场各自利益及共同利益的基础上,建立了第三方物流提供商选择问题的双层规划模型,同时利用贪婪算法的思想设计了相应的启发式算法求解。通过算例验证了模型及算法的可行性和有效性。 相似文献
92.
基于深度优先搜索的铁路站场遍历算法研究 总被引:1,自引:0,他引:1
在列车运行控制系统中,及时准确地了解列车所在位置是非常重要的。卫星定位技术GNSS(GlobalNavigation Satellite System)已经逐渐应用到列车定位技术中,在对列车进行定位时需要对定位数据的可靠性进行验证。车站的定位数据可靠性验证工作建立在对车站站场进行多次遍历获得定位数据的基础上。利用计算机仿真技术模拟列车在站场内遍历能够对现场很难实现的遍历情况进行重复测试。本文对铁路站场与有向图的相似性进行研究,建立基于铁路站场结构的拓扑模型,在此基础上结合站场实际遍历的情况与图的深度优先遍历算法思路,提出一种基于链表数据结构的连续遍历站场的算法。结合实际站场图进行遍历算法仿真,较好地实现了连续遍历并获取较高的遍历效率。 相似文献
93.
内陆集装箱空箱站场是集装箱运输公司的内陆空箱调运网络的节点,其布局合理与否对集装箱运输公司降低成本、提高服务质量有重大影响.本文通过对传统的站场选址方法进行研究,根据内陆空箱站场选址的具体特征,建立了内陆集装箱空箱站场选址的混合整数规划模型,并对传统的求解该问题的禁忌搜索算法进行了改进.通过试验表明该改进算法具有较好的全局寻优能力,为集装箱空箱站场选址优化提供了一种新的思路和方法. 相似文献
94.
在深入研究站场信号平面图的基础上,对站场信号平面图建立有向无环图的模型,阐述一种在有向无环图中动态生成二叉树的进路搜索算法。验证算法的有效性和实用性。 相似文献
95.
雷挺 《重庆交通学院学报》2007,26(B10):151-153
考虑物流配送中的网络流问题,即由某些供应点向各个需求点通过某种运输工具(货车、轮船等)供应货物的问题,目的是尽可能的降低配送成本.通过一个混和整数规划模型来描述该问题,利用网络单纯形法、拉格朗日松弛算法以及试探法为主要研究方法,有效地得到该问题一个近似程度较高的可行解. 相似文献
96.
JD多车型配送车辆调度问题的模型及其禁忌搜索算法研究 总被引:7,自引:0,他引:7
在建立多车型配送车辆调度问题的数学模型的基础上,通过设计一种新的解的表示方法建立了求解该问题的禁忌搜索算法.实验计算证明,该算法不仅可以取得很好的计算结果,而且计算效率较高,收敛速度较快,计算结果也较稳定. 相似文献
97.
With the rapid increase of educational resources, how to search for necessary educational resource quickly is one of most important issues. Educational resources have the characters of distribution and heterogeneity, which are the same as the characters of Grid resources. Therefore, the technology of Grid resources search was adopted to implement the educational resources search. Motivated by the insufficiency of currently resources search methods based on metadata, a method of extracting semantic relations between words constituting metadata is proposed. We mainly focus on acquiring synonymy, hyponymy, hypernymy and parataxis relations. In our schema, we extract texts related to metadata that will be expanded from text spatial through text extraction templates. Next, metadata will be obtained through metadata extraction templates. Finally, we compute semantic similarity to eliminate false relations and construct a semantic expansion knowledge base. The proposed method in this paper has been applied on the education grid. 相似文献
98.
Introduction Email classification can be cast into text classifi-cation (TC). Many methods have been proposed forTC, which can be extended to Email domain. Popularmethods include NaiveBayes, decision trees, supportvector machine (SVM) and association rule… 相似文献
99.
A new local search method with hybrid neighborhood for Job shop scheduling problem is developed. The proposed hybrid neighborhood is not only efficient in local search, but also can help overcome entrapments while search procedure get trapped at local optima and carry the search to areas of the feasible set with better prospect. New strategies used for breaking out of entrapments are presented and they are helpful for the procedure to improve local optima. A performance comparison of the proposed method with some best-performing algorithms on all 10-job, 10-machine benchmark problems and the other two problems generated by Fisher and Thompson ( ie. , FT6 and FT20) is made. The experiment results show the better optimal performance of the proposed algorithm. 相似文献
100.
According to the researches on theoretic basis in part I of the paper,the spanning tree algorithms solving the maximum independent set both in even network and in odd network have been developed in this part,part Ⅱ of the paper.The algorithms trans form first the general network into the pair sets network,and then decompose the pair sets network into a series of pair subsets by use of the characteristic of maximum flow passing through the pair sets network.As for the even network,the algorithm requires only one time of trans formation and decomposition,the maximum independent set can be gained without any iteration processes,and the time complexity of the algorithm is within the bound of O(|V|^3).However,as for the odd network,the algorithm consists of two stages.In the first stage,the general odd network is transformed and decomposed into the pseudo-negative envelope graphs and generalized reverse pseudo-negative envelope graphs alternately distributed at first;then the algorithm turns to the second stage,searching for the negative envelope graphs within the pseudo-negative envelope graphs only.Each time as a negative envelope graphhas been found.renew the pair sets network by iteration at once.and then tum back to the first stage.So both stages form a circulation process up to the optimum.Two available methods,the adjusting search and the picking-off search are specially developed to deal with the problems resulted from the odd network.Both of them link up with each other harmoniously and are embedded together in the algorithm.Analysis and study indicate that the time complexity of this algorithm is within the bound of O(|V|^5). 相似文献