Optimizing a Multi Period Deterministic Inventory Routing Problem in Agriculture Industries

2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

This paper develops a solving model for multi-period deterministic inventory routing problem (MP-DIRP) in supply chain focus on agriculture industries. The issue is how to improve the perishable product delivery process from a distribution centre (DC) to a collection of customers over a planning horizon. This paper proposed a model to achieve optimization in terms of costs respectively. The transportation problem is solved by using a simulation technique and developed using an algebraic modelling language which is known as a mathematical programming language (AMPL) to find an optimal solution within the period. The route for a distribution centre (DC) is set up by a supplier depending on the number of products assigned to each customer, which contributes to determining the best inventory routing problem (IRP) for each period. As a result, by applying the transportation model developed in this study, it is expected that the industries can achieve optimization by minimizing their total inventory and transportation costs.

Cite

CITATION STYLE

APA

Rahim, M. K. I. A., Harahap, A. Z. M. K., Bolaji, B. H., & Ahmad, A. N. A. (2023). Optimizing a Multi Period Deterministic Inventory Routing Problem in Agriculture Industries. Paper Asia, 39(5), 40–47. https://doi.org/10.59953/comp.by.paperasia.v39i5(b).35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free