Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
type: Item
instance of: scholarly article
title: Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
zbMATH Open document ID: 1430.90144
author: Teun van Gils
author: An Caris
author: Katrien Ramaekers
author: Kris Braekers
published in: European Journal of Operational Research
publication date: 2019-04-30T00:00:00Z
full work available at URL: http://hdl.handle.net/1942/27968
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7049377
zbMATH Keywords: logistics
zbMATH Keywords: metaheuristic
zbMATH Keywords: order batching
zbMATH Keywords: order picking
zbMATH Keywords: routing
describes a project that uses: VRP
describes a project that uses: LKH
MaRDI profile type: Publication
OpenAlex ID: W2921924300
cites work: The traveling salesman problem on a graph and some related integer polyhedra
cites work: Efficient orderbatching methods in warehouses
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: Tabu search heuristics for the order batching problem in manual order picking systems
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: Q4452900
cites work: Order sequencing on a unidirectional cyclical picking line
cites work: A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
cites work: Utilizing individual picker skills to improve order batching in a warehouse
cites work: MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
cites work: A travel time estimation model for a high-level picker-to-part system with class-based storage policies
cites work: Routing order pickers in a warehouse with a middle aisle
cites work: A new mathematical programming formulation for the single-picker routing problem
cites work: Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
cites work: Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
cites work: Using a TSP heuristic for routing order pickers in warehouses
cites work: Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
cites work: Optimally solving the joint order batching and picker routing problem
cites work: Improving order picking efficiency by analyzing combinations of storage, batching, zoning, and routing policies
cites work: Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
cites work: Joint order batching and order picking in warehouse operations
cites work: On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
Wikidata QID: Q128226565
DOI: 10.1016/J.EJOR.2019.03.012
description: scientific article; zbMATH DE number 7049377