2017•Universiti Utara Malaysia Institutional Repository (Universiti Utara Malaysia)Open access

Solving the single-period inventory routing problem with the deterministic approach

Mohd Kamarul Irwan Abdul Rahim, Santhirasegaran Nadarajan, Mohd Akhir Ahmad

Open full text 7 citations

Abstract

This paper considers the problem of managing inventory and routing problems in a two-stage supply chain system under a Vendor Managed Inventory (VMI) policy. VMI policy is an integrating decisions between a supplier and the customers. Thus, we assumed that the demand at each customer is stationary and the warehouse is implementing a VMI. The focus of this research is to optimize the inventory and the transportation costs of the customers for a twostage supply chain system. The problem is to define the delivery quantities, delivery times and routes to the customers for the single-period deterministic inventory routing problem (SP-DIRP) system. As a result, a linear mixedinteger program is established for the solutions of the SP-DIRP problem. A detailed analysis of an illustrative example for solving the SP-DIRP problem is presented to describe the integration of the proposed model.

Open-access reader

About this research paper

What this paper is about

This paper considers the problem of managing inventory and routing problems in a two-stage supply chain system under a Vendor Managed Inventory (VMI) policy. VMI policy is an integrating decisions between a supplier and the customers. Thus, we assumed that the demand at each customer is stationary and the warehouse is implementing a VMI. The focus of this research is to optimize the inventory and the transportation costs of the customers for a twostage supply chain system. The problem is to define the delivery quantities, delivery times and routes to the customers for the single-period deterministic inventory routing problem (SP-DIRP) system. As a result, a linear mixedinteger program is established for the solutions of the SP-DIRP problem. A detailed analysis of an illustrative example for solving the SP-DIRP problem is presented to describe the integration of the proposed model.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper considers the problem of managing inventory and routing problems in a two-stage supply chain system under a Vendor Managed Inventory (VMI) policy. VMI policy is an integrating decisions between a supplier and the customers. Thus, we assumed that the demand at each customer is stationary and the warehouse is implementing a VMI. The focus of this research is to optimize the inventory and the transportation costs of the customers for a twostage supply chain system. The problem is to define the delivery quantities, delivery times and routes to the customers for the single-period deterministic inventory routing problem (SP-DIRP) system. As a result, a linear mixedinteger program is established for the solutions of the SP-DIRP problem. A detailed analysis of an illustrative example for solving the SP-DIRP problem is presented to describe the integration of the proposed model.

Key concepts: Supply chain, Vendor, Operations research, Routing (electronic design automation), Inventory theory, Vendor-managed inventory, Computer science, Inventory control

Related papers

Back to paper searchBrowse research topicsOriginal source
Solving the single-period inventory routing problem with the deterministic approach — Research Paper | ScholarLens