An Intelligent Algorithm for AGV Scheduling in Intelligent Warehouses

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In today’s intelligent warehouses, automated guided vehicles (AGVs) are widely used, and their scheduling efficiency is crucial to the overall performance of warehouse business. However, AGV scheduling is a complex problem, especially when there are a large number of tasks to be undertaken by multiple AGVs in a large warehouse. In this paper, we present a problem of scheduling multiple AGVs for order picking in intelligent warehouse, the aim of which is to minimize the latest completion time of all orders. After testing a variety of algorithms, we propose a hybrid water wave optimization (WWO) and tabu search (TS) algorithm for efficiently solving the problem. We test the algorithm on a set of problem instances with different sizes, and the results show that the proposed algorithm exhibits significant performance advantages over a number of popular intelligent optimization algorithms.

Cite

CITATION STYLE

APA

Wu, X., Zhang, M. X., & Zheng, Y. J. (2021). An Intelligent Algorithm for AGV Scheduling in Intelligent Warehouses. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12689 LNCS, pp. 163–173). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-78743-1_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free