首页 | 本学科首页   官方微博 | 高级检索  
     


Flow-shop path planning for multi-automated guided vehicles in intelligent textile spinning cyber-physical production systems dynamic environment
Affiliation:1. College of Mechanical Engineering, Donghua University, Shanghai, 201620, China;2. Shenzhen International Graduate School, Tsinghua University, Shenzhen, China;1. Faculty of Industrial Engineering, Iran University of Science and Technology, Tehran, Resalat Street, Iran;2. Faculty of Operations Management, Haskaynes School of Management, University of Calgary, AB, Canada;1. Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran;2. Department of Industrial Engineering, University of Tehran, Tehran, Iran;1. School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200072, PR China;2. School of Mathematical Sciences, Liaocheng University, Liaocheng 252000, PR China;3. The State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science & Technology, Wuhan, PR China;4. School of Computer Science, Liaocheng University, Liaocheng 252000, PR China
Abstract:Aiming at the path planning and decision-making problem, multi-automated guided vehicles (AGVs) have played an increasingly important role in the multi-stage industries, e.g., textile spinning. We recast a framework to investigate the improved genetic algorithm (GA) on multi-AGV path optimization within spinning drawing frames to solve the complex multi-AGV maneuvering scheduling decision and path planning problem. The study reported in this paper simplifies the scheduling model to meet the drawing workshop's real-time application requirements. According to the characteristics of decision variables, the model divides into two decision variables: time-independent variables and time-dependent variables. The first step is to use a GA to solve the AGV resource allocation problem based on the AGV resource pool strategy and specify the sliver can's transportation task. The second step is to determine the AGV transportation scheduling problem based on the sliver can-AGV matching information obtained in the first step. One significant advantage of the presented approach is that the fitness function is calculated based on the machine selection strategy, AGV resource pool strategy, and the process constraints, determining the scheduling sequence of the AGVs to deliver can. Moreover, it discovered that double-path decision-making constraints minimize the total path distance of all AGVs, and minimizing single-path distances of each AGVs exerted. By using the improved GA, simulation results show that the total path distance was shortened.
Keywords:Path planning  Intelligent textile spinning  Automated guided vehicles  Cyber-physical production systems  Machine learning  Genetic algorithm
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号