Multi-Mode Multi-period Hub Location Allocation Problem

Please enable javascript in your browser.

Sadeghi, Zahra | 2017

602 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 49748 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Akbari Jokar, Mohammad Reza
Abstract:
This paper studies a multi-product, multi-period, multi-allocation hub location problem based on real case in domestic automotive industry. As 3PL companies spread, using dynamic hubs in a contractual manner becomes passible; So in this paper the hub set is the combination of both static and dynamic hubs. The nodes are suppliers, sites and dealers of a supply chain that have certain demand of each product in each period. In this problem backlogging is allowable and causes penalty. Different transportation modes like road and railroad are usable just in hub network. Direct transmission is possible and candidate hubs are capacitated with multi suggested capacities. A mixed integer programming formulation is presented to describe the problem and GAMS is used to solve small size instances. Also, due to the NP-Hardness of the problem a genetic algorithm (GA) and a simulated anealling (SA) are proposed for solving it. Computational results show efficiency of the proposed algorithms in achieving high-quality solutions in a reasonable time. Comparison between this algorithms shows that SA can reach the same solutions in less than quarter of GA’s time
Keywords:
Hub Location Problem ; Multiple Product ; Multimode Resources ; Supply Chain Management (SCM) ; Multiperiod Location ; Dynamic Hub

No TOC