Abstract
With the development of advanced manufacturing technology, more and more enterprises utilize automated guided vehicles to transfer materials for computer numerical control machines in the workshop....
Highlights
Automated guided vehicles (AGVs) are widely used to transport commodities and materials between workstations and warehouse.[1]
We investigate a multi-objective AGVSP problem derived from a realistic manufacturing case and propose an Improved Harmony Search–based Material Transfer Scheduling Algorithm (IHSMTSA) to solve AGVSP
In order to verify the superiority of the proposed IHSMTSA, the comparisons are conducted by incorporating the particle swarm optimization (PSO) with inertia weight; genetic algorithms (GAs) with elite selection; single-point crossover and two bit-swap mutation strategies; memetic algorithm (MA) with elite selection, single-point
Summary
Automated guided vehicles (AGVs) are widely used to transport commodities and materials between workstations and warehouse.[1] AGVs are among the most efficient methods for material handling due to their supreme routing flexibility, space utilization, product quality, and safety. The delivery demands of computer numerical control (CNC) machines are unpredictable and highly dependent on the product. An optimized transfer scheduling can effectively decrease the waiting time of CNC machines and improve the production efficiency. Optimally addressing the problem of AGV scheduling for transferring materials to CNC machines (AGVSP) is instrumental to developing an enterprise into a manufacturing giant.
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.