ArticlePublisher preview available

Trolley line picking: storage assignment and order sequencing to increase picking performance

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract and Figures

Trolley line picking is a special warehousing system particularly suited to fulfill high-volume demands for heavy stock keeping units (SKUs). In such a system, unit loads of SKUs are positioned along a given path passed by automated trolleys, i.e., carriers hanging from a monorail or automated guided vehicles. Once a trolley reaches a requested SKU, it automatically stops and announces the requested items on a display. This is the signal for an accompanying human picker to put the demanded items onto the trolley. In this way, picking continues until, at the end of the path, the current picking order is complete and the trolley moves onward to the shipping area. Meanwhile, the picker rushes back to meet the subsequent trolley associated with the next picking order. The picking performance of the trolley line system is mainly influenced by the picker’s unproductive walking from SKU to SKU during order processing and back to the next trolley when switching to the next order. In this paper, we investigate how the storage assignment of SKUs along the path and the order sequence influence picking performance. Specifically, we explore the positive effect of duplicating SKUs and storing them at multiple positions along the path. We formulate the interdependent storage assignment and order sequencing problems and introduce a decomposition heuristic. Our computational study investigates the solution performance of this procedure and shows that SKU duplication can considerably improve picking performance.
This content is subject to copyright. Terms and conditions apply.
OR Spectrum (2019) 41:1087–1121
https://doi.org/10.1007/s00291-019-00566-9
REGULAR ARTICLE
Trolley line picking: storage assignment and order
sequencing to increase picking performance
David Füßler1·Nils Boysen1·Konrad Stephan1
Received: 15 March 2019 / Accepted: 17 October 2019 / Published online: 2 November 2019
© Springer-Verlag GmbH Germany, part of Springer Nature 2019
Abstract
Trolley line picking is a special warehousing system particularly suited to fulfill high-
volume demands for heavy stock keeping units (SKUs). In such a system, unit loads
of SKUs are positioned along a given path passed by automated trolleys, i.e., carri-
ers hanging from a monorail or automated guided vehicles. Once a trolley reaches a
requested SKU, it automatically stops and announces the requested items on a display.
This is the signal for an accompanying human picker to put the demanded items onto
the trolley. In this way, picking continues until, at the end of the path, the current pick-
ing order is complete and the trolley moves onward to the shipping area. Meanwhile,
the picker rushes back to meet the subsequent trolley associated with the next picking
order. The picking performance of the trolley line system is mainly influenced by the
picker’s unproductive walking from SKU to SKU during order processing and back to
the next trolley when switching to the next order. In this paper, we investigate how the
storage assignment of SKUs along the path and the order sequence influence picking
performance. Specifically, we explore the positive effect of duplicating SKUs and stor-
ing them at multiple positions along the path. We formulate the interdependent storage
assignment and order sequencing problems and introduce a decomposition heuristic.
Our computational study investigates the solution performance of this procedure and
shows that SKU duplication can considerably improve picking performance.
Keywords Warehousing ·Trolley line picking ·Order fulfillment ·Scheduling
BNils Boysen
nils.boysen@uni-jena.de
http://www.om.uni-jena.de/
David Füßler
david.fuessler@uni-jena.de
Konrad Stephan
konrad.stephan@uni-jena.de
1Lehrstuhl für Operations Management, Friedrich-Schiller-Universität Jena, Carl-Zeiß-Straße 3,
07743 Jena, Germany
123
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
... The main difference between them is the structure they travel on (rail or wire). Recent P2G examples that are also adaptable to chaotic warehouse contexts are the trolley line picking system (Füßler et al., 2019) and the AGV Weasel system (" AGV Weasel", 2021). Since both types of linear route robots have similar outcomes in decision criteria evaluation, we deem one evaluation for both systems sufficient. ...
Conference Paper
Full-text available
Unmanned Aerial Vehicle (UAV) or drone technology is developing quickly with various applications in military, public safety, surveillance, delivery, communications and cinematography. With the growing interest from academia, industry and government, the use of UAVs in daily life is only going to increase. Another emerging technology is 5G, which offers significant performance improvements over 4G. As 5G develops, the technology is being experimented for several use-cases including UAV networks. 5G offers high speed and ultra-low latency, which makes it suitable for autonomous UAV systems. This research focuses on analysing the security challenges, attacks, risks and threats associated with deploying an autonomous drone highway along the Manchester Ship Canal (MSC). This research focuses on analysing the security challenges, attacks, risks and threats associated with deploying an autonomous drone highway along MSC. Several attacks capable of disrupting communications, stealing data and hijacking drones were identified. Existing security techniques were also discussed. This information was factored into a threat model and risk assessment for the drone highway. Furthermore, a drone highway simulated model was developed using the NS-3 simulation tool while discussing available simulation tools, and their capabilities and limitations. The research identified several techniques that can be used by attackers to disrupt operations or hijack drones. Security controls were recommended to mitigate these risks. In this paper, we have also identified the need to achieve a trade-offs between fulfilling security requirements and maintaining efficient drones network since any implemented security functionality adds an overhead to the drones communications. A minimal simulation of the drones highway was developed using the NS-3 simulation tool and the simulation results showing the network throughput, delay and signal quality were presented and discussed. This research offers a better understanding of the simulation environment of UAVs and how it applies to the proposed Manchester Ship Canal drone highway. Furthermore, it can be used as a framework in designing other autonomous drone-based transport systems around the UK.
... Thus, only workstation-based order fulfillment systems where the picker remains stationary are treated in this paper. There are other warehousing systems that also aim to reduce the walking effort of pickers by confining them to a smaller pick-face, such as pick-andpass systems ( Melacini, Perotti, & Tumino, 2011;Yu & de Koster, 2008 ), crane-supplied pick faces ( Schwerdfeger & Boysen, 2017;Yu & de Koster, 2010 ), and trolley line systems ( Füßler, Boysen, & Stephan, 2019a;Füßler, Fedtke, & Boysen, 2019b ). A detailed overview on these systems is provided by the survey papers of Boysen, de Koster, & Weidinger (2019) , Boysen et al. (2020) . ...
Article
Triggered by the great success of e-commerce, today’s warehouses more and more evolve to fully-automated fulfillment factories. Many of them follow the parts-to-picker paradigm and employ shelf-lifting mobile robots or conveyors to deliver stock keeping units (SKUs) to stationary pickers operating in picking workstations. This paper aims to structure and review the family of synchronization problems that arise in this environment: If multiple orders demanding the same SKU can be serviced jointly, then a more efficient picking process and a relief of the bin supply system can be achieved. This paper classifies the family of slightly varying synchronization problems arising with different workstation setups in alternative warehouses. This classification scheme is applied to analyze computational complexity, to systematically quantify the gains of alternative workstation setups, and to benchmark the performance gains of synchronization with those of other well-established decision tasks. Our results show that the right workstation setup can greatly improve throughput performance, so that the gains of synchronization can outreach those promised by other well-researched decision tasks.
... Storage assignment methods assign items to storage positions (Reyes et al. 2019). This can either be random or according to some criteria, such as item demand or volume (Füßler et al. 2019). Common advice for practitioners is to assign frequently requested items to storage locations close to the depot (also denoted as pick-up/ drop-off point, see ). ...
Article
Full-text available
This paper develops new solution procedures for the order picker routing problem in U-shaped order picking zones with a movable depot, which has so far only been solved using simple heuristics. The paper presents the first exact solution approach, based on combinatorial Benders decomposition, as well as a heuristic approach based on dynamic programming that extends the idea of the venerable sweep algorithm. In a computational study, we demonstrate that the exact approach can solve small instances well, while the heuristic dynamic programming approach is fast and exhibits an average optimality gap close to zero in all test instances. Moreover, we investigate the influence of various storage assignment policies from the literature and compare them to a newly derived policy that is shown to be advantageous under certain circumstances. Secondly, we investigate the effects of having a movable depot compared to a fixed one and the influence of the effort to move the depot.
Article
Full-text available
An efficient part feeding is among the top challenges of many mass producers applying mixed-model assembly lines, for instance, in the automotive industry. This paper introduces a novel part feeding policy applied by a large German assembly plant for car engines: In-line kitting. Under this policy, the first stations of the line do not execute assembly operations, but are reserved for picking parts while passing containers of stock-keeping units (SKUs) arranged along the line. In this way, the parts are collected in traveling kits moving along with each workpiece on the conveyor, so that later assembly stations have the required parts directly available and do not lose precious labor time for unproductive parts handling. A major operational challenge when applying this part feeding policy is the walking effort for the human pickers while putting the SKUs of their respective stations into the traveling kits of the passing workpieces. Due to a high product variety, a large number of comparatively bulky SKU containers have to fit into each station, so that the walking distance to be covered by a worker during a work shift exceeds multiple kilometers. We show that this physical burden can be reduced significantly by balancing the workload among stations and optimizing the storage assignment of SKU containers within each in-line kitting station. We formulate the resulting optimization problem and provide suited solution procedures. Our computational study shows that the walking distance of pickers can be reduced significantly without producing any additional costs.
Chapter
The tactical decisions provide a boundary for the operational decisions to be taken when running the warehouse on a day-to-day basis. Operational-level decisions could be altered in the short term. Their effect on the warehouse operations could be observed within the same month or even within the same day as they directly affect operations. Thus, warehouse managers can experiment (without jeopardising the ongoing operations) with their decisions to optimise the operational focus areas.
Chapter
With its in-depth focus on mobile robot automation in warehouses, this book has identified several gaps in the literature and exciting research avenues that emerge as the deployment of such robots increases. Hence, this chapter provides a structured research agenda stemming from the previous chapters, inviting the reader to consider theoretical and applied research in specific problem domains.
Chapter
This chapter will present strategic-level decisions for mobile robot automation in warehouses, which involve comprehensive, long-term business decisions such as the layout of the warehouse and the type of mobile robots. These decisions are generally taken before the installation stage of mobile robot systems, and they are rather difficult to alter during the implementation. The effects of these decisions occur in the long run, which might be years.
Chapter
This chapter follows Chap. 4 with tactical decisions. Based on strategic decisions, tactical decisions have a medium-term effect on warehouse operations. These decisions are easier to adjust during the implementation stage compared to strategic-level decisions, but they should not (and generally cannot) be changed in the short term.
Chapter
This chapter provides definitions of ten mobile robot systems incorporating suitable case examples. It evaluates these systems using a multi-criteria rating approach, where the criteria are also identified through the literature review. The chapter also provides justifications for these criteria when selecting a mobile robot automation system. Then, ten mobile robot systems are rated on a three-point scale in each criterion, where the higher the score, the better the performance in the given criterion. To provide guided examples, the rationale for this multi-criteria selection support is further explained with the ‘Equal Weight’ approach and the ‘Full Consistency Method’ (FUCOM) which uses supply chain experts’ judgements on each criterion.
Chapter
Operations Research (OR) in Deutschland hat einen zwiespältigen Charakter. Zum einen feiert es mit seinen Methoden und Verfahren unbestreitbare Erfolge, zum anderen ist es in den Wirtschaftswissenschaften in Deutschland in Form eigener Lehrstühle kaum noch vertreten. Die Gründe für diese Situation und mögliche Entwicklungsperspektiven des OR sollen näher betrachtet werden. Der Beitrag beginnt mit der Gründungsphase des OR in Deutschland und skizziert die damaligen Erwartungen. Um die weitere Entwicklung besser einordnen zu können, erörtert das nächste Kapitel den Problemlösungsprozess. Einen Eindruck von der Vielfalt der Methoden und Anwendungen des OR soll die Vorstellung aktueller Forschungsprojekte vermitteln. Auf die Gründungsphase des OR und die damalige Euphorie, folgte eine Phase der Enttäuschung, die zur Umwidmung der wirtschaftswissenschaftlichen OR-Lehrstühle und einer Krise des OR führte. Es bildeten sich anschließend zwei Denkrichtungen heraus, die in Deutschland die Spaltung in zwei OR-Gesellschaften zur Folge hatte. Die eine mit dem Schwerpunkt in der Optimierungstheorie und mathematischen Methoden, das sogenannte Hard OR, die andere, das Soft OR, mit dem anwendungsorientierten Schwerpunkt einer Problemevaluation und Problemdefinition. Soweit Modelle des Soft OR inhaltlich der Wirtschaftsinformatik, der Logistik oder der Produktion zugerechnet wurden, haben die einschlägigen Lehrstühle dies auch wahrgenommen und damit die Entwicklung des OR mitgestaltet. Entwicklungsaspekte der Wirtschaftsinformatik, genauer die Hintergründe der Entwicklung von Informationssystemen und die Grundlagen der Programmierung, werden in ihren Auswirkungen auf das OR dargestellt. Im Zentrum des Verständnisses von OR stand viele Jahre der Modellbegriff. Im Gegensatz dazu nehmen neuere Entwurfsmethoden den Systembegriff in ihren Fokus. Um Perspektiven für die Entwicklung des OR aus Sicht der Wirtschaftsinformatik aufzuzeigen, werden agile Entwurfsmethoden, System Design bzw. System Design Research und Critical Systems Thinking vorgestellt. Diese Methoden sind nach Ansicht des Autors die Elemente, die zu einem neuen Verständnis des OR führen können.
Article
Full-text available
This paper is dedicated to the cafeteria problem: given a single waiter operating multiple counters for different dishes arranged along a line and a set of customers with given subsets of dishes they desire, find a sequence of customers, which may not overtake each other, and a service schedule for the waiter, such that the makespan is minimized. This generic problem is shown to have different real-world applications in order picking with blocking restrictions. We present different heuristic and exact solution procedures for both problem parts, i.e., customer sequencing and waiter scheduling, and systematically compare these approaches. Our computational results reveal that the largest performance gains are enabled by not strictly processing order after order. Instead, the waiter should be allowed to flexibly swap between customers waiting along the line. Such a flexible service policy considerably reduces the makespan and the total walking distance of the waiter.
Article
Full-text available
An efficient container transfer in railway yards is an important matter to increase the attraction of rail-bound freight transport. Therefore, the scheduling of gantry cranes transferring containers between freight trains and trucks or among trains received a lot of attention in the recent years. This paper contributes to this stream of research by investigating the computational complexity of crane scheduling in these yards. Scheduling the transfer of a given set of containers by a single crane equals the (asymmetric) traveling salesman problem in its path-version. In railway yards, however, all container positions are located along parallel lines, i.e., tracks, and we face special distance metrics, so that only specially structured problem instances arise. We classify important problem settings by differentiating the transshipment direction, parking policy, and distance metric. This way, we derive problem variants being solvable to optimality in polynomial time, whereas other cases are shown to be NP-hard.
Article
Full-text available
The growing importance of online sales means that traditional bricks-and-mortar retailers need to create new distribution systems to serve customers through multiple channels. Building an effective and efficient omni-channel (OC) distribution system, however, leads to multiple challenges. The questions arise for example, from where online orders should be fulfilled, how delivery and return processes can be organized, and which context-specific OC distribution systems exist. Answering these questions retail research and practice require an overall view of the distribution concepts for direct-to-customer and store deliveries in OC retailing, including the associated return processes. This overall picture is still missing in the literature. We conducted an exploratory study to close this observable gap in the literature. This exploratory study is based on semi-structured interviews with major OC retailers in German-speaking countries and was complemented by market data research and discussions with further experts in the field of OC retailing. Based on the results of the study, the forward distribution system in OC retailing is characterized by the sources (supplier DCs, retailer DCs, stores) and destinations (home, store) which describe the options for store delivery, home delivery, and store pickup. Return processes are likewise characterized by the sources (store, home) and destinations (store, DC, return center). This framework forms the foundation for analyzing contextual criteria, identifying when the different conceptual designs are applied, determining industry-specific characteristics, and illustrating ways to further advance OC retailing. The present paper, therefore, contributes to the literature in three main areas: (1) it identifies and systematizes the forward and backward concepts in OC retailing, (2) it reveals application and development areas for achieving excellence in OC fulfillment and logistics, and (3) shows the need for developing sector- and context-specific OC distribution systems.
Article
Full-text available
Purpose For traditional grocery retailers, the growing importance of online sales means creating new logistics models for omni-channel (OC) management. Due to these transformational changes, retail research and practice are lacking a comprehensive view on integrated fulfilment and distribution concepts for home and store deliveries as they have evolved recently. This paper develops a planning framework for last mile order fulfilment in OC grocery retailing and discusses the advantages and disadvantages of different design concepts. Design/methodology/approach The findings were developed and evaluated by means of explorative interviews with grocery retail and logistics experts. Additionally, key literature on last mile order fulfilment and retail supply chain management was reviewed to supplement the integrated OC grocery operations planning framework. Findings OC logistics planning can be structured into back-end fulfilment (e.g. warehouse and in-store picking) and last mile distribution concepts (e.g. attended and unattended home delivery). The design choices depend on country specifics (e.g. population density), retailer specifics (e.g. capability for cross-channel process integration) and customer behaviour (e.g. possibility of unattended home delivery). The application areas and their contextual factors are discussed for each design parameter. Practical implications The last mile fulfilment options identified can be applied to pinpoint the necessary steps for further optimizing OC integration. Grocers can gain insights into current fulfilment concepts used in different contexts. This architecture also forms the foundation for further research on decision support systems. Originality/value The coherent planning framework summarizes the general design options for last mile order fulfilment arising from new requirements for OC fulfilment.
Article
Warehouses are an inevitable component in any supply chain and a vividly investigated object of research. Much attention, however, is absorbed by warehousing systems dedicated to the special needs of online retailers in the business-to-consumer segment. Due to the ever increasing sales volumes of e-commerce this focus seems self-evident, but a much larger fraction of retail sales are still realized by traditional brick-and-mortar stores. The special needs of warehouses servicing these stores are focused in this paper. While e-commerce warehouses face low-volume-high-mix picking orders, because private households tend to order just a few pieces per order from a large assortment, distribution centers of retail chains rather have to process high-volume-low-mix orders. We elaborate the basic requirements within both business segments and identify suited warehousing systems for brick-and-mortar stores (e.g., fully-automated case picking). The setup of each identified warehousing system is described, elementary decision problems are discussed, and the existing literature is surveyed. Furthermore, we identify future research needs.
Article
E-commerce retailers face the challenge to assemble large numbers of time-critical picking orders, of which each typically consists of just a few order lines and low order quantities. To efficiently solve this task, many warehouses in this segment are organized according to the mixed-shelves paradigm. Incoming unit loads are isolated into single units, which are randomly spread all over the shelves of the warehouse. In such a setting, the probability that a picker always finds a demanded stock keeping unit (SKU) close-by is high, irrespective of his/her current position in the warehouse. In spite of this organizational adaption, picker routing, i.e., the sequencing of shelf visits when retrieving a set of picking orders, is still an important optimization problem. In a mixed-shelves warehouse, picker routing is much more complex than in traditional environments: Multiple orders are concurrently assembled by each picker, many alternative depots are available, and items of the same SKU are available in multiple shelves. This paper defines the resulting picker-routing problem in mixed-shelves warehouses and provides efficient solution methods. Furthermore, we use the developed methods to explore important managerial aspects. Specifically, we benchmark mixed-shelves storage against traditional storage policies for scenarios with different ratios between small-sized and large-sized orders. In this way, we investigate whether mixed-shelves storage is also a suitable policy if an omni-channel sales strategy is pursued, and large-sized orders of brick-and-mortar stores as well as small-sized online orders are to be jointly processed by the same warehouse.
Article
Scattered storage is a storage assignment strategy where single items are isolated and distributed all around the shelves of a warehouse. This way, the probability of always having some items per stock-keeping units close-by is increased, which is intended to reduce the unproductive walking time during order picking. Scattered storage is especially suited if each order line demands just a few items, so that it is mainly applied by business-to-consumer online retailers. This paper formulates a storage assignment problem supporting the scattered storage strategy. We provide and test suited solution procedures and investigate important managerial aspects, such as the frequency with which refilling the shelves should be executed. The online appendix is available at https://doi.org/10.1287/trsc.2017.0779 .
Article
E-commerce retailers face the challenge to assemble large numbers of time-critical picking orders each consisting of just a few order lines with low order quantities. Traditional picker-to-parts warehouses are often ill-suited for these prerequisites, so that automated warehousing systems (e.g., automated picking workstations, robots, and AGV-assisted order picking systems) are applied and organizational adaptions (e.g., mixed-shelves storage, dynamic order processing, and batching, zoning and sorting systems) are made in this branch of industry. This paper is dedicated to these warehousing systems especially suited for e-commerce retailers. We discuss suited systems, survey the relevant literature, and define future research needs.
Article
Scattered storage (also denoted as mixed shelves storage) is a warehousing strategy often found in business-to-consumer online retailing. Unit loads are broken down into single items that are spread throughout the warehouse, leading to multiple storage positions per stock keeping unit. This paper investigates the picker routing problem in a rectangular scattered storage warehouse, which differs from classical picker routing problems by being a combined selection and routing problem. A proof of NP-hardness in the strong sense is provided and suited solution procedures are presented. Additionally, the impact of the degree of scatter on the length of picking tours is investigated for differing levels of heterogeneity of the order lines, providing managerial insights on when scattered storage should or should not be applied.