Heuristics for solving an internet retailer’s dynamic transshipment problem

作者：

Highlights：

• We investigate transshipment strategies for online retailers with dynamic demand.

• We propose three convenient heuristic rules for online retailers’ transshipment problem.

• We identify a heuristic rule which is computationally simple and cost-effective.

• We develop a hybrid strategy that combines allocation planning and transshipment rule.

摘要

•We investigate transshipment strategies for online retailers with dynamic demand.•We propose three convenient heuristic rules for online retailers’ transshipment problem.•We identify a heuristic rule which is computationally simple and cost-effective.•We develop a hybrid strategy that combines allocation planning and transshipment rule.

论文关键词：Transshipment,Inventory,e-Retailing,Heuristics

论文评审过程：Available online 12 March 2014.

论文官网地址：https://doi.org/10.1016/j.eswa.2014.03.004