Energy minimizing order picker forklift routing problem
From MaRDI portal
Publication:6109806
DOI10.1016/j.ejor.2022.08.038OpenAlexW4293530981MaRDI QIDQ6109806
Haldun Süral, Arsham Atashi Khoei, Mustafa Kemal Tural
Publication date: 4 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.08.038
Related Items (1)
Cites Work
- Unnamed Item
- A new mathematical programming formulation for the single-picker routing problem
- Design and control of warehouse order picking: a literature review
- Using a TSP heuristic for routing order pickers in warehouses
- \(k\)-interchange heuristic as an optimization procedure for material handling applications
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
- The role of operational research in green freight transportation
- Tabu search heuristics for the order batching problem in manual order picking systems
- EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Routing order pickers in a warehouse with a middle aisle
This page was built for publication: Energy minimizing order picker forklift routing problem