Picker Routing in AGV-Assisted Order Picking Systems
From MaRDI portal
Publication:5084661
DOI10.1287/ijoc.2021.1060zbMath1492.90021OpenAlexW3193444724MaRDI QIDQ5084661
No author found.
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1060
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Unnamed Item
- Unnamed Item
- An improved approximation algorithm for the clustered traveling salesman problem
- The symmetric clustered traveling salesman problem
- Design and control of warehouse order picking: a literature review
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- Warehousing in the e-commerce era: a survey
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
- Exact algorithms for the order picking problem
- Algorithmic graph theory and perfect graphs
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking
- Tabu search heuristics for the order batching problem in manual order picking systems
- Integer Programming Formulation of Traveling Salesman Problems
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
- Scheduling of Container Storage and Retrieval
- Routing order pickers in a warehouse with a middle aisle
This page was built for publication: Picker Routing in AGV-Assisted Order Picking Systems