{"title":"A two-phase heuristic algorithm for designing reliable capacitated logistics networks under disruptions","authors":"D. Shishebori, M. Karimi-Nasab, L. Snyder","doi":"10.1504/EJIE.2017.086178","DOIUrl":null,"url":null,"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]","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2017-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/EJIE.2017.086178","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1504/EJIE.2017.086178","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 4
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]
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.