Inventory Routing Problem for Perishable Product with Dynamic Demand and Spoilage Rate
DOI:
https://doi.org/10.9744/jirae.5.2.27-32Keywords:
Inventory Routing Problem, Perishable Product, Optimization, Dynamic Demand, Dynamic Spoilage Rate, Genetic AlgorithmAbstract
The paper presents an inventory routing problem for perishable products using dynamic demand and spoilage rate data. This problem has three main costs for the simulation criteria: holding inventory cost, routing shipment cost, and perishable product cost with a single supplier and many retailers. Instead of the problem, there are 2 set decision variables inventory level range and shipping route. The simulation uses a Genetic Algorithm method to find the minimum cost. It shows that the dynamic data demand can be optimized, and the dynamic demand data have bigger cost consequences than the static demand data
Downloads
Published
2020-10-30
Issue
Section
Articles
License
Authors who publish with this journal agree to the following terms:
- Authors retain the copyright and publishing right, and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) followingthe publication of the article, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
