Comparison of the formulations for a hub-and-spoke network design problem under congestion

Kian, R. ORCID: 0000-0001-8786-6349 and Kargar, K., 2016. Comparison of the formulations for a hub-and-spoke network design problem under congestion. Computers & Industrial Engineering, 101, pp. 504-512. ISSN 0360-8352

[img]
Preview
Text
11158_Kian.pdf - Published version

Download (461kB) | Preview

Abstract

In this paper, we study the hub location problem with a power-law congestion cost and propose an exact solution approach. We formulate this problem in a conic quadratic form and use a strengthening method which rests on valid inequalities of perspective cuts in mixed integer nonlinear programming. In a numerical study, we compare two well known types of mathematical modeling in the hub-location problems which are solved with different branch and cut strategies. The strength and weakness of the formulations are summarized based on an extensive numerical study over the CAB data set.

Item Type: Journal article
Publication Title: Computers & Industrial Engineering
Creators: Kian, R. and Kargar, K.
Publisher: Elsevier Ltd.
Date: November 2016
Volume: 101
ISSN: 0360-8352
Identifiers:
NumberType
10.1016/j.cie.2016.09.019DOI
S036083521630359XPublisher Item Identifier
Rights: © 2016 Elsevier Ltd. All rights reserved.
Divisions: Schools > Nottingham Business School
Depositing User: Jill Tomkinson
Date Added: 22 May 2018 08:16
Last Modified: 22 May 2018 08:16
URI: http://irep.ntu.ac.uk/id/eprint/33636

Actions (login required)

Edit View Edit View

Views

Views per month over past year

Downloads

Downloads per month over past year