2-Echelon Location Routing Problem

Please enable javascript in your browser.

Torabbeigi, Maryam | 2015

891 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 47072 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Eshghi, Koroush
Abstract:
Supply chain management seeks to coordinate supply chain processes to achieve certain goals; one of which is minimizing the overall cost of the system. In this study integration of different supply chain management decisions i.e. location, routing and inventory management is considered in a single model. The products are distributed in a two-echelon distribution system. One type of product is shipped from a single factory to multiple retailers with deterministic demands through a set of distribution centers. The products can be stored in second and third levels facilities. The product is perishable with a certain shelf life. The product is delivered in a way to be consumed before spoilage. A Mixed Integer Linear Programming model is proposed for the problem with two minimizing functions. To solve the model the epsilon-constraint method is used for small-sized instances and Non-Dominated Sorting Genetic Algorithm for large-sized instances. Taguchi Design of Experiments is used for determining the parameters of the genetic algorithm and the results of these two solutions method are compared with each other
Keywords:
Location-Routing Problem (LRP) ; Multi-Objective Function ; Non-Dominate Sorting Genetic Algorithm (NSGAII) Method ; Perishable Products ; Two-Stage Supply Chain ; Integrated Decisions

No TOC