The presence of different distribution channels in omni-channel retail makes the fulfillment process challenging. When consumers can buy online and pick up their purchased goods at a store, the stores are often visited by a vehicle that supplies the pick-up points (PUPs) and by a vehicle that replenishes the store's inventory. We study the benefit of exploiting any spare capacity in the vehicles replenishing store inventories to reduce online order fulfillment cost by transferring online orders to these vehicles at one or more of the stores visited. This involves choosing transfer locations and the set of stores whose online orders are transferred at these locations so as to minimize the online order fulfillment cost. We present a mixed integer linear programming model as well as an effective and efficient heuristic for solving this problem. An extensive computational study shows that significant benefits can be achieved by sharing capacity across the two channels.

Additional Metadata
Keywords Capacity sharing, Heuristics, Omni-channel retail, Routing, Store transfers, Transportation
Persistent URL dx.doi.org/10.1016/j.trb.2019.10.002, hdl.handle.net/1765/120599
Journal Transportation Research. Part B: Methodological
Citation
Paul, J. (Joydeep), Agatz, N.A.H, & Savelsbergh, M.W.P. (2019). Optimizing Omni-Channel Fulfillment with Store Transfers. Transportation Research. Part B: Methodological, 129, 381–396. doi:10.1016/j.trb.2019.10.002