{"title":"The Robust Optimization Approach for the Community Group Purchase Joint Order Fulfillment and Delivery Problem","authors":"Y. Xia, W. Zeng, C. Zhang","doi":"10.1109/IEEM50564.2021.9672927","DOIUrl":null,"url":null,"abstract":"Due to the community lockdown caused by COVID-19, people are turning to a new retail method called “Community group purchase” to obtain daily consumer goods. Orders from the entire community are aggregated and sent to the retailer. To reduce orders' turnover time, the retailer needs to decide what time to fulfill and deliver these orders, which have different information from the distribution center. This paper studies a joint order fulfillment and delivery problem and proposes an integer programming model. Due to the uncertain order information, the robust optimization approach is introduced to formulate two uncertain models based on different uncertainty sets. Through a series of formulations, the robust models are transformed to the tractable form that can be solved directly by the solver. The numerical experiments are carried out to show the benefits of the two robust optimization models, and managerial insights related to the problem are also presented.","PeriodicalId":6818,"journal":{"name":"2021 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","volume":"12 1","pages":"869-874"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM50564.2021.9672927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Due to the community lockdown caused by COVID-19, people are turning to a new retail method called “Community group purchase” to obtain daily consumer goods. Orders from the entire community are aggregated and sent to the retailer. To reduce orders' turnover time, the retailer needs to decide what time to fulfill and deliver these orders, which have different information from the distribution center. This paper studies a joint order fulfillment and delivery problem and proposes an integer programming model. Due to the uncertain order information, the robust optimization approach is introduced to formulate two uncertain models based on different uncertainty sets. Through a series of formulations, the robust models are transformed to the tractable form that can be solved directly by the solver. The numerical experiments are carried out to show the benefits of the two robust optimization models, and managerial insights related to the problem are also presented.