27,029 research outputs found

    What it takes to design a supply chain resilient to major disruptions and recurrent interruptions

    Get PDF
    Global supply chains are more than ever under threat of major disruptions caused by devastating natural and man-made disasters as well as recurrent interruptions caused by variations in supply and demand. This paper presents an optimization model for designing a supply chain resilient to (1) supply/demand interruptions and (2) facility disruptions whose probability of occurrence and magnitude of impact can be mitigated through fortification investments. Numerical results and managerial insights obtained from model implementation are presented. Our analysis focuses on how supply chain design decisions are influenced by facility fortification strategies, a decision maker’s conservatism degree, demand fluctuations, supply capacity variations, and budgetary constraints. Finally, examining the performance of the proposed model using a Monte Carlo simulation method provides additional insights and practical implications

    A Bi-Objective Programming Model for Reliable Supply Chain Network Design Under Facility Disruption

    Get PDF
    Supply chain networks generally are composed of four main entity types: supplier, production centers, distribution centers and demand zones that consist of facilities whose activities involve the transformation of raw material into finished products that are later delivered from the suppliers to the end customers. Supply chain network design as the most important strategic decision in supply chain management plays an important role in the overall environmental and economic performance of the supply chain. The nature and complexity of today’s supply chains network make them vulnerable to various risks. One of the most important risks is disruption risk. Disruptions are costly and can be caused by internal or external sources to the supply chain, thus it is crucial that managers take appropriate measures of responses to reduce its negative effects. A recovery time of disrupted facilities and return it to the normal condition can be an important factor for members of the supply chain. In this paper, a bi-objective model is developed for reliable supply chain network design under facility disruption. To solve this model, we have applied two approaches, i.e., ε constraint method as an exact method and non- dominated sorting genetic algorithm (NSGAII) as a meta-heuristic method

    A contribution to supply chain design under uncertainty

    Get PDF
    Dans le contexte actuel des chaînes logistiques, des processus d'affaires complexes et des partenaires étendus, plusieurs facteurs peuvent augmenter les chances de perturbations dans les chaînes logistiques, telles que les pertes de clients en raison de l'intensification de la concurrence, la pénurie de l'offre en raison de l'incertitude des approvisionnements, la gestion d'un grand nombre de partenaires, les défaillances et les pannes imprévisibles, etc. Prévoir et répondre aux changements qui touchent les chaînes logistiques exigent parfois de composer avec des incertitudes et des informations incomplètes. Chaque entité de la chaîne doit être choisie de façon efficace afin de réduire autant que possible les facteurs de perturbations. Configurer des chaînes logistiques efficientes peut garantir la continuité des activités de la chaîne en dépit de la présence d'événements perturbateurs. L'objectif principal de cette thèse est la conception de chaînes logistiques qui résistent aux perturbations par le biais de modèles de sélection d'acteurs fiables. Les modèles proposés permettent de réduire la vulnérabilité aux perturbations qui peuvent aV, oir un impact sur la continuité des opérations des entités de la chaîne, soient les fournisseurs, les sites de production et les sites de distribution. Le manuscrit de cette thèse s'articule autour de trois principaux chapitres: 1 - Construction d'un modèle multi-objectifs de sélection d'acteurs fiables pour la conception de chaînes logistiques en mesure de résister aux perturbations. 2 - Examen des différents concepts et des types de risques liés aux chaînes logistiques ainsi qu'une présentation d'une approche pour quantifier le risque. 3 - Développement d'un modèle d'optimisation de la fiabilité afin de réduire la vulnérabilité aux perturbations des chaînes logistiques sous l'incertitude de la sollicitation et de l'offre

    Locating and Protecting Facilities Subject to Random Disruptions and Attacks

    Get PDF
    Recent events such as the 2011 Tohoku earthquake and tsunami in Japan have revealed the vulnerability of networks such as supply chains to disruptive events. In particular, it has become apparent that the failure of a few elements of an infrastructure system can cause a system-wide disruption. Thus, it is important to learn more about which elements of infrastructure systems are most critical and how to protect an infrastructure system from the effects of a disruption. This dissertation seeks to enhance the understanding of how to design and protect networked infrastructure systems from disruptions by developing new mathematical models and solution techniques and using them to help decision-makers by discovering new decision-making insights. Several gaps exist in the body of knowledge concerning how to design and protect networks that are subject to disruptions. First, there is a lack of insights on how to make equitable decisions related to designing networks subject to disruptions. This is important in public-sector decision-making where it is important to generate solutions that are equitable across multiple stakeholders. Second, there is a lack of models that integrate system design and system protection decisions. These models are needed so that we can understand the benefit of integrating design and protection decisions. Finally, most of the literature makes several key assumptions: 1) protection of infrastructure elements is perfect, 2) an element is either fully protected or fully unprotected, and 3) after a disruption facilities are either completely operational or completely failed. While these may be reasonable assumptions in some contexts, there may exist contexts in which these assumptions are limiting. There are several difficulties with filling these gaps in the literature. This dissertation describes the discovery of mathematical formulations needed to fill these gaps as well as the identification of appropriate solution strategies

    Efficient Algorithms for Solving Facility Problems with Disruptions

    Get PDF
    This study investigates facility location problems in the presence of facility disruptions. Two types of problems are investigated. Firstly, we study a facility location problem considering random disruptions. Secondly, we study a facility fortification problem considering disruptions caused by random failures and intelligent attacks.We first study a reliable facility location problem in which facilities are faced with the risk of random disruptions. In the literature, reliable facility location models and solution methods have been proposed under different assumptions of the disruption distribution. In most of these models, the disruption distribution is assumed to be completely known, that is, the disruptions are known to be uncorrelated or to follow a certain distribution. In practice, we may have only limited information about the distribution. In this work, we propose a robust reliable facility location model that considers the worst-case distribution with incomplete information. Because the model imposes fewer distributional assumptions, it includes several important reliable facility location problems as special cases. We propose an effective cutting plane algorithm based on the supermodularity of the problem. For the case in which the distribution is completely known, we develop a heuristic algorithm called multi-start tabu search to solve very large instances.In the second part of the work, we study an r-interdiction median problem with fortification that simultaneously considers two types of disruption risks: random disruptions that happen probabilistically and disruptions caused by intentional attacks. The problem is to determine the allocation of limited facility fortification resources to an existing network. The problem is modeled as a bi-level programming model that generalizes the r-interdiction median problem with probabilistic fortification. The lower level problem, that is, the interdiction problem, is a challenging high-degree non-linear model. In the literature, only the enumeration method is applied to solve a special case of the problem. By exploring the special structure property of the problem, we propose an exact cutting plane method for the problem. For the fortification problem, an effective logic based Benders decomposition algorithm is proposed

    Facility Location Planning Under Disruption

    Get PDF
    Facility Location Problems (FLPs) such as the Uncapacitated Facility Location (UFL) and the Capacitated Facility Location (CFL) along with the k-Shortest Path Problem (k-SPP) are important research problems in managing supply chain networks (SCNs) and related operations. In UFL, there is no limit on the facility serving capacity while in CFL such limit is imposed. FLPs aim to find the best facility locations to meet the customer demands within the available capacity with minimized facility establishment and transportation costs. The objective of the (k-SPP) is to find the k minimal length and partial overlapping paths between two nodes in a transport network graph. In the literature, many approaches are proposed to solve these problems. However, most of these approaches assume totally reliable facilities and do not consider the failure probability of the facilities, which can lead to notably higher cost. In this thesis, we investigate the reliable uncapacitated facility location (RUFL)and the reliable capacitated facility location (RCFL) problems, and the k-SPP where potential facilities are exposed to disruption then propose corresponding solution approaches to efficiently handle these problems. An evolutionary learning technique is elaborated to solve RUFL. Then, a non-linear integer programming model is introduced for the RCFL along with a solution approach involving the linearization of the model and its use as part of an iterative procedure leveraging CPLEX for facility establishment and customer assignment along with a knapsack implementation aiming at deriving the best facility fortification. In RUFL and RCFL, we assume heterogeneous disruption with respect to the facilities, each customer is assigned to primary and backup facilities and a fixed fortification budget allows to make a subset of the facilities totally reliable. Finally, we propose a hybrid approach based on graph partitioning and modified Dijkstra algorithm to find k partial overlapping shortest paths between two nodes on a transport network that is exposed to heterogeneous connected node failures. The approaches are illustrated via individual case studies along with corresponding key insights. The performance of each approach is assessed using benchmark results. For the k-SPP, the effect of preferred establishment locations is analyzed with respect to disruption scenarios, failure probability, computation time, transport costs, network size and partitioning parameters
    corecore