Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Comparison of the formulations for a hub-and-spoke network design problem under congestion
AU - Kian, Ramez
AU - Kargar, Kamyar
N1 - Publisher Copyright: © 2016 Elsevier Ltd
PY - 2016/11/1
Y1 - 2016/11/1
N2 - 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.
AB - 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.
KW - Conic quadratic programming
KW - Hub-and-spoke networks
KW - Nonlinear congestion cost
KW - Valid inequalities
U2 - 10.1016/j.cie.2016.09.019
DO - 10.1016/j.cie.2016.09.019
M3 - Journal article
AN - SCOPUS:84992730940
VL - 101
SP - 504
EP - 512
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
SN - 0360-8352
ER -