A Warehouse Location-Routing Problem with Time Windows (WLRPTW) in Humanitarian Relief Supply Chain


Kiremitci B., Kiremitci S., KESKİNTÜRK T.

The 3rd International Conference on Innovative Research in Management, Economics and Accounting, İstanbul, Turkey, 15 March 2016, pp.1-8

  • Publication Type: Conference Paper / Full Text
  • City: İstanbul
  • Country: Turkey
  • Page Numbers: pp.1-8
  • Istanbul University Affiliated: Yes

Abstract

In this study, we introduce a new problem for humanitarian relief supply chain: A Warehouse Location-Routing Problem with Time Windows (WLRPTW). Different than the exist models we consider also priorities of shelters. Especially, when the humanitaran assistance needed all the locations can be effected in a different level. Because of that, people in a place that have more humanitarian need related supplies in emergency. We create a random problem with plants, warehouses and shelters which we call them as a costumer. There are different types of costs in the problem: setup cost of possible warehouse locations, transportation cost between plants and warehouses and also transportation cost from warehouse to the costumer. To solve the problem, we have used a genetic algorithm based hybrid metaheuristic that for routing of trucks from the warehouses to the costumers have created by Clarke and Wright Algorithm and a local search algorithm. The results of the problem and a future research have also discussed.