期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
基于Anylogic的车流径路联合优化模型研究 被引量:1
1
作者 穆阿立 《电子设计工程》 2022年第15期35-38,共4页
目前研究的铁道运输车流径路联合优化模型运输成本过高,难以达到预期效果。为了解决上述问题,基于Anylogic研究了一种新的车流径路联合优化模型。明确铁道运输车流运行的基本特征以及硬性要求,以此作为铁道运输车流径路联合优化方法的... 目前研究的铁道运输车流径路联合优化模型运输成本过高,难以达到预期效果。为了解决上述问题,基于Anylogic研究了一种新的车流径路联合优化模型。明确铁道运输车流运行的基本特征以及硬性要求,以此作为铁道运输车流径路联合优化方法的设计基础,利用Anylogic软件完成铁道运输车流径路优化结果的校验,充分考虑到车流避让、径路运行费用、运输效率等因素构建铁道运输车流径路联合优化模型。实验结果表明,规划径路长度明显短于传统方法,可保证铁道运输车流的正常运行,降低了运输成本。 展开更多
关键词 Anylogic算法 铁道运输车流径 最优径路选择 优化模型
下载PDF
Reducing energy consumption optimization selection of path transmission routing algorithm in opportunistic networks 被引量:2
2
作者 吴嘉 Yi Xi Chen Zhigang 《High Technology Letters》 EI CAS 2015年第3期321-327,共7页
Opportunistic networks are random networks and do not communicate with each other among respective communication areas.This situation leads to great difficulty in message transfer.This paper proposes a reducing energy... Opportunistic networks are random networks and do not communicate with each other among respective communication areas.This situation leads to great difficulty in message transfer.This paper proposes a reducing energy consumption optimal selection of path transmission(OSPT) routing algorithm in opportunistic networks.This algorithm designs a dynamic random network topology,creates a dynamic link,and realizes an optimized selected path.This algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic networks.According to the simulation experiment,OSPT improves deliver ratio,and reduces energy consumption,cache time and transmission delay compared with the Epidemic Algorithm and Spray and Wait Algorithm in opportunistic networks. 展开更多
关键词 opportunistic networks routing algorithm deliver ratio energy consumption transmission delay cache time
下载PDF
Tool selection and collision-free in 5-axis numerical control machining of free-form surfaces
3
作者 杨长祺 QIN +1 位作者 Datong 《Journal of Chongqing University》 CAS 2002年第2期20-23,共4页
The methodology of 5-axis cutter selection to avert collision for free-form surface machining by flat-end cutters is presented. The combination of different cutters is adopt aiming at short machining time and high pre... The methodology of 5-axis cutter selection to avert collision for free-form surface machining by flat-end cutters is presented. The combination of different cutters is adopt aiming at short machining time and high precision. The optimal small cutter is determined based on the geometric information of the points where a cutter most probably collide with the machined surface. Several larger cutters are selected to machine the surface in order to find the interference-free area. The difference of machining time for this area between the optimal small cutter and the large cutters is calculated. The functional relationship between the machining time and the radius of a cutter is established, by which the optimal number of cutters is obtained. The combination of cutters, which possesses the minimum overall machining time, is selected as the optimal cutter sizes. A case study has demonstrated the validity of the proposed methodology and algorithms. 展开更多
关键词 optimal tool selection collision-free tool path generation free-form surfaces flat-end cutter
下载PDF
Layered heuristic algorithm for multiple restriction routes
4
作者 戴伏生 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2010年第1期95-100,共6页
A layered algorithm by bidirectional searching is proposed in this paper to solve the problem that it is difficult and time consuming to reach an optimal solution of the route search with multiple parameter restrictio... A layered algorithm by bidirectional searching is proposed in this paper to solve the problem that it is difficult and time consuming to reach an optimal solution of the route search with multiple parameter restrictions for good quality of service. Firstly, a set of reachable paths to each intermediate node from the source node and the sink node based on adjacent matrix transformation are calculated respectively. Then a temporal optimal path is selected by adopting the proposed heuristic method according to a non-linear cost function. When the total number of the accumulated nodes by bidirectional searching reaches n-2, the paths from two directions to an intermediate node should be combined and several paths via different nodes from the source node to the sink node can be obtained, then an optimal path in the whole set of paths can be taken as the output route. Some simulation examples are included to show the effectiveness and efficiency of the proposed method. In addition, the proposed algorithm can be implemented with parallel computation and thus, the new algorithm has better performance in time complexity than other algorithms. Mathematical analysis indicates that the maximum complexity in time, based on parallel computation, is the same as the polynomial complexity of O(kn2-3kn+k), and some simulation results are shown to support this analysis. 展开更多
关键词 communication network quality of service routing routing algorithm route with multiple restrictions
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部