Benders Decomposition Algorithm for the Single Allocation Hub Location Problems
Tarih: -
Konum: Senate Meeting Room
Speaker: Dr. Nader Ghaffarinasab, Department of Industrial Engineering, University of Tabriz
Abstract
The hub location problem (HLP) is a special type of the facility location problem with numerous applications in the airline industry, postal services, and computer and telecommunications networks. We address two basic variants of the HLP, namely the uncapacitated single allocation hub location problem (USAHLP) and the uncapacitated single allocation p-hub median problem (USApHMP). Exact solution procedures based on Benders decomposition algorithm are proposed to tackle large sized instances of these problems. The standard Benders decomposition algorithm is enhanced through implementation of several algorithmic refinements such as using a new cut disaggregation scheme, generating strong optimality cuts, and an efficient algorithm to solve the dual subproblems. Furthermore, a modern implementation of the algorithm is used where a single search tree is established for the problem and Benders cuts are successively added within a branch-and-cut framework. Extensive computational experiments are conducted to examine the efficiency of the proposed algorithms.
Biography
Dr. Nader Ghaffarinasab is an assistant professor at the Department of Industrial Engineering, University of Tabriz. Dr. Ghaffarinasab has received his PhD in Industrial Engineering from Iran University of Science and Technology (IUST) in 2014. His main interested research areas include Logistics, Transport Economics, Facility Location, and Supply Chain Management. His papers have been published in top optimization journals such as European Journal of Operational Research, Computers & Operations Research, etc. He also has more than four years of experience in teaching and supervising students in departments of industrial engineering.