全文获取类型
收费全文 | 125篇 |
免费 | 4篇 |
专业分类
公路运输 | 26篇 |
综合类 | 42篇 |
水路运输 | 22篇 |
铁路运输 | 14篇 |
综合运输 | 25篇 |
出版年
2024年 | 1篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2018年 | 3篇 |
2017年 | 6篇 |
2016年 | 4篇 |
2015年 | 9篇 |
2014年 | 11篇 |
2013年 | 8篇 |
2012年 | 12篇 |
2011年 | 9篇 |
2010年 | 3篇 |
2009年 | 7篇 |
2008年 | 5篇 |
2007年 | 10篇 |
2006年 | 9篇 |
2005年 | 6篇 |
2004年 | 1篇 |
2003年 | 1篇 |
2002年 | 2篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
排序方式: 共有129条查询结果,搜索用时 15 毫秒
91.
针对铁路站场总体布置图绘制时多耦合约束的难点,基于分阶段处理耦合约束的思想,提出"断面扫描法"处理设备坐标的相对位置约束,而后将"自适应分段多比例法"用于解决比例协调约束,在最后的约束调整过程中,应用"相交可行域法",实现道岔及股道相关约束的自动处理。该研究可快速建立站场设备从原方案到总体布置图的坐标映射,实现满足所有约束条件的总体布置图的自动生成。研究成果已在若尔盖、开原西等多个站场设计中成功应用。 相似文献
92.
分析了路径规划问题及其在交通约束条件下的特点。从算法改进和模型改进两方面对路径规划算法进行了研究,在详细分析Dijkstra算法步骤和对偶法的基础上,给出了交通约束的数学模型及道路网络的相关定理。基于传统Dijkstra算法,对搜索过程中的节点和边的标记方式和规则进行了改进,提出了一种在交通约束条件下的高效路径规划算法。该算法通过减少搜索节点和标记边的次数而减少搜索过程中的运算量。仿真结果表明,该算法对偶法1/3~1/4的运算量。 相似文献
93.
分析了混流生产条件下生产作业计划的特点和MRPⅡ/ERP、JIT的局限,提出并阐述了混流生产条件基于约束理论TOC(Theory of Corstraints)制定生产作业计划的关键问题,即瓶颈环节的确定和转移问题、生产系统中批量和提前期的联合确定问题以及缓冲位置和缓冲大小的确定问题,对解决这些问题的思路和发展作了探讨。 相似文献
94.
Oscar R. P. van Schaijk 《运输规划与技术》2017,40(8):928-945
In this paper we present a novel method to improve the robustness of solutions to the Flight-to-Gate Assignment Problem (FGAP), with the aim to reduce the need for gate re-planning due to unpredicted flight schedule disturbances in the daily operations at an airport. We propose an approach in which the deterministic gate constraints are replaced by stochastic gate constraints that incorporate the inherent stochastic flight delays in such a way so as to ensure that the expected gate conflict probability of two flights assigned to the same gate at the same time does not exceed a user-specified value. The novel approach is integrated into an existing multiple time slot FGAP model that relies on a binary integer programming formulation and is tested using real-life data pertaining to Amsterdam Airport Schiphol. The results confirm that the proposed approach holds out great promise to improve the robustness of the FGAP solutions. 相似文献
95.
基于遗传算法的飞行器航迹规划研究 总被引:2,自引:0,他引:2
针对飞行器航迹规划问题展开研究,提出了一种基于遗传算法的飞行器航迹规划方法.该算法采用一种变长实值基因编码方式和一组重新设计的与之对应的进化算子.仿真实验结果表明,该算法能够快速有效地完成航迹规划任务,获得较为满意的航迹,同时也能满足在线实时规划的要求. 相似文献
96.
In this paper, we present a method for estimating the natural frequencies of various engine valve springs such as constant
pitch, two-step variable pitch, three-step variable pitch, and progressive springs. Since a valve spring’s surging amplitude
is magnified when the spring’s natural frequency coincides with the frequency of the cam profile harmonic components, estimating
the natural frequency of the spring is the first step in predicting valve spring surging phenomena. A new method for calculating
the valve spring’s natural frequency is proposed in this paper that considers the end coil effect. This method predicts not
only the natural frequency of a helical spring at a fixed number of active turns, but also the change in the natural frequency
as the spring is compressed. The experimental results demonstrate that nonlinear characteristics of engine valve springs can
be predicted from the given initial pitch curves. 相似文献
97.
A rapid path planner for autonomous ground vehicle using section collision detection 总被引:1,自引:0,他引:1
Rapid path planner plays an important role in autonomous ground vehicle (AGV) operation. Depending on the non-holonomic kinematics
constraints of AGV, its path planning problem is discussed. Since rapidly-exploring random tree (RRT) can directly take non-holonomic
constraints into consideration, it is selected to solve this problem. By applying extra constraints on the movement, the generation
of new configuration in RRT algorithm is simplified and accelerated. With section collision detection method applied, collision
detection within the planer becomes more accurate and efficient. Then a new path planner is developed. This method complies
with the non-holonomic constraints, avoids obstacles effectively and can be rapidly carried out while the vehicle is running.
Simulation shows that this path planner can complete path planning in less than 0.5 s for a 170 m×170 m area with moderate
obstacle complexity.
相似文献
98.
Incorporating time and income constraints in dynamic agent-based models of activity generation and time use: Approach and illustration 总被引:1,自引:0,他引:1
Theo A. Arentze D. Ettema Harry J.P. Timmermans 《Transportation Research Part C: Emerging Technologies》2010,18(1):71-83
Existing theories and models in economics and transportation treat households’ decisions regarding allocation of time and income to activities as a resource-allocation optimization problem. This stands in contrast with the dynamic nature of day-by-day activity-travel choices. Therefore, in the present paper we propose a different approach to model activity generation and allocation decisions of individuals and households that acknowledges the dynamic nature of the behavior. A dynamic representation of time and money allocation decisions is necessary to properly understand the impact of new technologies on day to day variations in travel and activity patterns and on performance of transportation systems. We propose an agent-based model where agents, rather than acting on the basis of a resource allocation solution for a given time period, make resource allocation decisions on a day-by-day basis taking into account day-varying conditions and at the same time respecting available budgets over a longer time horizon. Agents that share a household interact and allocate household tasks and budgets among each other. We introduce the agent-based model and formally discuss the properties of the model. The approach is illustrated on the basis of simulation of behavior in time and space. 相似文献
99.
带轴重约束货物平衡装载问题优化研究 总被引:2,自引:0,他引:2
朱向 《交通运输系统工程与信息》2015,15(5):164-171
针对考虑轴重约束集装箱卡车货物优化装载问题,建立以最大化装载率和负重心偏离度为目标,以平衡及轴重为约束条件的数学模型,设计改进型贪婪自适应搜索算法(IGASP)对问题进行求解.算法先基于启发式方法构造布局方案,再结合重心边界条件分析对获得方案进行可行性分析,对违反约束装载率较高的方案提出了两种重心调整的方法,进而将有关过程融入贪婪自适应搜索形成解的改进机制实现问题优化求解.基于现实算例的试验分析,证明所提方法求解带轴重约束货物平衡装载问题具有较好效果. 相似文献
100.