Abstract
Automatic guided vehicles dispatching problem (AGVDP) has important applications in matrix production workshop. In this paper, we present a mathematical model for the AGVDP. Then, a new violating time decreasing method is designed to reduce the transportation cost. An effective discrete invasive weed optimization algorithm (DIWO) is proposed. In the proposed DIWO algorithm, a nearest-neighbor-based heuristic is used to generate initial population with high quality, a local search is applied to enhance the local search capability. A comprehensive calculation campaign based on 110 benchmark examples from actual factory is carried out in this paper. The comparative evaluations show that the proposed DIWO algorithm has much better performance than other algorithms.
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.
