Loading...

A Multisource Location-routing-inventory Problem with Backlogging

Ghorbani, Atiye | 2015

690 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 47748 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Akbari Jokar, Mohammad Reza
  7. Abstract:
  8. This thesis studies a multi-product location-routing-inventory problem in which location-allocation, inventory and routing decisions are to be taken in a three-level supply chain including suppliers, depots and customers. Each product for each depot could be supplied by more than one supplier and each supplier has a limited supplying capacity per period. Products are distributed from depots to customers by a homogeneous fleet of vehicles. Backlogging is allowable for each customer on the condition of not exceeding a fraction of customer’s demand. A mixed-integer programming formulation is presented to describe the problem then a new hybrid heuristic algorithm based on the simulated annealing and imperialist competitive algorithm is designed to solve the model. To evaluate the efficiency of proposed algorithm, comprehensive numerical examples are presented. In addition, proposed algorithm is compared with simulated annealing algorithm in small and large size instances. The results showed that Imperialist Competitive-Simulated Annealing (IC-SA) Algorithm outperforms Simulated Annealing (SA) algorithm in terms of solution quality and convergence rate
  9. Keywords:
  10. Vehicle Routing Problem ; Imperialist Competitive Algorithm ; Vehicle Routing Problem ; Facility Location Model ; Inventory Location Model ; Simulated Annealing Method

 Digital Object List

 Bookmark

No TOC