IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i2p279-d322556.html
   My bibliography  Save this article

A Novel Tabu Search Algorithm for Multi-AGV Routing Problem

Author

Listed:
  • Lining Xing

    (School of Logistics, Central South University of Forestry and Technology, Changsha 410004, China
    College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Yuanyuan Liu

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
    College of Computer Science and Engineering, Northeastern University, Shenyang 110819, China)

  • Haiyan Li

    (College of Computer Science and Engineering, Northeastern University, Shenyang 110819, China)

  • Chin-Chia Wu

    (Department of Statistics, Feng Chia University, Taichung 40724, Taiwan)

  • Win-Chin Lin

    (Department of Statistics, Feng Chia University, Taichung 40724, Taiwan)

  • Xin Chen

    (School of Electronics and Information Engineering, Liaoning University of Technology, Jinzhou 121001, China)

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.

Suggested Citation

  • Lining Xing & Yuanyuan Liu & Haiyan Li & Chin-Chia Wu & Win-Chin Lin & Xin Chen, 2020. "A Novel Tabu Search Algorithm for Multi-AGV Routing Problem," Mathematics, MDPI, vol. 8(2), pages 1-16, February.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:2:p:279-:d:322556
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/2/279/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/2/279/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    2. James P. Kelly & Jiefeng Xu, 1999. "A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 161-172, May.
    3. Giannikas, Vaggelis & Lu, Wenrong & Robertson, Brian & McFarlane, Duncan, 2017. "An interventionist strategy for warehouse order picking: Evidence from two case studies," International Journal of Production Economics, Elsevier, vol. 189(C), pages 63-76.
    4. de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
    5. Grosse, E. H. & Glock, C. H., 2015. "The effect of worker learning on manual order picking processes," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 69316, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    6. Grosse, Eric H. & Glock, Christoph H., 2015. "The effect of worker learning on manual order picking processes," International Journal of Production Economics, Elsevier, vol. 170(PC), pages 882-890.
    7. Noha Mostafa & Walaa Hamdy & Hisham Alawady, 2019. "Impacts of Internet of Things on Supply Chains: A Framework for Warehousing," Social Sciences, MDPI, vol. 8(3), pages 1-10, March.
    8. Roodbergen, Kees Jan & de Koster, Rene, 2001. "Routing order pickers in a warehouse with a middle aisle," European Journal of Operational Research, Elsevier, vol. 133(1), pages 32-43, August.
    9. Yubang Liu & Shouwen Ji & Zengrong Su & Dong Guo, 2019. "Multi-objective AGV scheduling in an automatic sorting system of an unmanned (intelligent) warehouse by using two adaptive genetic algorithms and a multi-adaptive genetic algorithm," PLOS ONE, Public Library of Science, vol. 14(12), pages 1-21, December.
    10. Qu, Hong & Yi, Zhang & Tang, HuaJin, 2007. "A columnar competitive model for solving multi-traveling salesman problem," Chaos, Solitons & Fractals, Elsevier, vol. 31(4), pages 1009-1019.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li Zhou & Huwei Liu & Junhui Zhao & Fan Wang & Jianglong Yang, 2022. "Performance Analysis of Picking Routing Strategies in the Leaf Layout Warehouse," Mathematics, MDPI, vol. 10(17), pages 1-28, September.
    2. Shandong Mou, 2022. "Integrated Order Picking and Multi-Skilled Picker Scheduling in Omni-Channel Retail Stores," Mathematics, MDPI, vol. 10(9), pages 1-19, April.
    3. Agnieszka A. Tubis & Honorata Poturaj, 2022. "Risk Related to AGV Systems—Open-Access Literature Review," Energies, MDPI, vol. 15(23), pages 1-23, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Giannikas, Vaggelis & Lu, Wenrong & Robertson, Brian & McFarlane, Duncan, 2017. "An interventionist strategy for warehouse order picking: Evidence from two case studies," International Journal of Production Economics, Elsevier, vol. 189(C), pages 63-76.
    2. Glock, Christoph H. & Grosse, Eric H. & Abedinnia, Hamid & Emde, Simon, 2019. "An integrated model to improve ergonomic and economic performance in order picking by rotating pallets," European Journal of Operational Research, Elsevier, vol. 273(2), pages 516-534.
    3. Jiuh‐Biing Sheu & Tsan‐Ming Choi, 2023. "Can we work more safely and healthily with robot partners? A human‐friendly robot–human‐coordinated order fulfillment scheme," Production and Operations Management, Production and Operations Management Society, vol. 32(3), pages 794-812, March.
    4. Derhami, Shahab & Smith, Jeffrey S. & Gue, Kevin R., 2020. "A simulation-based optimization approach to design optimal layouts for block stacking warehouses," International Journal of Production Economics, Elsevier, vol. 223(C).
    5. Loske, Dominic & Klumpp, Matthias & Grosse, Eric H. & Modica, Tiziana & Glock, Christoph H., 2023. "Storage systems’ impact on order picking time: An empirical economic analysis of flow-rack storage systems," International Journal of Production Economics, Elsevier, vol. 261(C).
    6. Diefenbach, Heiko & Grosse, Eric H. & Glock, Christoph H., 2024. "Human-and-cost-centric storage assignment optimization in picker-to-parts warehouses," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1049-1068.
    7. Shandong Mou, 2022. "Integrated Order Picking and Multi-Skilled Picker Scheduling in Omni-Channel Retail Stores," Mathematics, MDPI, vol. 10(9), pages 1-19, April.
    8. Christoph H. Glock & Eric H. Grosse & Ralf M. Elbert & Torsten Franzke, 2017. "Maverick picking: the impact of modifications in work schedules on manual order picking processes," International Journal of Production Research, Taylor & Francis Journals, vol. 55(21), pages 6344-6360, November.
    9. Kumar, Suryakant & Sheu, Jiuh-Biing & Kundu, Tanmoy, 2023. "Planning a parts-to-picker order picking system with consideration of the impact of perceived workload," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    10. Çağla Cergibozan & A. Serdar Tasan, 2019. "Order batching operations: an overview of classification, solution techniques, and future research," Journal of Intelligent Manufacturing, Springer, vol. 30(1), pages 335-349, January.
    11. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    12. Zhang, Jun & Liu, Feng & Tang, Jiafu & Li, Yanhui, 2019. "The online integrated order picking and delivery considering Pickers’ learning effects for an O2O community supermarket," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 180-199.
    13. I. Kudelska & G. Pawłowski, 2020. "Influence of assortment allocation management in the warehouse on the human workload," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(2), pages 779-795, June.
    14. Dominic Loske & Matthias Klumpp & Maria Keil & Thomas Neukirchen, 2021. "Logistics Work, Ergonomics and Social Sustainability: Empirical Musculoskeletal System Strain Assessment in Retail Intralogistics," Logistics, MDPI, vol. 5(4), pages 1-25, December.
    15. Fabio Maximiliano Miguel & Mariano Frutos & Máximo Méndez & Fernando Tohmé & Begoña González, 2024. "Comparison of MOEAs in an Optimization-Decision Methodology for a Joint Order Batching and Picking System," Mathematics, MDPI, vol. 12(8), pages 1-23, April.
    16. Bai, Danyu & Tang, Mengqian & Zhang, Zhi-Hai & Santibanez-Gonzalez, Ernesto DR, 2018. "Flow shop learning effect scheduling problem with release dates," Omega, Elsevier, vol. 78(C), pages 21-38.
    17. Ameknassi, Lhoussaine & Aït-Kadi, Daoud & Rezg, Nidhal, 2016. "Integration of logistics outsourcing decisions in a green supply chain design: A stochastic multi-objective multi-period multi-product programming model," International Journal of Production Economics, Elsevier, vol. 182(C), pages 165-184.
    18. van Gils, Teun & Ramaekers, Katrien & Braekers, Kris & Depaire, Benoît & Caris, An, 2018. "Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions," International Journal of Production Economics, Elsevier, vol. 197(C), pages 243-261.
    19. Sebastian Henn & André Scholz & Meike Stuhlmann & Gerhard Wäscher, 2015. "A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout," FEMM Working Papers 150005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    20. Katrin Heßler & Stefan Irnich, 2023. "Exact Solution of the Single Picker Routing Problem with Scattered Storage," Working Papers 2303, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:2:p:279-:d:322556. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.