A bin-packing based heuristic for the integrated inventory and vehicle routing problem
We consider the Integrated Inventory and Vehicle Routing Problem (IIVRP) for a single product distribution system consisting of one upstream central warehouse and multiple downstream retailers and additive manufacturing in a spare parts supply chain in this thesis. In Chapter 2 IIVRP without central...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis-Doctor of Philosophy |
| Language: | English |
| Published: |
Nanyang Technological University
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/172085 |
| _version_ | 1811697438129389568 |
|---|---|
| author | Yang, Yang |
| author2 | Chen Chien-Ming |
| author_facet | Chen Chien-Ming Yang, Yang |
| author_sort | Yang, Yang |
| collection | NTU |
| description | We consider the Integrated Inventory and Vehicle Routing Problem (IIVRP) for a single product distribution system consisting of one upstream central warehouse and multiple downstream retailers and additive manufacturing in a spare parts supply chain in this thesis. In Chapter 2 IIVRP without central inventory, we develop a new heuristic algorithm with a Stationary non-nested Joint Replenishment Policy with Bin-packing feature (SJRPB) to solve this problem. Compared to the existing heuristic of Viswanathan and Mathur (1997), our new heuristic achieves cost savings for randomly generated problems with small to moderate vehicle capacity regardless of the geographical sparsity of retailers' locations. For problems with large vehicle capacity, the solutions generated by our heuristic algorithm improve the cost performance when the locations of the retailers are geographically sparse. In Chapter 3, a more generalized version of IIVRP for a single product distribution system is studied that both the central warehouse and retailers hold inventory. In addition to the decision variables in IIVRP without central inventory problem, the replenishment order amount and schedule at the central warehouse is required to be determined. We develop a new heuristic algorithm called Stationary non-nested Joint Replenishment Policy with Bin-packing feature involving Central inventory (SJRPB-C) to solve this multi-echelon one-warehouse multi-retailer distribution system with central inventory. Computational studies show that in general our heuristic algorithm provides better solutions than a modified SNJRP heuristic, and outperforms the heuristic of Jung and Mathur (2007) under certain scenarios. Chapter 4 investigates the cost performance of two spare parts supply chains, where one is an additive manufacturing enabled distributed production-inventory system and the other one is a mirrored traditional manufacturing system. The central premise is that in distributed additive manufacturing the inventory cost saving from the agile response to demand, reduced leadtime and lowered inventory level potentially offsets the increased production cost of additively manufactured products under certain supply chain configurations and system parameters. We present a series of simulation studies to analyze the impacts of downstream size, leadtime, demand mean, demand variability, cost premiums of additively manufactured products, additive manufacturing printer capacity, and inventory cost parameters on the relative cost performance of the two competing systems. Using simulation, we evaluate the key cost driver in the additive manufacturing system and identify the supply chain configurations that are advantageous for the additive manufacturing enabled distributed production-inventory system. |
| first_indexed | 2024-10-01T07:55:15Z |
| format | Thesis-Doctor of Philosophy |
| id | ntu-10356/172085 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T07:55:15Z |
| publishDate | 2023 |
| publisher | Nanyang Technological University |
| record_format | dspace |
| spelling | ntu-10356/1720852024-01-12T10:29:35Z A bin-packing based heuristic for the integrated inventory and vehicle routing problem Yang, Yang Chen Chien-Ming Viswanathan, S Nanyang Business School cmchen@ntu.edu.sg, ASVISWA@ntu.edu.sg Business::Operations management::Supply chain management We consider the Integrated Inventory and Vehicle Routing Problem (IIVRP) for a single product distribution system consisting of one upstream central warehouse and multiple downstream retailers and additive manufacturing in a spare parts supply chain in this thesis. In Chapter 2 IIVRP without central inventory, we develop a new heuristic algorithm with a Stationary non-nested Joint Replenishment Policy with Bin-packing feature (SJRPB) to solve this problem. Compared to the existing heuristic of Viswanathan and Mathur (1997), our new heuristic achieves cost savings for randomly generated problems with small to moderate vehicle capacity regardless of the geographical sparsity of retailers' locations. For problems with large vehicle capacity, the solutions generated by our heuristic algorithm improve the cost performance when the locations of the retailers are geographically sparse. In Chapter 3, a more generalized version of IIVRP for a single product distribution system is studied that both the central warehouse and retailers hold inventory. In addition to the decision variables in IIVRP without central inventory problem, the replenishment order amount and schedule at the central warehouse is required to be determined. We develop a new heuristic algorithm called Stationary non-nested Joint Replenishment Policy with Bin-packing feature involving Central inventory (SJRPB-C) to solve this multi-echelon one-warehouse multi-retailer distribution system with central inventory. Computational studies show that in general our heuristic algorithm provides better solutions than a modified SNJRP heuristic, and outperforms the heuristic of Jung and Mathur (2007) under certain scenarios. Chapter 4 investigates the cost performance of two spare parts supply chains, where one is an additive manufacturing enabled distributed production-inventory system and the other one is a mirrored traditional manufacturing system. The central premise is that in distributed additive manufacturing the inventory cost saving from the agile response to demand, reduced leadtime and lowered inventory level potentially offsets the increased production cost of additively manufactured products under certain supply chain configurations and system parameters. We present a series of simulation studies to analyze the impacts of downstream size, leadtime, demand mean, demand variability, cost premiums of additively manufactured products, additive manufacturing printer capacity, and inventory cost parameters on the relative cost performance of the two competing systems. Using simulation, we evaluate the key cost driver in the additive manufacturing system and identify the supply chain configurations that are advantageous for the additive manufacturing enabled distributed production-inventory system. Doctor of Philosophy 2023-12-04T01:52:39Z 2023-12-04T01:52:39Z 2023 Thesis-Doctor of Philosophy Yang, Y. (2023). A bin-packing based heuristic for the integrated inventory and vehicle routing problem. Doctoral thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/172085 https://hdl.handle.net/10356/172085 10.32657/10356/172085 en This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). application/pdf Nanyang Technological University |
| spellingShingle | Business::Operations management::Supply chain management Yang, Yang A bin-packing based heuristic for the integrated inventory and vehicle routing problem |
| title | A bin-packing based heuristic for the integrated inventory and vehicle routing problem |
| title_full | A bin-packing based heuristic for the integrated inventory and vehicle routing problem |
| title_fullStr | A bin-packing based heuristic for the integrated inventory and vehicle routing problem |
| title_full_unstemmed | A bin-packing based heuristic for the integrated inventory and vehicle routing problem |
| title_short | A bin-packing based heuristic for the integrated inventory and vehicle routing problem |
| title_sort | bin packing based heuristic for the integrated inventory and vehicle routing problem |
| topic | Business::Operations management::Supply chain management |
| url | https://hdl.handle.net/10356/172085 |
| work_keys_str_mv | AT yangyang abinpackingbasedheuristicfortheintegratedinventoryandvehicleroutingproblem AT yangyang binpackingbasedheuristicfortheintegratedinventoryandvehicleroutingproblem |