Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/70862
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | en_US |
dc.creator | Li, Y | en_US |
dc.creator | Shu, J | en_US |
dc.creator | Song, M | en_US |
dc.creator | Zhang, J | en_US |
dc.creator | Zheng, H | en_US |
dc.date.accessioned | 2017-12-28T06:18:20Z | - |
dc.date.available | 2017-12-28T06:18:20Z | - |
dc.identifier.issn | 1091-9856 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/70862 | - |
dc.language.iso | en | en_US |
dc.publisher | INFORMS | en_US |
dc.rights | © 2017 INFORMS | en_US |
dc.rights | This 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.0730 | en_US |
dc.subject | Multisourcing | en_US |
dc.subject | Network design | en_US |
dc.subject | Chance constraint approximation | en_US |
dc.subject | Process flexibility | en_US |
dc.title | Multisourcing supply network design : two-stage chance-constrained model, tractable approximations, and computational results | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Title on author’s file: Multi-sourcing supply network design: Two-stage chance-constrained model, tractable approximations, and computational results | en_US |
dc.identifier.spage | 287 | en_US |
dc.identifier.epage | 300 | en_US |
dc.identifier.volume | 29 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.doi | 10.1287/ijoc.2016.0730 | en_US |
dcterms.abstract | In 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.accessRights | open access | en_US |
dcterms.bibliographicCitation | Informs journal on computing, Spring 2017, v. 29, no. 2, p. 287-300 | en_US |
dcterms.isPartOf | Informs journal on computing | en_US |
dcterms.issued | 2017 | - |
dc.identifier.isi | WOS:000402148100006 | - |
dc.identifier.ros | 2016002969 | - |
dc.identifier.eissn | 1526-5528 | en_US |
dc.identifier.rosgroupid | 2016002907 | - |
dc.description.ros | 2016-2017 > Academic research: refereed > Publication in refereed journal | en_US |
dc.description.validate | 202207 bcrc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | LMS-0422 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | National Natural Science Foundation of China | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 6745393 | - |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Song_Multisourcing_Supply_Network.pdf | Pre-Published version | 811.12 kB | Adobe PDF | View/Open |
Page views
192
Last Week
0
0
Last month
Citations as of Apr 14, 2025
Downloads
247
Citations as of Apr 14, 2025
SCOPUSTM
Citations
11
Citations as of Jul 4, 2024
WEB OF SCIENCETM
Citations
11
Last Week
0
0
Last month
Citations as of May 8, 2025

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