Shared Capacity Routing Problem − An omni-channel retail study
More and more retailers allow customers to order goods online and then pick them up in a store. In this setting, these orders are typically served from a dedicated warehouse. This often means that the stores are visited by different vehicles to replenish the store inventory and to supply the pick-up points. Motivated by a collaboration with an omni-channel grocery retailer in the Netherlands, we study how to best share capacity between the routes associated with these different sales channels. As operational constraints prevent jointly planning the routes, we consider the replenishment routes as fixed when planning the routes to serve the pick-up orders. An order can be transferred to the replenishment route, if capacity allows. We consider the problem of deciding which customer orders to transfer and which to deliver directly such that the total costs are minimized. We present an exact and a heuristic approach to solve this problem. Computational experiments on both real-world and artificial instances show that substantial savings can be achieved by sharing vehicle capacity across different channels.
|Keywords||Capacity sharing, Heuristics, Omni-channel retail, Transportation, Vehicle routing|
|Persistent URL||dx.doi.org/10.1016/j.ejor.2018.08.027, hdl.handle.net/1765/110133|
|Journal||European Journal of Operational Research|
Paul, J, Agatz, N.A.H, Spliet, R, & de Koster, M.B.M. (2018). Shared Capacity Routing Problem − An omni-channel retail study. European Journal of Operational Research, 273(2), 731–739. doi:10.1016/j.ejor.2018.08.027