Results 201 to 210 of about 275 (229)
Some of the next articles are maybe not open access.
Joint order batching and picker Manhattan routing problem
Computers & Industrial Engineering, 2016We jointly consider order batching and order routing, measured precisely by Manhattan distance.We develop particle swarm optimization (PSO) with bad experiences for this problem.We propose a solution representation to handle batching and routing simultaneously.We theoretically analyze stability and convergence of the proposed PSO heuristic.We evaluate ...
Chun-Cheng Lin +3 more
openaire +2 more sources
Exact Solution of the Single-Picker Routing Problem with Scattered Storage
INFORMS Journal on ComputingWe present a new modeling approach for the single-picker routing problem with scattered storage (SPRP-SS) for order picking in warehouses. The SPRP-SS assumes that an article is, in general, stored at more than one pick position. The task is then the simultaneous selection of pick positions for requested articles and the determination of a minimum ...
Stefan Irnich
exaly +4 more sources
A method for efficiently routing order pickers in the leaf warehouse
International Journal of Production Economics, 2021Abstract Warehouse order picking is a critical operation for every supply chain because of its direct influence on customer satisfaction and the high time investment that is usually required for completing it. Hence, improving order picking efficiency can enhance both customer satisfaction and warehouse throughput.
Christoph Glock +2 more
exaly +2 more sources
Picker routing in the mixed-shelves warehouses of e-commerce retailers
European Journal of Operational Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nils Boysen, Felix Weidinger
exaly +2 more sources
DISTANCE APPROXIMATIONS FOR ROUTING MANUAL PICKERS IN A WAREHOUSE
IIE Transactions, 1993This paper evaluates and compares strategies for routing a manual picker through a simple warehouse. It expands on previous work, in which optimization algorithms were developed, by deriving equations which relate route length to warehouse attributes.
openaire +1 more source
A bin-packing formulation for the joint order batching, picker routing and picker sequencing problem
2022Picking is the process of retrieving products from inventory. It is considered the most expensive of warehouse operations. To reduce the picking cost, customer orders can be grouped into batches that are then collected by pickers who travel the shortest possible distance.A column generation heuristic able to produce lower and upper bounds for the joint
Briant, Olivier +5 more
openaire +1 more source
2023
Order picking is one of the most important processes in warehouse oper- ations and deals with the preparation of customer orders. In picker-to-parts systems, pickers navigate around the warehouse collecting the required prod- ucts to prepare the orders.
Torrealba-González, Pablo +3 more
openaire +1 more source
Order picking is one of the most important processes in warehouse oper- ations and deals with the preparation of customer orders. In picker-to-parts systems, pickers navigate around the warehouse collecting the required prod- ucts to prepare the orders.
Torrealba-González, Pablo +3 more
openaire +1 more source
Genetic Algorithms for the Picker Routing Problem in Multi-block Warehouses
2019This article presents a genetic algorithm (GA) to solve the picker routing problem in multiple-block warehouses in order to minimize the traveled distance. The GA uses survival, crossover, immigration, and mutation operators, and is complemented by a local search heuristic.
Jose Alejandro Cano +3 more
openaire +2 more sources
Developing efficient order picker routing policies in manual picker-to-parts order picking systems
2020This dissertation develops several efficient order picker routing policies for manual picker-to-parts order picking systems. This work consists of six chapters and is structured as follows. Chapter 1 provides a brief introduction of the dissertation. Chapter 2 then presents the results of a systematic review of research on order picker routing.
openaire +1 more source
Order Picking Optimization Based on a Picker Routing Heuristic
2020This chapter details the performance evaluation of routing policies and proposes a routing heuristic to determine the minimum traveled distance for different warehouse configurations and pick-list sizes. Numerical experiments are performed considering warehouse configurations used in literature and list sizes are chosen proportional to the number of ...
openaire +1 more source