Loading...

Inventory Routing Problem with Consideration of Reverse Logistics and Transshipment

Akefi, Hossein | 2015

516 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 47424 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Akbari Jokar, Mohammad Reza
  7. Abstract:
  8. In this thesis, two Inventory-Routing Problem models, under vendor managed inventory policy are presented. In the first proposed model, despite the previous researches, transshipments between retailers are permitted and the problem is modeled by the assumption of reverse flow in the distribution network. Based on the first model, we also formulate a new model for the Pallet managing problem. Since the inventory routing problem is known as NP-Hard, genetic and variable neighborhood search algorithm has been applied to determine an acceptable upper bound for the first model in different instances. In the next step a Lagrangian relaxation method is developed for finding a near optimal solution of the problem to evaluate and analyze performance of the genetic and variable neighborhood search algorithms. We also used the solution which obtained by the Lagrangian relaxation method to develop a heuristic procedure to find better upper bound for the problem. The numerical experiments show that the proposed variable neighborhood search algorithm performs better than others algorithms and obtain a quite good solution for the model in reasonable computation times. The results also prove that the Lagrangian relaxation method can be used to provide a quick and tight lower bound for the problem
  9. Keywords:
  10. Optimization ; Genetic Algorithm ; Inventory-Routing Problem (IRP) ; Lagrangian Relaxation ; Variable Neighborhood Search ; Reverse Flow

 Digital Object List

 Bookmark

No TOC