KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Wed, 21 Jul 2010 13:40:19 +0200Wed, 21 Jul 2010 13:40:19 +0200Stochastic programming approaches for risk aware supply chain network design problems
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2204
In this paper, a multi-period supply chain network design problem is addressed. Several aspects of practical relevance are considered such as those related with the financial decisions that must be accounted for by a company managing a supply chain. The decisions to be made comprise the location of the facilities, the flow of commodities and the investments to make in alternative activities to those directly related with the supply chain design. Uncertainty is assumed for demand and interest rates, which is described by a set of scenarios. Therefore, for the entire planning horizon, a tree of scenarios is built. A target is set for the return on investment and the risk of falling below it is measured and accounted for. The service level is also measured and included in the objective function. The problem is formulated as a multi-stage stochastic mixed-integer linear programming problem. The goal is to maximize the total financial benefit. An alternative formulation which is based upon the paths in the scenario tree is also proposed. A methodology for measuring the value of the stochastic solution in this problem is discussed. Computational tests using randomly generated data are presented showing that the stochastic approach is worth considering in these type of problems.S. Nickel; F. Saldanha-da-Gama; H.-P. Zieglerreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2204Wed, 21 Jul 2010 13:40:19 +0200The capacitated single-allocation hub location problem revisited: A note on a classical formulation
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2138
Denote by G = (N;A) a complete graph where N is the set of nodes and A is the set of edges. Assume that a °ow wij should be sent from each node i to each node j (i; j 2 N). One possibility is to send these °ows directly between the corresponding pairs of nodes. However, in practice this is often neither e±cient nor costly attractive because it would imply that a link was built between each pair of nodes. An alternative is to select some nodes to become hubs and use them as consolidation and redistribution points that altogether process more e±ciently the flow in the network. Accordingly, hubs are nodes in the graph that receive tra±c (mail, phone calls, passengers, etc) from di®erent origins (nodes) and redirect this tra±c directly to the destination nodes (when a link exists) or else to other hubs. The concentration of tra±c in the hubs and its shipment to other hubs lead to a natural decrease in the overall cost due to economies of scale.I. Correia; S. Nickel; F. Saldanha-da-Gamareporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2138Fri, 16 Oct 2009 08:58:16 +0200An LP-rounding heuristic to solve a multi-period facility relocation problem
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2142
A general multi-period network redesign problem arising in the context of strategic supply chain planning (SCP) is studied. Several aspects of practical relevance in SCP are captured namely, multiple facility layers with different types of facilities, flows between facilities in the same layer, direct shipments to customers, and facility relocation. An efficient two-phase heuristic approach is proposed for obtaining feasible solutions to the problem, which is initially modeled as a large-scale mixed-integer linear program. In the first stage of the heuristic, a linear programming rounding strategy is applied to second initial values for the binary location variables in the model. The second phase of the heuristic uses local search to correct the initial solution when feasibility is not reached or to improve the solution when its quality does not meet given criteria. The results of an extensive computational study performed on randomly generated instances are reported.T. Melo; S. Nickel; F. Saldanha-da-Gamareporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2142Fri, 16 Oct 2009 08:56:57 +0200Single-allocation hub location problems with capacity choices
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2143
In this paper, an extension to the classical capacitated single-allocation hub location problem is studied in which the size of the hubs is part of the decision making process. For each potential hub a set of capacities is assumed to be available among which one can be chosen. Several formulations are proposed for the problem, which are compared in terms of the bound provided by the linear programming relaxation. Di®erent sets of inequalities are proposed to enhance the models. Several preprocessing tests are also presented with the goal of reducing the size of the models for each particular instance. The results of the computational experiments performed using the proposed models are reported.I. Correia; S. Nickel; F. Saldanha-da-Gamareporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2143Fri, 16 Oct 2009 08:56:34 +0200Facility Location and Supply Chain Management – A comprehensive review
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1985
Facility location decisions play a critical role in the strategic design of supply chain networks. In this paper, an extensive literature review of facility location models in the context of supply chain management is given. Following a brief review of core models in facility location, we identify basic features that such models must capture to support decision-making involved in strategic supply chain planning. In particular, the integration of location decisions with other decisions relevant to the design of a supply chain network is discussed. Furthermore, aspects related to the structure of the supply chain network, including those specific to reverse logistics, are also addressed. Significant contributions to the current state-of-the-art are surveyed taking into account numerous factors. Supply chain performance measures and optimization techniques are also reviewed. Applications of facility location models to supply chain network design ranging across various industries are discussed. Finally, a list of issues requiring further research are highlighted.T. Melo; S. Nickel; F. Saldanha da Gamareporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1985Wed, 18 Jun 2008 15:28:38 +0200Network design decisions in supply chain planning
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1995
Structuring global supply chain networks is a complex decision-making process. The typical inputs to such a process consist of a set of customer zones to serve, a set of products to be manufactured and distributed, demand projections for the different customer zones, and information about future conditions, costs (e.g. for production and transportation) and resources (e.g. capacities, available raw materials). Given the above inputs, companies have to decide where to locate new service facilities (e.g. plants, warehouses), how to allocate procurement and production activities to the variousmanufacturing facilities, and how to manage the transportation of products through the supply chain network in order to satisfy customer demands. We propose a mathematical modelling framework capturing many practical aspects of network design problems simultaneously. For problems of reasonable size we report on computational experience with standard mathematical programming software. The discussion is extended with other decisions required by many real-life applications in strategic supply chain planning. In particular, the multi-period nature of some decisions is addressed by a more comprehensivemodel, which is solved by a specially tailored heuristic approach. The numerical results suggest that the solution procedure can identify high quality solutions within reasonable computational time.T. Melo; S. Nickel; F. Saldanha-da-Gamareporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1995Wed, 18 Jun 2008 15:27:03 +0200Largescale models for dynamic multicommodity capacitated facility location
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1517
In this paper we focus on the strategic design of supply chain networks. We propose a mathematical modeling framework that captures many practical aspects of network design problems simultaneously but which have not received adequate attention in the literature. The aspects considered include: dynamic planning horizon, generic supply chain network structure, external supply of materials, inventory opportunities for goods, distribution of commodities, facility configuration, availability of capital for investments, and storage limitations. Moreover, network configuration decisions concerning the gradual relocation of facilities over the planning horizon are considered. To cope with fluctuating demands, capacity expansion and reduction scenarios are also analyzed as well as modular capacity shifts. The relation of the proposed modeling framework with existing models is discussed. For problems of reasonable size we report on our computational experience with standard mathematical programming software. In particular, useful insights on the impact of various factors on network design decisions are provided.M.T. Melo; S. Nickel; F. Saldanha da Gamareporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1517Tue, 17 Feb 2004 10:55:35 +0100