Loading...

Optimization of Inventory Routing Problem Based on VMI

Pourmohsen, Roxana | 2017

456 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 50273 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Akbari Jokar, Mohammad Reza
  7. Abstract:
  8. This thesis introduces a inventory-routing problem under a vendor managed inventory strategy in a two-echelon supply chain. The VMI Routing problem in this study consists of multiple suppliers, multiple retailers and a single item. The suppliers plan inventory replenishments for retailers based on deterministic demand over multiple planning period. Also they allow stock-outs at retailers, which are considered lostsales. Transshipments are allowed, neither between suppliers nor between customers. Retailers can be supplied just by one assigned supplier. Model also considers some constraints on time and capacity. A mixed integer programming formulation is presented to describe the model. We consider cost minimization as first objective and solve the model as a single objective problem. Then we add the shortage rate minimization as second objective and solve the model as a bi-objective problem. We used Taguchi method for parameters tuning. We propose Genetic algorithm and simulated annealing for solving single objective model and e-constraint exact method and NSGAII meta-heuristic algorithm for the bi-objective model. In each problem Solutions of two methods are compared and sensitivity analysis results are shown
  9. Keywords:
  10. Routing ; Vendor Managed Inventory (VMI) ; Lost Sale ; Optimization ; Genetic Algorithm ; Simulated Annealing Method ; Transshipment

 Digital Object List

 Bookmark

No TOC