Login | Register

A Lagrangean Relaxation Approach for the Modular Hub Location Problem

Title:

A Lagrangean Relaxation Approach for the Modular Hub Location Problem

Hosseini, Seyed Babak (2013) A Lagrangean Relaxation Approach for the Modular Hub Location Problem. Masters thesis, Concordia University.

[img]
Preview
Text (application/pdf)
Hosseini_MASc_S2014.pdf - Accepted Version
Available under License Spectrum Terms of Access.
1MB

Abstract

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.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Mechanical and Industrial Engineering
Item Type:Thesis (Masters)
Authors:Hosseini, Seyed Babak
Institution:Concordia University
Degree Name:M.A. Sc.
Program:Industrial Engineering
Date:11 October 2013
Thesis Supervisor(s):Contreras, Ivan and Chauhan, Satyaveer
ID Code:977938
Deposited By: SEYED BABAK HOSSEINI
Deposited On:16 Jun 2014 20:11
Last Modified:18 Jan 2018 17:45
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Back to top Back to top