Abstract
PurposeThe purpose of this paper is to present the development of an architecture for real‐time routing of automated guided vehicles (AGV) in a random flexible manufacturing system (FMS).Design/methodology/approachAGV routing problem is modeled using an evolutionary algorithm‐based intelligent path planning model, which handles vehicle assignments to material handling requests and makes routing decisions with the objective of maximizing the system throughput. The architecture is implemented on a 3‐layer software environment in order to evaluate the effectiveness of the proposed model.FindingsThe proposed architecture, along with the evolutionary algorithm‐based routing model, is implemented in a simulated FMS environment using hypothetical production data. In order to benchmark the performance of the path planning algorithm, the same FMS model is run by traditional dispatching rules. The analysis shows that the proposed routing model outperforms the traditional dispatching rules for real‐time routing of AGVs in many cases.Research limitations/implicationsFuture work includes expanding the scope of the current work by developing and implementing other routing models and benchmarking them against the proposed model on different performance measures.Originality/valueThe implementation of evolutionary algorithms in real‐time routing of AGVs is unique. In addition, due to its modularity, the proposed 3‐layer architecture can allow effective and efficient integration of different real‐time routing algorithms; therefore it can be used as a benchmarking platform.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.