摘要
Nowadays, the Multi-Shuttle and Multi-Station Transportation System (MMTS)<span><span><span style="font-family:;" "=""> is one of the most interesting research topics in many fields of industries. It is an effective solution to reduce unexpected accidents that occur during transportation as well as increase productivity in manufacturing. The aim of this paper is to introduce the controller design for the MMTS which is built in our BK-Recme BioMech Lab at Ho Chi Minh City University of Technology (VNU-HCM), Viet Nam. Based on the design of this system, the control algorithms will be conducted to check the operation of the whole system. To evaluate the feasibility and effectiveness of this model, we design a series of random instances for different quantities of nodes as well as the different quantities of shuttles. Our system includes 4 stations and 6 shuttles which are assembled in the serial chain system. However, the number of stations and number of shuttles can be expanded to any desired ones which are based on the requirement of the industries. In this paper, we mainly focus on the controller design of this system to make it operate in an effective way that the goods will be transported and delivered to the target station as fast as possible. In order to solve the large</span></span></span><span><span><span style="font-family:;" "="">-</span></span></span><span><span><span style="font-family:;" "="">scale instances and realistic transport prob<span>lems, we propose three algorithms for three progresses as shuttles calling</span>, path reading and shuttles communicating. The shuttles calling is to decide which <span>shuttle should be called to the star</span></span></span></span><span><span><span style="font-family:;" "="">t</span></span></span><span><span><span style="font-family:;" "="">-node. Path reading to determine the shortest</span></span></span><span><span><span style="font-family:;" "=""> <span>way to go from start-node to end-node. Finally, shuttles communicating,</span> which allow one shuttle to i
Nowadays, the Multi-Shuttle and Multi-Station Transportation System (MMTS)<span><span><span style="font-family:;" "=""> is one of the most interesting research topics in many fields of industries. It is an effective solution to reduce unexpected accidents that occur during transportation as well as increase productivity in manufacturing. The aim of this paper is to introduce the controller design for the MMTS which is built in our BK-Recme BioMech Lab at Ho Chi Minh City University of Technology (VNU-HCM), Viet Nam. Based on the design of this system, the control algorithms will be conducted to check the operation of the whole system. To evaluate the feasibility and effectiveness of this model, we design a series of random instances for different quantities of nodes as well as the different quantities of shuttles. Our system includes 4 stations and 6 shuttles which are assembled in the serial chain system. However, the number of stations and number of shuttles can be expanded to any desired ones which are based on the requirement of the industries. In this paper, we mainly focus on the controller design of this system to make it operate in an effective way that the goods will be transported and delivered to the target station as fast as possible. In order to solve the large</span></span></span><span><span><span style="font-family:;" "="">-</span></span></span><span><span><span style="font-family:;" "="">scale instances and realistic transport prob<span>lems, we propose three algorithms for three progresses as shuttles calling</span>, path reading and shuttles communicating. The shuttles calling is to decide which <span>shuttle should be called to the star</span></span></span></span><span><span><span style="font-family:;" "="">t</span></span></span><span><span><span style="font-family:;" "="">-node. Path reading to determine the shortest</span></span></span><span><span><span style="font-family:;" "=""> <span>way to go from start-node to end-node. Finally, shuttles communicating,</span> which allow one shuttle to i
