IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_38.html
   My bibliography  Save this book chapter

An Adaptive Large Neighborhood Search Heuristic for Jointly Solving Storage Location Assignment and Picker Routing Problem

In: Operations Research Proceedings 2018

Author

Listed:
  • Necati Aras

    (Boğaziçi University)

  • Berk Görgülü

    (Boğaziçi University)

Abstract

We focus on the order picking operation carried out in one of the major warehouses of a retailer to satisfy the orders placed by the stores of the same retailer. We investigate the simultaneous solution of the storage assignment problem and picker routing problem referred to as JSAPRP that involves both assigning items to storage locations and deciding on the routes of the pickers for item collection. The performance measure of interest is the minimization of the total traveling distance of the pickers. We develop a mathematical model which can only solve small instances of the JSAPRP. Therefore, we also devise a heuristic method based on adaptive large neighborhood search. Computational results obtained on numerous experiments reveal that the quality of the solutions produced by this heuristic is quite good.

Suggested Citation

  • Necati Aras & Berk Görgülü, 2019. "An Adaptive Large Neighborhood Search Heuristic for Jointly Solving Storage Location Assignment and Picker Routing Problem," Operations Research Proceedings, in: Bernard Fortz & Martine Labbé (ed.), Operations Research Proceedings 2018, pages 301-307, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_38
    DOI: 10.1007/978-3-030-18500-8_38
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-030-18500-8_38. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.