Solving a multiperiod inv entory routing problem with stochastic unstationary demand rates
The inventory routing problem (IRP) is one of the most challenging problems in logistics and supply chain management (SCM). It aims to optimise the integration between inventory management and vehicle routing operations in a supply network. IRP arise invol ving the inventory and distribution process...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | eng eng eng |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://etd.uum.edu.my/10223/1/permission%20to%20use-NOT%20ALLOWED.pdf https://etd.uum.edu.my/10223/2/s902153_01.pdf https://etd.uum.edu.my/10223/3/s902153_02.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The inventory routing problem (IRP) is one of the most challenging problems in logistics and supply chain management (SCM). It aims to optimise the integration between inventory management and vehicle routing operations in a supply network. IRP arise invol ving the inventory and distribution process consisting of a set of vehicle routes, delivery quantities, and delivery times that minimise the total inventory and transportation costs with the implementation of vendormanaged inventory (VMI) policies. VMI is a policy in which a supplier assumes the responsibility of maintaining the inventory for the customer while ensuring that they will not run out of stock. Thus, this research aims to develop a mathematical model known as a mixedinteger programming model t problem (MPo solve a multiperiod stochastic unstationary inventory routing SUIRP) in which the demand is considered non problem focuses on the oneto-- consistent over time. The many network, where a single warehouse needs to serve several customers over t he planning horizon. The inventories are transported from a warehouse to a set of customers using a fleet of homogeneous vehicles to meet the customer's requirements. As a condition, a customer is allowed to be visited once over a given period. A customer’ s demand rates in each period are stochastic unstationary and the warehouse is implementing a VMI. This problem is solved using a simulation software called a mathematical programming language (AMPL) to achieve the optimization result. The mathematical mod el is modified by the addition of a forecasting technique to determine the customer demand rates to supply the inventories and develop the best vehicle routes for the delivery process. A sensitivity analysis is performed on the critical parameters that inf luence the optimization results. The computational results show that the algorithms that implement this modified formulation can achieve a better optimization result. Thus, this study helps the organisation optimise the total inventory and transportation c osts for the benefit of financial performance. |
|---|