MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem

DOI10.1016/J.EJOR.2014.11.025zbMATH Open1346.90165OpenAlexW2027520034MaRDI QIDQ319040FDOQ319040

Authors: Temel Öncan 

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.11.025

Recommendations

• A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
• Variable neighborhood search strategies for the order batching problem
• Order batching in walk-and-pick order picking systems
• Tabu search heuristics for the order batching problem in manual order picking systems
• GRASP with variable neighborhood descent for the online order batching problem

zbMATH Keywords

local searchmixed integer linear programmingwarehouse managementorder batching problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)
• Design and control of warehouse order picking: a literature review
• Research on warehouse design and performance evaluation: a comprehensive review
• Rich routing problems arising in supply chain management
• Routing methods for warehouses with multiple cross aisles
• Research on warehouse operation: a comprehensive review
• The savings algorithm for the vehicle routing problem
• Algorithms for on-line order batching in an order picking warehouse
• 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
• TTT plots: a perl program to create time-to-target plots
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• Batch construction heuristics and storage assignment strategies for walk/ride and pick systems
• Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system
• VLSN search algorithms for partitioning problems using matching neighbourhoods
• Order batching in walk-and-pick order picking systems
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems
• Efficient orderbatching methods in warehouses
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• Variable neighborhood search for order batching in a warehouse
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm

Cited In (15)

• The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
• Title not available (Why is that?)
• Warehousing in the e-commerce era: a survey
• Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
• Parallel variable neighborhood search for the min–max order batching problem
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• A matheuristic approach for the design of multiproduct batch plants with parallel production lines
• A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
• GRASP with variable neighborhood descent for the online order batching problem
• A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices
• Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
• Storage assignment and order batching problem in Kiva mobile fulfilment system
• Order batching problems: taxonomy and literature review
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
• Variable neighborhood search strategies for the order batching problem

Uses Software

• PERL
• TTTPLOTS

This page was built for publication: MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319040)