Subodha Dharmapriya, Senevi B. Kiridena, N. Shukla
{"title":"Modeling supply network configuration problems with varying demand profiles","authors":"Subodha Dharmapriya, Senevi B. Kiridena, N. Shukla","doi":"10.1109/TEMSCON.2018.8488447","DOIUrl":null,"url":null,"abstract":"In this paper, we develop a novel multi-objective modeling approach to support supply network configuration decisions, while considering varying demand profiles. In so doing, we illustrate how such an approach could contribute to building supply network robustness and resilience. The proposed model entails two key objectives; minimizing lead time and cost across the supply network. The solution approach first employs a bidding mechanism to select a set of supply network entities that match with a given demand profile from a candidate pool of entities. It then applies the popular technique known as N on-dominated Sorting Genetic Algorithm-II to generate a set of Pareto-optimal solutions representing alternative supply network configurations. The proposed model is tested on a case study of a refrigerator supply network to draw delivery time and cost comparisons under static and dynamic demand profiles.","PeriodicalId":346867,"journal":{"name":"2018 IEEE Technology and Engineering Management Conference (TEMSCON)","volume":"173 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Technology and Engineering Management Conference (TEMSCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TEMSCON.2018.8488447","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, we develop a novel multi-objective modeling approach to support supply network configuration decisions, while considering varying demand profiles. In so doing, we illustrate how such an approach could contribute to building supply network robustness and resilience. The proposed model entails two key objectives; minimizing lead time and cost across the supply network. The solution approach first employs a bidding mechanism to select a set of supply network entities that match with a given demand profile from a candidate pool of entities. It then applies the popular technique known as N on-dominated Sorting Genetic Algorithm-II to generate a set of Pareto-optimal solutions representing alternative supply network configurations. The proposed model is tested on a case study of a refrigerator supply network to draw delivery time and cost comparisons under static and dynamic demand profiles.