IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v211y2026ics1366554526002267.html

Joint optimization of order allocation, rack selection, and robot scheduling under flexible storage location

Author

Listed:
  • Xue, Guiqin
  • Wang, Zheng

Abstract

Parts-to-picker intelligent warehousing systems, driven by the concept of “moving goods to stationary pickers”, significantly enhance storage flexibility and facilitate an on-demand goods movement paradigm. However, current practical applications and theoretical studies predominantly rely on the mechanized reset mechanism of “returning racks to their original locations”, thereby undermining the system’s inherent potential for storage location optimization. This study addresses the joint optimization of order allocation, rack selection, and robot scheduling for a wave of orders under a flexible storage location policy. A mixed-integer programming model is formulated to minimize the wave completion time. To solve large-scale instances efficiently, the classical harmony search algorithm is enhanced through the integration of Q-learning. The proposed model and algorithm are validated using real-world operational data from a leading parts-to-picker warehousing enterprise in China. Analytical results demonstrate that the proposed flexible reset mechanism significantly improves the operational efficiency of such warehousing systems.

Suggested Citation

  • Xue, Guiqin & Wang, Zheng, 2026. "Joint optimization of order allocation, rack selection, and robot scheduling under flexible storage location," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 211(C).
  • Handle: RePEc:eee:transe:v:211:y:2026:i:c:s1366554526002267
    DOI: 10.1016/j.tre.2026.104887
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554526002267
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2026.104887?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    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:eee:transe:v:211:y:2026:i:c:s1366554526002267. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.