Logistics Network Design with Supplier Consolidation Hubs and Multiple Shipment Options
An important service provided by third-party logistics (3PL) firms is to manage the inbound logistics of raw materials and components from multiple suppliers to several manufacturing plants. A key challenge for these 3PL firms is to determine how to coordinate and consolidate the transportation flow...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2007
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2449 https://ink.library.smu.edu.sg/context/sis_research/article/3448/viewcontent/Logistics_Network_Design_with_Supplier_Consolidation_Hubs_and_Mul.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-3448 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-34482021-06-03T04:18:54Z Logistics Network Design with Supplier Consolidation Hubs and Multiple Shipment Options Cheong, Michelle L. F. Bhatnagar, Rohit Graves, Stephen C. An important service provided by third-party logistics (3PL) firms is to manage the inbound logistics of raw materials and components from multiple suppliers to several manufacturing plants. A key challenge for these 3PL firms is to determine how to coordinate and consolidate the transportation flow, so as to get the best overall logistics performance. One tactic is to establish consolidation hubs that collect shipments from several suppliers, consolidate these shipments, and direct the consolidated shipments to the appropriate manufacturing plant. We consider the network design problem to implement this tactic, namely deciding the number, location and operation of consolidation hubs so as to minimize the total logistics costs for the network. To solve this network design problem, we define candidate shipping options for each potential hub, for which we can pre-compute the shipping quantities required from each supplier, and the incurred shipping costs and inventory holding costs. We formulate the problem as an integer linear optimization model and illustrate how to solve large instances using Lagrangian relaxation and a subgradient optimization algorithm. Our results indicate that the bounds obtained are fairly tight and are superior to the bounds obtained from the solution of the LP relaxation. 2007-02-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/2449 info:doi/10.3934/jimo.2007.3.51 https://ink.library.smu.edu.sg/context/sis_research/article/3448/viewcontent/Logistics_Network_Design_with_Supplier_Consolidation_Hubs_and_Mul.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Hub location supply chain design inventory control Computer Sciences Operations and Supply Chain Management |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Hub location supply chain design inventory control Computer Sciences Operations and Supply Chain Management |
spellingShingle |
Hub location supply chain design inventory control Computer Sciences Operations and Supply Chain Management Cheong, Michelle L. F. Bhatnagar, Rohit Graves, Stephen C. Logistics Network Design with Supplier Consolidation Hubs and Multiple Shipment Options |
description |
An important service provided by third-party logistics (3PL) firms is to manage the inbound logistics of raw materials and components from multiple suppliers to several manufacturing plants. A key challenge for these 3PL firms is to determine how to coordinate and consolidate the transportation flow, so as to get the best overall logistics performance. One tactic is to establish consolidation hubs that collect shipments from several suppliers, consolidate these shipments, and direct the consolidated shipments to the appropriate manufacturing plant. We consider the network design problem to implement this tactic, namely deciding the number, location and operation of consolidation hubs so as to minimize the total logistics costs for the network. To solve this network design problem, we define candidate shipping options for each potential hub, for which we can pre-compute the shipping quantities required from each supplier, and the incurred shipping costs and inventory holding costs. We formulate the problem as an integer linear optimization model and illustrate how to solve large instances using Lagrangian relaxation and a subgradient optimization algorithm. Our results indicate that the bounds obtained are fairly tight and are superior to the bounds obtained from the solution of the LP relaxation. |
format |
text |
author |
Cheong, Michelle L. F. Bhatnagar, Rohit Graves, Stephen C. |
author_facet |
Cheong, Michelle L. F. Bhatnagar, Rohit Graves, Stephen C. |
author_sort |
Cheong, Michelle L. F. |
title |
Logistics Network Design with Supplier Consolidation Hubs and Multiple Shipment Options |
title_short |
Logistics Network Design with Supplier Consolidation Hubs and Multiple Shipment Options |
title_full |
Logistics Network Design with Supplier Consolidation Hubs and Multiple Shipment Options |
title_fullStr |
Logistics Network Design with Supplier Consolidation Hubs and Multiple Shipment Options |
title_full_unstemmed |
Logistics Network Design with Supplier Consolidation Hubs and Multiple Shipment Options |
title_sort |
logistics network design with supplier consolidation hubs and multiple shipment options |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2007 |
url |
https://ink.library.smu.edu.sg/sis_research/2449 https://ink.library.smu.edu.sg/context/sis_research/article/3448/viewcontent/Logistics_Network_Design_with_Supplier_Consolidation_Hubs_and_Mul.pdf |
_version_ |
1770572150060613632 |