IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v194y2025ics1366554524005477.html
   My bibliography  Save this article

Column generation for scheduling mobile composite robots in warehouses

Author

Listed:
  • Zhao, Zheng
  • Cheng, Junkai
  • Zhao, Jianyi
  • Zhen, Lu

Abstract

As the e-commerce industry ascends, the strain on warehouse operation to manage order processing has intensified significantly. This paper pioneers the integration of mobile composite robot (MCR) for order assigning and path planning in warehouse. A mathematical model is established with the objective function of minimizing the time to complete orders. An algorithm based on column generation is developed, with dynamic programming and other acceleration strategies applied to improve the efficiency of the pricing problem. Numerical experiments show that the algorithm’s performance matches that of CPLEX in small-scale instances and exhibits the capacity to handle 50 orders in just 5 min. Additional experiments are conducted to substantiate the efficiency of our proposed algorithm and to offer valuable managerial insights to practitioners who are implementing MCR technology in warehouse environments.

Suggested Citation

  • Zhao, Zheng & Cheng, Junkai & Zhao, Jianyi & Zhen, Lu, 2025. "Column generation for scheduling mobile composite robots in warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
  • Handle: RePEc:eee:transe:v:194:y:2025:i:c:s1366554524005477
    DOI: 10.1016/j.tre.2024.103956
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2024.103956?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 search for a different version of it.

    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:194:y:2025:i:c:s1366554524005477. 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.