IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i10p1746-d426257.html
   My bibliography  Save this article

Optimization of Ordering and Allocation Scheme for Distributed Material Warehouse Based on IGA-SA Algorithm

Author

Listed:
  • Han Jiang

    (School of Mechanical Engineering, Tianjin University, Tianjin 300350, China)

  • Yunlong Wu

    (Beijing Xinfeng Aerospace Equipment Company, Beijing 100143, China)

  • Qing Zhang

    (School of Mechanical Engineering, Tianjin University, Tianjin 300350, China)

Abstract

The distributed material warehouse is the crucial link in the process of modern enterprise construction, and the goal of the enterprise is to save the cost of material distribution and reduce the time of distribution. In order to obtain the optimal ordering and allocation scheme, firstly, a distributed inventory system consisting of an ordering centre, a material coordination centre and n material warehouses are considered, and the cost model of ordering and allocation of the distributed material warehouse is established. Next, the safety stock and the ordering point of the distributed material warehouse are solved. Then the improved genetic algorithm-simulated annealing algorithm (IGA-SA) is used to solve the optimization of the distributed material warehouse. Finally, the application example is given. The results show that the IGA-SA algorithm can effectively reduce inventory cost and improve inventory utilization.

Suggested Citation

  • Han Jiang & Yunlong Wu & Qing Zhang, 2020. "Optimization of Ordering and Allocation Scheme for Distributed Material Warehouse Based on IGA-SA Algorithm," Mathematics, MDPI, vol. 8(10), pages 1-17, October.
  • Handle: RePEc:gam:jmathe:v:8:y:2020:i:10:p:1746-:d:426257
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/10/1746/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/8/10/1746/
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Yuxin Liu & Zihang Qin & Jin Liu, 2023. "An Improved Genetic Algorithm for the Granularity-Based Split Vehicle Routing Problem with Simultaneous Delivery and Pickup," Mathematics, MDPI, vol. 11(15), pages 1-15, July.
    2. Yue Tan & Liyi Gu & Senyu Xu & Mingchao Li, 2024. "Supply Chain Inventory Management from the Perspective of “Cloud Supply Chain”—A Data Driven Approach," Mathematics, MDPI, vol. 12(4), pages 1-30, February.

    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:gam:jmathe:v:8:y:2020:i:10:p:1746-:d:426257. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.