A New Method for Supply Chain Optimization with Facility Fail Risks

Supply chain optimization models typically assume that facilities never fail. However, in the real world cases facilities are always subject to disruptions of various sorts due to natural disasters, strikes, machine breakdowns, power outages, and other factors. This paper investigates an integrated...

Full description

Saved in:
Bibliographic Details
Published in2013 Ninth International Conference on Computational Intelligence and Security pp. 353 - 357
Main Author Hong Li Yin
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2013
Subjects
Biological cells
Computational modeling
Electric breakdown
Facility disruption
Genetic algorithm
Genetic algorithms
Linear programming
Optimization
Programming model
Supply chain
Supply chains
Online AccessGet full text
DOI10.1109/CIS.2013.81

Cover

More Information
Summary:Supply chain optimization models typically assume that facilities never fail. However, in the real world cases facilities are always subject to disruptions of various sorts due to natural disasters, strikes, machine breakdowns, power outages, and other factors. This paper investigates an integrated supply chain optimization problem that optimizes facility locations, customer allocations, and inventory management decisions when facilities are subject to disruption risks. When a facility fails, its customers may be reassigned to other operational facilities in order to avoid the high penalty costs associated with losing service. The problem is formulated as a mixed integer nonlinear programming to minimize the sum of the expected total costs. The model simultaneously determines the location of distribution centers and the allocation of disruption affected customer to distribution centers. In order to solve the proposed model, an effective solution approach based on genetic algorithm is presented. Finally, computational results for several instances of the problem are given to validate the effectiveness of the proposed model and algorithm.
DOI:10.1109/CIS.2013.81