A Lagrangean Relaxation Approach for the Modular Hub Location Problem

• Main Author: Hosseini, Seyed Babak
• Format: Others
• Published: 2013
• Online Access: http://spectrum.library.concordia.ca/977938/1/Hosseini_MASc_S2014.pdf; Hosseini, Seyed Babak <http://spectrum.library.concordia.ca/view/creators/Hosseini=3ASeyed_Babak=3A=3A.html> (2013) A Lagrangean Relaxation Approach for the Modular Hub Location Problem. Masters thesis, Concordia University.

Hub location problems deal with the location of hub facilities and the allocation of the demand nodes to hub facilities so as to effectively route the demand between origin–destination pairs. Transportation systems such as mail, freight, passenger and even telecommunication systems most often employ hub and spoke networks to provide a strong balance between high service quality and low costs resulting in an economically competitive operation. In this study the Modular Hub Location Problem (Multiple assignments without direct connections) (MHLP-MA) is introduced. A Lagrangean relaxation method is used to approximately solve large scale instances. It relaxes a set of complicating constraints to efficiently obtain lower and upper bounds on the optimal solution of the problem. Computational experiments are performed in order to evaluate the effectiveness and limitations of the proposed model and solution method.