Inventory Routing Investigations

Show full item record

Please use this identifier to cite or link to this item: http://hdl.handle.net/1853/5028

Title: Inventory Routing Investigations
Author: Song, Jin-Hwa
Abstract: The elimination of distribution inefficiencies, occurring due to the timing of customers' orders is an important reason for companies to introduce vendor managed inventory programs. By managing their customers' inventories, suppliers may be able to reduce demand variability and therefore distribution costs. We develop technology to measure the effectiveness of distribution strategies. We develop a methodology that allows the computation of tight lower bounds on the total mileage required to satisfy customer demand over a period of time. As a result, companies will be able to gain insight into the effectiveness of their distribution strategy. This technology can also be used to suggest desirable delivery patterns and to analyze tactical and strategic decisions. Secondly, we study the inventory routing problem with continuous moves (IRP-CM). 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 IRP-CM 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 a heuristic and an optimization algorithm to construct distribution plans. The heuristic is an innovative randomized greedy algorithm, which includes linear programming based postprocessing technology. To solve the IRP-CM to optimality, we give a time-discretized integer programming model and develop a branch-and-cut algorithm. As instances of time-discretized models tend to be large we discuss several possibilities for reducing the problem size. We introduce a set of valid inequalities, called delivery cover inequalities, in order to tighten the bounds given by the LP relaxation of the time-discretized model. We also introduce branching schemes exploiting the underlying structure of the IRP-CM. An extensive computational study demonstrates the effectiveness of the optimization algorithm. Finally, we present an integrated approach using heuristics and optimization algorithms providing effective and efficient technology for solving inventory problems with continuous moves.
Type: Dissertation
URI: http://hdl.handle.net/1853/5028
Date: 2004-07-08
Publisher: Georgia Institute of Technology
Subject: Logistics
Randomized greedy heuristic
Branch-and-cut
Vendor managed inventory resupply
Delivery cover cuts
Delivery pattern
Pattern selection LP
Base delivery pattern
Inventory routing problem
Performance measurment
IRP-CM
Continuous moves
Physical distribution of goods
Inventory control Computer simulation
Mathematical optimization
Department: Industrial and Systems Engineering
Advisor: Committee Chair: Savelsbergh, Martin; Committee Member: Dutton, Laurie; Committee Member: Erera, Alan; Committee Member: Nemhauser, George; Committee Member: White, Chelsea
Degree: Ph.D.

All materials in SMARTech are protected under U.S. Copyright Law and all rights are reserved, unless otherwise specifically indicated on or in the materials.

Files in this item

Files Size Format View
song_jin-hwa_200407_phd.pdf 586.6Kb PDF View/ Open

This item appears in the following Collection(s)

Show full item record