社区团购联合订单履行与交付问题的鲁棒优化方法

Y. Xia, W. Zeng, C. Zhang
{"title":"社区团购联合订单履行与交付问题的鲁棒优化方法","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":"{\"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}","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

摘要

由于新型冠状病毒感染症(COVID-19)导致的社区封锁,人们正在转向一种名为“社区团购”的新零售方式,以获取日常消费品。来自整个社区的订单被汇总并发送给零售商。为了减少订单的周转时间,零售商需要决定何时完成和交付这些订单,这些订单与配送中心的信息不同。研究了一个联合订单履行与交货问题,提出了一个整数规划模型。针对订单信息的不确定性,引入鲁棒优化方法,建立了基于不同不确定性集的两种不确定模型。通过一系列的表述,将鲁棒模型转化为可被求解器直接求解的可处理形式。数值实验显示了这两种鲁棒优化模型的优点,并提出了与该问题相关的管理见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Robust Optimization Approach for the Community Group Purchase Joint Order Fulfillment and Delivery Problem
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Representing Control Software Functionality as Part of a Modular, Mechatronic Construction Kit Situational Awareness and Flight Approach Phase Event Recognition Based on Psychophysiological Measurements The Robust Optimization Approach for the Community Group Purchase Joint Order Fulfillment and Delivery Problem Application of the Multistage One-shot Decision-making Approach to an IT Project in the Central Bank of Oman A Review on Electric Bus Charging Scheduling from Viewpoints of Vehicle Scheduling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1