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

Cutting down the travel distance of put systems at Kunming International Flower Auction Market

Author

Listed:
  • Kaida Qin
  • Frank Youhua Chen
  • Lijun Ma

Abstract

At Kunming International Flower Auction Market (KIFA), about 2.5 million cut flowers traded in 10,000 transactions need to be distributed daily to buyers in its distribution area. Small lots and many buyers per trolley are two distinctive features at KIFA and the identities of the buyers and their demands are not known in advance. The growing transaction volume has recently increased the distribution workforce and the buyers’ waiting time. In this paper, we introduce a modified class-based location policy using KIFA’s historical data to improve its current put system performance. We use the closest-open location method in each class area, which improves the put system performance at KIFA. We examine the effects of the distribution area shape and the number of blocks in each class area on performance measures, and find that KIFA’s put system performance can be further improved.

Suggested Citation

  • Kaida Qin & Frank Youhua Chen & Lijun Ma, 2015. "Cutting down the travel distance of put systems at Kunming International Flower Auction Market," International Journal of Production Research, Taylor & Francis Journals, vol. 53(12), pages 3573-3585, June.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:12:p:3573-3585
    DOI: 10.1080/00207543.2014.980013
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.980013
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2014.980013?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:53:y:2015:i:12:p:3573-3585. 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.