Abstract
Automated guided vehicles (AGVs) are an unmanned transport system used for the horizontal movement of materials. The dispatching and routing problem (DRP) for AGV systems involves making dispatching and routing decisions. The DRP is an important and fundamental problem in the scheduling of AGV systems, and number of studies have been conducted. However, for the application to real AGV systems, we have to consider additional constraints such as collision avoidance, the capacity of the system components, the ease of changing routes, and robustness against disturbance. This paper studies the dispatch and conflict-free routing problem of capacitated AGV systems (DCFRPC). In the DCFRPC, finite capacity for each vehicle and machine buffer is imposed, and task dispatching and conflict-free routing must be achieved. This paper formulates the DCFRPC as an integer program, and then, local/random search methods are proposed. This paper also empirically evaluates the proposed methods through computational experiments.
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 callDisclaimer: 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.
