Location Routing Inventory Problem Using Robust Optimization Approach

Please enable javascript in your browser.

Heyhat, Shaghayegh | 2017

720 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 50341 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Akbari Jokar, Mohammad Reza
Abstract:
This thesis studies a multi–period location–routing–inventory problem in a three layer supply chain including manufacturers, distribution centers and customers with consideration of capacity constraint in distribution centers and heterogeneous fleet of vehicles. Moreover, the demand parameter is considered uncertain and there is no available information about distribution function of demand parameter. For handling problem uncertainty, Bertsimas and sim robust optimization approach is used and a mixed integer programming is presented for both deterministic problem and robust counterpart problem. Then simulated annealing and genetic algorithms are proposed to solve the model. Comprehensive numerical examples are presented to evaluate the efficiency of proposed algorithms. The results show that genetic algorithm outperforms simulated annealing algorithm in term of solution quality in this problem
Keywords:
Uncertainty ; Robust Optimization ; Genetic Algorithm ; Location-Routing Problem (LRP) ; Inventory-Routing Problem (IRP) ; Simulated Annealing Method ; Three-Stage Supply Chain ; Location-Routing-Inventory Problem

No TOC