Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/107064 
Year of Publication: 
2014
Series/Report no.: 
Schriftenreihe Logistik der Fakultät für Wirtschaftswissenschaften der htw saar No. 7
Publisher: 
Hochschule für Technik und Wirtschaft des Saarlandes, Fakultät für Wirtschaftswissenschaften, Saarbrücken
Abstract: 
We address the problem of designing/redesigning a multi-echelon logistics network over a multi-period planning horizon. Strategic decisions comprise opening new plants and warehouses at candidate sites and selecting their capacities from a set of available discrete sizes. Capacity expansion may occur more than once over the time horizon both at new locations and at existing facilities. Capacity contraction is a viable option as well that involves closing existing plants and/or warehouses. The operation of the network is also subject to logistics decisions involving supplier selection in conjunction with procurement, production, and distribution of multiple products. Distribution channels are to be identified in each time period as well as the modes of transportation for raw materials and end products. Finally, a strategic choice between in-house manufacturing and a mixed approach with product outsourcing is to be taken. We propose a mixed-integer linear programming model and develop several valid inequalities to enhance the original formulation. To gain insight into the complexity of the problem at hand, an extensive computational study is performed with randomly generated instances that are solved with standard mathematical optimization software. Useful managerial insights are derived from varying several parameters and analyzing the impact of different business strategies on various segments of the logistics network.
Subjects: 
logistics network design/re-design
multiple periods
transportation mode selection
product outsourcing
mixed-integer linear programming
Document Type: 
Research Report

Files in This Item:
File
Size
495.14 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.