IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v35y2025i3p51-71id3.html
   My bibliography  Save this article

Proposal of a new metaheuristic for the picker's route designation in warehouse management

Author

Listed:
  • Krzysztof Dmytrów

  • Andrzej Dudek

Abstract

The order picking is the most time- and work-consuming component of total warehouse operations. As travelling takes up the most of the order picking time, reduction of the picker's route length can help decreasing it. The aim of the research is to develop a new routing metaheuristic with the use of R project language for designing the picker's route in warehouse management that will provide better results than other, widely used routing heuristics. We apply the proposed metaheuristic in the classical, picker-to-parts, one-block rectangular warehouse with random storage assignment. We compare the results with the results obtained by its means with the most widely used routing heuristics: s-shape, return and midpoint. We assume the shared storage and various take-out strategies. Locations to be visited were obtained by using the COPRAS (COmplex PRoportial ASsessment) method. The criterion for assessment of applied metaheuristic is the length of the picking route for every take-out strategy. Obtained results indicate that the proposed metaheuristic provided shorter routes as compared with other routing heuristics.

Suggested Citation

  • Krzysztof Dmytrów & Andrzej Dudek, 2025. "Proposal of a new metaheuristic for the picker's route designation in warehouse management," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 35(3), pages 51-71.
    • Handle: RePEc:wut:journl:v:35:y:2025:i:3:p:51-71:id:3
    DOI: 10.37190/ord250303
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/ord2025vol35no3_3.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.37190/ord250303?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wut:journl:v:35:y:2025:i:3:p:51-71:id:3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.