摘要
以排队论解决智能加工系统的动态调度问题:将等待的CNC作为排队者,RGV作为服务机构,定义不同的服务原则和不同的松弛条件,给出不同情况的动态调度模型和求解算法。首先,提出三种服务原则:先到先服务、距离最短、距离最优。然后针对三种情况分别定义松弛条件。在只有一道工序的物料加工作业情况下,首先在先到先服务的基础上加入人工调控,以CNC等待时间最小为目标函数,使用模拟退火算法在计算出最优路径为:1→4→3→8→7→6→5→2;然后在距离最短的服务原则下进行模拟仿真,得到最优路径为:1→2→3→4→5→6→7→8;然后在距离最优的原则下,通过观察数据发现,数据存在周期性,因此可以转化为旅行商问题,通过遗传算法进行求解,得到在周期中RGV运行时间最小的路径为:1→4→3→8→7→6→5→2。
The queuing theory is used to solve the dynamic scheduling problem of intelligent processing system:the waiting CNC is used as the queuer,RGV is used as the service organization,different service principles and different relaxation conditions are defined,and dynamic scheduling models and solving algorithms for different situations are given.First,three service principles are proposed:first-come first-served,shortest distance,and optimal distance.The relaxation conditions are then defined separately for each of the three cases.In the case of material processing operations with only one process,manual adjustment is first added on a first-come-first-served basis,with the minimum CNC waiting time as the objective function,and the simulated annealing algorithm is used to calculate the optimal path:1→4→3→8→7→6→5→2;Then the shortest distance The simulation is carried out under the principle of service,and the optimal path is obtained as follows:1→2→3→4→5→6→7→8Then,under the principle of optimal distance,it is found through observation data that the data is periodic,so it can be transformed into a traveling salesman problem,which is solved by genetic algorithm.The path with the smallest RGV runtime in the cycle is:1→4→3→8→7→6→5→2.
作者
蒋朝敏
葛岩峰
李秋然
吴宇航
JIANG Chao-min;GE Yan-feng;LI Qiu-ran;WU Yu-hang(School of Metallurgy and Energy,North China University of Technology,Tangshan 063210,China;School of Science,North China University of Science and Technology,Tangshan 063210,China;School of Materials and Engineering,North China University of Technology,Tangshan 063210,China;Innovation of Mathematical Modeling in North China University of Technology Laboratory,Tangshan 063210,China;Key Laboratory of Data Science and Application of Hebei Province,Tangshan 063210,China;Tangshan Key Laboratory of Data Science,Tangshan 063210,China)
出处
《新一代信息技术》
2019年第5期1-7,共7页
New Generation of Information Technology
关键词
排队论
模拟退火
遗传算
旅行商
Queuing theory
Simulated annealing
Genetic algorithm
Travel business law
