Optimization of order-picking problems by intelligent optimization algorithm
Summary: To improve the efficiency of warehouse operations, reasonable optimization of picking operations has become an important task of the modern supply chain. For the purpose of optimization of order picking in warehouses, a new fruit fly optimization algorithm, particle swarm optimization, random weight, and weight decrease model are used to solve the mathematical model. Further optimization is achieved through the analysis of the warehouse shelves and screening of the optimal solution of the picking time. In addition, simulation experiments are conducted in the MATLAB environment through programming. The shortest picking time is found out and chosen as an optimized method by taking advantage of the effectiveness of these six algorithms in the picking optimization and comparing the data obtained under the simulation. The result shows that the optimization capacity of RWFOA is better and the picking efficiency is the best.
- Study on optimization of picking route of multi-zone warehouse considering vehicle capacity
- An Improved Ant Colony Algorithm for Order Picking Optimization Problem in Automated Warehouse
- scientific article; zbMATH DE number 7234287
- Order sequence optimization for parts-to-picker intelligent robot system
- An algorithm for dynamic order-picking in warehouse operations
- A batch splitting method for a job shop scheduling problem in an MRP environment
- A model for warehouse order picking
- An algorithm for dynamic order-picking in warehouse operations
- Design and control of warehouse order picking: a literature review
- Exact algorithms for the order picking problem
- Improving product location and order picking activities in a distribution centre
- LGMS-FOA: an improved fruit fly optimization algorithm for solving optimization problems
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- Routing methods for warehouses with multiple cross aisles
- Solution of a Large-Scale Traveling-Salesman Problem
- Using a TSP heuristic for routing order pickers in warehouses
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
- Exact algorithms for the order picking problem
- The optimization of the location of the cargo in three-dimension shelf: employing the FP-tree and the artificial fish swarm algorithms
- Spatial and temporal optimization for smart warehouses with fast turnover
- A deep learning approach for the selection of an order picking system
- Picker routing optimization of storage stacker based on improved multi-objective iterative local search algorithm
- An algorithm for dynamic order-picking in warehouse operations
- Order sequence optimization for parts-to-picker intelligent robot system
- An Improved Ant Colony Algorithm for Order Picking Optimization Problem in Automated Warehouse
- Order batching optimization based on Canopy and \(k\)-means algorithm
- Shelf and AGV path cooperative optimization algorithm used in intelligent warehousing
- Study on optimization of picking route of multi-zone warehouse considering vehicle capacity
- The slotting optimization model and algorithm in robotic mobile fulfillment systems
- Optimization of warehouse picking route based on deviation ratio
- Optimizing warehouse arrangement using order picking data and Monte Carlo simulation
- See the light: Optimization of put‐to‐light order picking systems
- A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints
- A real-life study on the value of integrated optimization in order picking operations under dynamic order arrivals
This page was built for publication: Optimization of order-picking problems by intelligent optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193380)
