论文标题
在容量限制下快速零售商的转运问题的确定性模型
A Deterministic Model for the Transshipment Problem of a Fast Fashion Retailer under Capacity Constraints
论文作者
论文摘要
在本文中，我们为经营广泛的零售网络的大型服装零售商提供了一个新颖的转运问题。我们的问题的灵感来自于Waikiki土耳其一家非常快的时尚零售商的物流运营，拥有超过450个零售分支机构和数千种产品。转运的目的是使整个零售网络的股票重新平衡，以更好地与需求相匹配。我们将此问题提出为一个大型混合整数线性程序，并采用原始的双重方法来开发拉格朗日放松，以找到上限和基于模拟退火的元启示疗，以找到有希望的解决方案，这两者都证明是非常有效的。尽管我们的元疗法并不总是比商业优化器产生更好的解决方案，但它始终生产出低于7％的最佳差距的解决方案，而商业优化器可能会产生非常差的解决方案，其最佳差距的最佳差距较高，却几乎为300％。我们还进行了一组数值实验，以发现LC Waikiki对其系统的性能和重要管理洞察力的各种操作实践的影响。
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.
