A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints

DOI10.1111/itor.13421OpenAlexW4390345618MaRDI QIDQ6195023

Massimo Bertolini, Unnamed Author, Angel A. Juan

Publication date: 12 March 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13421

zbMATH Keywords

vehicle routing problembin packing problempallet loading problembiased-randomization algorithmscase picking

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• An algorithm for dynamic order-picking in warehouse operations
• A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
• A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP
• Design and control of warehouse order picking: a literature review
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• Three-dimensional bin packing problem with variable bin height
• An efficient approach for the multi-pallet loading problem
• Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
• Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• Algorithms for on-line order batching in an order picking warehouse
• Three-dimensional container loading models with cargo stability and load bearing constraints
• A clustering algorithm for item assignment in a synchronized zone order picking system
• New lower bounds for the three-dimensional finite bin packing problem
• Batch picking in narrow-aisle order picking systems with consideration for picker blocking
• The pallet loading problem: three-dimensional bin packing with practical constraints
• Optimization of order-picking problems by intelligent optimization algorithm
• New lower bounds for the three-dimensional orthogonal bin packing problem
• The location routing problem using electric vehicles with constrained distance
• Constraints in container loading -- a state-of-the-art review
• Solving the pallet loading problem
• The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
• An improved typology of cutting and packing problems
• A Linear Programming Approach to the Cutting-Stock Problem
• Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
• A three-dimensional pallet loading method for single-size boxes
• A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
• Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
• An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
• A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
• Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery

This page was built for publication: A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints