IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6153848.html
   My bibliography  Save this article

A Building-Block-Based Genetic Algorithm for Solving the Robots Allocation Problem in a Robotic Mobile Fulfilment System

Author

Listed:
  • Jingtian Zhang
  • Fuxing Yang
  • Xun Weng

Abstract

Robotic mobile fulfilment system (RMFS) is an efficient and flexible order picking system where robots ship the movable shelves with items to the picking stations. This innovative parts-to-picker system, known as Kiva system, is especially suited for e-commerce fulfilment centres and has been widely used in practice. However, there are lots of resource allocation problems in RMFS. The robots allocation problem of deciding which robot will be allocated to a delivery task has a significant impact on the productivity of the whole system. We model this problem as a resource-constrained project scheduling problem with transfer times (RCPSPTT) based on the accurate analysis of driving and delivering behaviour of robots. A dedicated serial schedule generation scheme and a genetic algorithm using building-blocks-based crossover (BBX) operator are proposed to solve this problem. The designed algorithm can be combined into a dynamic scheduling structure or used as the basis of calculation for other allocation problems. Experiment instances are generated based on the characteristics of RMFS, and the computation results show that the proposed algorithm outperforms the traditional rule-based scheduling method. The BBX operator is rapid and efficient which performs better than several classic and competitive crossover operators.

Suggested Citation

  • Jingtian Zhang & Fuxing Yang & Xun Weng, 2019. "A Building-Block-Based Genetic Algorithm for Solving the Robots Allocation Problem in a Robotic Mobile Fulfilment System," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-15, February.
    • Handle: RePEc:hin:jnlmpe:6153848
    DOI: 10.1155/2019/6153848
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/6153848.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2019/6153848.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2019/6153848?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Justkowiak, Jan-Erik & Pesch, Erwin, 2023. "Stronger mixed-integer programming-formulations for order- and rack-sequencing in robotic mobile fulfillment systems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1063-1078.
    2. Liu, Ying & Zhou, Jing & Lim, Andrew & Hu, Qian, 2023. "A tree search heuristic for the resource constrained project scheduling problem with transfer times," European Journal of Operational Research, Elsevier, vol. 304(3), pages 939-951.
    3. Jianming Cai & Xiaokang Li & Yue Liang & Shan Ouyang, 2021. "Collaborative Optimization of Storage Location Assignment and Path Planning in Robotic Mobile Fulfillment Systems," Sustainability, MDPI, vol. 13(10), pages 1-26, May.
    4. Xie, Lin & Thieme, Nils & Krenzler, Ruslan & Li, Hanyi, 2021. "Introducing split orders and optimizing operational policies in robotic mobile fulfillment systems," European Journal of Operational Research, Elsevier, vol. 288(1), pages 80-97.
    5. Justkowiak, Jan-Erik & Pesch, Erwin, 2023. "A column generation driven heuristic for order-scheduling and rack-sequencing in robotic mobile fulfillment systems," Omega, Elsevier, vol. 120(C).

    More about this item

    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:hin:jnlmpe:6153848. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.