IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i22p6691-6707.html
   My bibliography  Save this article

Demand-predictive storage assignment mechanism for flower auction centers

Author

Listed:
  • Xiang T.R. Kong
  • Miaohui Zhu
  • Kaida Qin
  • Pengyu Yan

Abstract

As the number of daily transactions continues to increase, congestion frequently occurs in flower auction centers. Put system is widely applied in intralogistics operations, which includes distribution and redistribution areas. The uncertain arrivals of demands pose significant challenges for the efficient intralogistics operations in flower auction center. In order to improve performance of the put system, this study newly designs a demand-predictive storage assignment (DSA) mechanism in which uncertain demands are forecasted by constructing $A/F $A/F ratio time series of each customer. Based on the demand forecasts, the customer locations within the distribution area and the number of locations within the redistribution area are easily determined. Furthermore, a paired redistribution strategy is proposed that enables two customers to share a staging block. A simulation experiment bed is constructed based on a real-life case. The experimental results indicate that the $A/F $A/F forecasting method outperforms other demand forecast methods in literature with lower forecasting error, and the proposed DSA mechanism reduces the total travel distance compared with the closest open location.

Suggested Citation

  • Xiang T.R. Kong & Miaohui Zhu & Kaida Qin & Pengyu Yan, 2022. "Demand-predictive storage assignment mechanism for flower auction centers," International Journal of Production Research, Taylor & Francis Journals, vol. 60(22), pages 6691-6707, November.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:22:p:6691-6707
    DOI: 10.1080/00207543.2021.1900617
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1900617
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1900617?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.

    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:taf:tprsxx:v:60:y:2022:i:22:p:6691-6707. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.