Abstract
To solve the multi-task assigement and routing optimizating problem of AGVs, this paper proposed a hybrid algorithm. Based on analysis of a practice case, it divided the working process of AGVs into two stages: loading and unloading. In the first stage, the shorts paths between loading site and unloading site were obtained via Dijkstra method. Then in next stage, a pre-processing method was applied to simplify the path network. Then the unloading travel distance was optimized by Hungarian algorithm. Through the two-section processing method, the optimal of routing design could be obtained. At last, the result of a practice case showed that the method could be used to solve the routing optimization of AGVs with multi-task assignment problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IOP Conference Series: Earth and Environmental Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
