Comparison of the formulations for a hub-and-spoke network design problem under congestion
Yükleniyor...
Dosyalar
Tarih
2016-11
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Pergamon-Elsevier Science Ltd
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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. (C) 2016 Elsevier Ltd. All rights reserved.
Açıklama
Anahtar Kelimeler
Hub-and-spoke networks, Nonlinear congestion cost, Conic quadratic programming, Valid inequalities
Kaynak
Computers & Industrial Engineering
WoS Q Değeri
Q1
