An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
Publication:1754220
DOI10.1016/J.EJOR.2017.11.017zbMath1403.90101OpenAlexW2769848411WikidataQ59102025 ScholiaQ59102025MaRDI QIDQ1754220
Eleonora Bottani, Roberta De Santis, Roberto Montanari, Giuseppe Vignali
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.11.017
logisticstravel distanceant-colony optimization (ACO)Floyd-Warshall (FW) algorithmorder picker routing
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A travel time estimation model for a high-level picker-to-part system with class-based storage policies
- An algorithm for dynamic order-picking in warehouse operations
- A new mathematical programming formulation for the single-picker routing problem
- Research on warehouse operation: a comprehensive review
- Design and control of warehouse order picking: a literature review
- A travel-time model for a person-onboard order picking system
- Using a TSP heuristic for routing order pickers in warehouses
- Warehouse design and control: Framework and literature review
- Algorithms for on-line order batching in an order picking warehouse
- Throughput analysis for order picking system with multiple pickers and Aisle congestion considerations
- A clustering algorithm for item assignment in a synchronized zone order picking system
- Optimization of the keyboard arrangement problem using an ant colony algorithm.
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking
- Mixed-width aisle configurations for order picking in distribution centers
- Travel time estimation and order batching in a 2-block warehouse
- Ant algorithms: theory and applications
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem
- On a routing problem
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- The effect of warehouse cross aisles on order picking efficiency
- Routing policies and COI-based storage policies in picker-to-part systems
- Optimal layout in low-level picker-to-part systems
- Routing methods for warehouses with multiple cross aisles
- A Theorem on Boolean Matrices
- Routing order pickers in a warehouse with a middle aisle
This page was built for publication: An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses