IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v37y2021i3p306-333.html
   My bibliography  Save this article

Optimal delivery and replenishment policies for perishable products considering lost sale cost: an efficient hybrid algorithm

Author

Listed:
  • Mahla Babagolzadeh
  • Mohammadali Pirayesh
  • Anup Shrestha

Abstract

In today's competitive global market, improving the quality of customer service and waste reduction are two important factors to maximise the profits of a system. These goals can be achieved throughout well-managed logistical operations such as proper inventory management and timely delivery of perishable items to customers. This paper presents an integrated mathematical model that schedules replenishment of a perishable product to determine delivery routes, truck loads and inventory levels, where the vehicle arrival time has a direct impact on the quantity of the product delivered to customers. Given the NP-hard nature of the problem, finding optimum or near optimum solutions in polynomial time is challenging, therefore a hybrid algorithm based on a linear programming model and a simulated annealing algorithm is developed to solve the problem efficiently. The proposed method achieves a solution near-optimal solution in an efficient computational time. Finally, an analysis is carried out to verify the effectiveness of the algorithm.

Suggested Citation

  • Mahla Babagolzadeh & Mohammadali Pirayesh & Anup Shrestha, 2021. "Optimal delivery and replenishment policies for perishable products considering lost sale cost: an efficient hybrid algorithm," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 37(3), pages 306-333.
  • Handle: RePEc:ids:ijisen:v:37:y:2021:i:3:p:306-333
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=113442
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:ijisen:v:37:y:2021:i:3:p:306-333. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.