A Novel Tabu Search Algorithm for Multi-AGV Routing Problem
Open Access
- 18 February 2020
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 8 (2), 279
- https://doi.org/10.3390/math8020279
Abstract
In this paper, we propose a novel tabu search (NTS) algorithm that improves the efficiencies of picking goods of automated guided vehicles (AGVs) in an automatic warehouse by solving the conflicts that happen when multiple AGVs work at the same time. Relocation and exchanging operations are designed for the neighborhood searching process based on each pickup-point’s location in the warehouse, along with the initial solution generation and the termination condition in the proposed algorithm. The experimental results show that the tabu search algorithm can effectively optimize the order of pickup points, which could further reduce the total travel distance and improve the efficiencies of AGVs in automatic warehouses.This publication has 20 references indexed in Scilit:
- Impacts of Internet of Things on Supply Chains: A Framework for WarehousingSocial Sciences, 2019
- Optimal warehouse design: Literature review and case study applicationComputers & Industrial Engineering, 2019
- Research on AGV Path Planning under “Parts-to-Picker” ModeOpen Journal of Social Sciences, 2019
- An interventionist strategy for warehouse order picking: Evidence from two case studiesInternational Journal of Production Economics, 2017
- The effect of worker learning on manual order picking processesInternational Journal of Production Economics, 2015
- The use of bucket brigades in zone order picking systemsOR Spectrum, 2008
- Design and control of warehouse order picking: A literature reviewEuropean Journal of Operational Research, 2007
- Routing order pickers in a warehouse with a middle aisleEuropean Journal of Operational Research, 2001
- An Evaluation of Routing and Volume‐based Storage Policies in an Order Picking OperationDecision Sciences, 1999
- The Truck Dispatching ProblemManagement Science, 1959