Abstract
Transshipment hubs are the places where cargo can be re-consolidated and transportation modes can be changed. Transshipment hubs are widely used in logistics industry. In this article, we consider a supply chain network design problem for a third party logistics provider in which we obtain the locations of transshipment hubs among promising hub locations for the objective of minimizing the total system cost that includes the transportation cost, the fixed cost and the processing cost. In the problem, the unit cost of transporting cargo between a pair of origin-destination is non-linear and is a decreasing step function, and each unit cargo through the transshipment hub is charged a fixed processing cost. The problem is considered a mixed integer programming problem. However, due to the complexity of the problem, a heuristic solution approach is proposed. The proposed solution is then implemented to a third party logistics provider and their experience shows that significant cost savings are obtained, compared with the current practice.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Diks, E.B., de Kok, A.G.: Controlling a Divergent 2-echelon Network with Transshipments Using the Consistent Appropriate Share Rationing Policy. International Journal of Production Economics 45, 369–379 (1996)
Higginson, J., Bookbinder, J.: Policy Recommendation for a Shipment Consolidation Program. Journal of Business Logistics 15, 87–112 (1994)
Marin, A., Pelegrin, B.: A Branch-and-bound Algorithm for the Transportation Problem with Location of p Transshipment Points. Computers and Operations Research 24, 659–678 (1997)
Pirkul, H., Schilling, D.A.: An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems. Management Science 44, 235–242 (1998)
Rosa, B.D., Improta, G., Ghiani, G., Musmanno, R.: The Arc Routing and Scheduling Problem with Transshipment. Transportation Science 36, 301–313 (2002)
Rudi, N., Kapur, S., Pyke, D.F.: A Two-Location Inventory Model with Transshipment and Local Decision Making. Management Science 47, 1668–1680 (2001)
Shigeno, M., Iwata, S., McCormick, S.T.: Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow. Mathematics of Operational research 25, 76–83 (2000)
Skorin-Kapov, D., O’Kelly, M.E.: Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research 94, 582–593 (1996)
The Logistics Institute Asia Pacific. Third - Party Logistics Results and Findings of the 2004 Ninth Annual Study, Singapore (2004)
Viswanadham, N., Jarvis, J.J., Gaonkar, R.S.: Ten Mega Trends in Logistics, White Paper. The Logistics Institute Asia Pacific (2003)
Wiles, P.G., van Brunt, B.: Optimal Location of Transshipment Depots. Transportation Research Part A 35, 745–771 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwon, S., Park, K., Lee, C., Kim, SS., Kim, HJ., Liang, Z. (2006). Supply Chain Network Design and Transshipment Hub Location for Third Party Logistics Providers. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_97
Download citation
DOI: https://doi.org/10.1007/11751595_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34075-1
Online ISBN: 978-3-540-34076-8
eBook Packages: Computer ScienceComputer Science (R0)