arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2001.02499math.OC
收藏

能力约束下快速服装零售商转运问题的确定性模型

A Deterministic Model for the Transshipment Problem of a Fast Fashion Retailer under Capacity Constraints

Siamak Naderi, Kemal Kilic, Abdullah Dasci

摘要:

在本文中,我们提出了一个新的转运问题的大型服装零售商,经营广泛的零售网络。我们的问题受到土耳其一家非常大的快速时尚零售商LC Waikiki的物流运营的启发,该零售商拥有450多家零售分支机构和数千种产品。转运的目的是重新平衡整个零售网络的库存,以更好地匹配供需。我们制定这个问题作为一个大的混合整数线性规划,并制定了拉格朗日松弛的原始-对偶方法找到上界和模拟退火为基础的元启发式找到有前途的解决方案,这两个已被证明是非常有效的。虽然我们的元启发式算法并不总是产生比商业优化器更好的解决方案,但它始终产生最优性差距低于7%的解决方案,而商业优化器可能产生最优性差距高达近300%的非常差的解决方案。我们还进行了一组数值实验,以揭示各种操作实践的LC威基基其系统的性能和重要的管理见解的影响。

英文摘要:

In this paper we present a novel transshipment problem for a large apparel retailer that operates an extensive retail network. Our problem is inspired by the logistics operations of a very large fast fashion retailer in Turkey, LC Waikiki, with over 450 retail branches and thousands of products. The purpose of transshipments is to rebalance stocks across the retail network to better match supply with demand. We formulate this problem as a large mixed integer linear program and develop a Lagrangian relaxation with a primal-dual approach to find upper bounds and a simulated annealing based metaheuristic to find promising solutions, both of which have proven to be quite effective. While our metaheuristic does not always produce better solutions than a commercial optimizer, it has consistently produced solutions with optimality gaps lower than 7% while the commercial optimizer may produce very poor solutions with optimality gaps as high as almost 300%. We have also conducted a set of numerical experiments to uncover implications of various operational practices of LC Waikiki on its system's performance and important managerial insights.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑