scholarly journals Dynamic Adjustment Strategy of Rail Guide Vehicle

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Wenbin Liu ◽  
Dongbing Liu

For the dynamic adjustment strategy of intelligent rail guide vehicle, the dynamic planning model has been built with the longest working time in the paper. In solving this problem, the longest target of the rail guide vehicles’ running time is converted to find the optimal moving path of the rail guide vehicles. Drawing on the shortest path idea, the model uses the Floyd algorithm and the simulated annealing algorithm. The longest running time of the rail guide vehicles in the model is the innovation point in the paper. When the rail guide vehicles path is optimal, when the rail guide vehicles is the busiest, the system is the most efficient.

2013 ◽  
Vol 312 ◽  
pp. 506-510
Author(s):  
Jiang Ze Hu ◽  
An Ni Peng ◽  
Xin Zhong Lu

The efficiency E of a punch for making printed wiring boards is decided by its cost and time. The weight of cost and time is different in different companies. In this paper, we establish a bi-object programming model to measure E. We use an algorithm for obtaining an order of tool switching. Considering how to calculate the shortest path for every tool, we compare three modern optimizationalgorithms. We find Ant colony Algorithm is best in computing the shortest path, but it will cost a lot of time in running. Genetic Algorithm is better than Simulated Annealing Algorithm in time and cost. We make some improvements on these algorithms.


Sign in / Sign up

Export Citation Format

Share Document