A two-phase heuristic algorithm for designing reliable capacitated logistics networks under disruptions
by Davood Shishebori; Mehdi Karimi-Nasab; Lawrence V. Snyder
European J. of Industrial Engineering (EJIE), Vol. 11, No. 4, 2017

Abstract: This paper considers the reliable capacitated logistics network design problem (RCLNDP) with system disruptions, which is concerned with locating facilities, constructing transportation links, and allocating their capacities to customers in order to satisfy the demand with minimum expected total cost. Both the facilities and the transportation links are subject to random disruptions, and the expected total cost accounts for the costs of facility location, link construction, and flows in both normal and disrupted conditions. We model this problem as a two-stage stochastic program in which the decision maker establishes plans for facility location and link construction in the first stage (before disruptions are realised) and may choose link flows in the second stage. This is a large-scale mixed-integer optimisation problem and is therefore difficult to solve. Hence, we propose an efficient two-phase heuristic with three possible initial solution-generation methods. [Received 1 November 2015; Revised 3 March 2016; Revised 22 May 2016; Revised 8 June 2016; Accepted 10 June 2016]

Online publication date: Tue, 29-Aug-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com