Abstract
This paper deals with a path planning problem of multiple heterogeneous Automated Guided Vehicles (AGVs). AGVs are heterogeneous as having different structures (average velocity) and functions (payload). By focusing on dispatching and routing of AGVs, we solve the problem by transform it into a multiple heterogeneous Hamiltonian path problem. We propose a heuristic based on primal-dual technique to solve the multiple heterogeneous Hamiltonian path problem. We implemented the heuristic and compared with the existing methods. The implementation results show that our proposed heuristic produces reasonable quality solutions within a short computation time.
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: International Journal of Precision Engineering and Manufacturing
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.
