Inventory routing with continuous moves

The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all be reached with out-and-back trips. Unfortunately, this is not always the reality. We introduce the inventory routing problem with continuous moves to study two important real-life complexities: limited product availabilities at facilities and customers that cannot be served using out-and-back tours. We need to design delivery tours spanning several days, covering huge geographic areas, and involving product pickups at different facilities. We develop an innovative randomized greedy algorithm, which includes linear programming based postprocessing technology, and we demonstrate its effectiveness in an extensive computational study.

• Type: Journal
• Year: 2007
• Where: COR
• Authors: Martin W. P. Savelsbergh, Jin-Hwa Song
• Keywords: COR 2007, Huge Geographic Areas, Important Real-life Complexities, Limited Product Availabilities