Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/70862
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorLi, Yen_US
dc.creatorShu, Jen_US
dc.creatorSong, Men_US
dc.creatorZhang, Jen_US
dc.creatorZheng, Hen_US
dc.date.accessioned2017-12-28T06:18:20Z-
dc.date.available2017-12-28T06:18:20Z-
dc.identifier.issn1091-9856en_US
dc.identifier.urihttp://hdl.handle.net/10397/70862-
dc.language.isoenen_US
dc.publisherINFORMSen_US
dc.rights© 2017 INFORMSen_US
dc.rightsThis is the accepted manuscript of the following article: Li, Y., Shu, J., Song, M., Zhang, J., & Zheng, H. (2017). Multisourcing supply network design: two-stage chance-constrained model, tractable approximations, and computational results. INFORMS Journal on Computing, 29(2), 287-300, which has been published in final form at https://doi.org/10.1287/ijoc.2016.0730en_US
dc.subjectMultisourcingen_US
dc.subjectNetwork designen_US
dc.subjectChance constraint approximationen_US
dc.subjectProcess flexibilityen_US
dc.titleMultisourcing supply network design : two-stage chance-constrained model, tractable approximations, and computational resultsen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationTitle on author’s file: Multi-sourcing supply network design: Two-stage chance-constrained model, tractable approximations, and computational resultsen_US
dc.identifier.spage287en_US
dc.identifier.epage300en_US
dc.identifier.volume29en_US
dc.identifier.issue2en_US
dc.identifier.doi10.1287/ijoc.2016.0730en_US
dcterms.abstractIn this paper, we study a multisourcing supply network design problem, in which each retailer faces uncertain demand and can source products from more than one distribution center (DC). The decisions to be simultaneously optimized include DC locations and inventory levels, which set of DCs serves each retailer, and the amount of shipments from DCs to retailers. We propose a nonlinear mixed integer programming model with a joint chance constraint describing a certain service level. Two approaches-set- wise approximation and linear decision rule-based approximation-are constructed to robustly approximate the service level chance constraint with incomplete demand information. Both approaches yield sparse multisourcing distribution networks that effectively match uncertain demand using on-hand inventory, and hence successfully reach a high service level. We show through extensive numerical experiments that our approaches outperform other commonly adopted approximations of the chance constraint.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationInforms journal on computing, Spring 2017, v. 29, no. 2, p. 287-300en_US
dcterms.isPartOfInforms journal on computingen_US
dcterms.issued2017-
dc.identifier.isiWOS:000402148100006-
dc.identifier.ros2016002969-
dc.identifier.eissn1526-5528en_US
dc.identifier.rosgroupid2016002907-
dc.description.ros2016-2017 > Academic research: refereed > Publication in refereed journalen_US
dc.description.validate202207 bcrcen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberLMS-0422-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextNational Natural Science Foundation of Chinaen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS6745393-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Song_Multisourcing_Supply_Network.pdfPre-Published version811.12 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

138
Last Week
0
Last month
Citations as of Apr 21, 2024

Downloads

134
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

11
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
Citations as of Apr 25, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.