IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v55y2021i5p1151-1169.html
   My bibliography  Save this article

A Special Case of the Multiple Traveling Salesmen Problem in End-of-Aisle Picking Systems

Author

Listed:
  • Lennart Baardman

    (Stephen M. Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109)

  • Kees Jan Roodbergen

    (Faculty of Economics and Business, Department of Operations, University of Groningen, 9700 AV Groningen, Netherlands)

  • Héctor J. Carlo

    (Industrial Engineering Department, University of Puerto Rico – Mayagüez, Mayagüez 00680, Puerto Rico)

  • Albert H. Schrotenboer

    (School of Engineering, Operations, Planning, Accounting, and Control Group, Eindhoven University of Technology, 5600 MB Eindhoven, Netherlands)

Abstract

This study focuses on the problem of sequencing requests for an end-of-aisle automated storage and retrieval system in which each retrieved load must be returned to its earlier storage location after a worker has picked some products from the load. At the picking station, a buffer is maintained to absorb any fluctuations in speed between the worker and the storage/retrieval machine. We show that, under conditions, the problem of optimally sequencing the requests in this system with a buffer size of m loads forms a special case of the multiple traveling salesmen problem in which each salesman visits the same number of cities. Several interesting structural properties for the problem are mathematically shown. In addition, a branch-and-cut method and heuristics are proposed. Experimental results show that the proposed simulated annealing-based heuristic performs well in all circumstances and significantly outperforms benchmark heuristics. For instances with negligible picking times for the worker, we show that this heuristic provides solutions that are, on average, within 1.8% from the optimal value.

Suggested Citation

  • Lennart Baardman & Kees Jan Roodbergen & Héctor J. Carlo & Albert H. Schrotenboer, 2021. "A Special Case of the Multiple Traveling Salesmen Problem in End-of-Aisle Picking Systems," Transportation Science, INFORMS, vol. 55(5), pages 1151-1169, September.
    • Handle: RePEc:inm:ortrsc:v:55:y:2021:i:5:p:1151-1169
    DOI: 10.1287/trsc.2021.1075
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2021.1075
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2021.1075?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
    ---><---

    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:inm:ortrsc:v:55:y:2021:i:5:p:1151-1169. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.