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

Creative Commons License

Kian R., Kargar Mohammadi K.

COMPUTERS & INDUSTRIAL ENGINEERING, vol.101, pp.504-512, 2016 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 101
  • Publication Date: 2016
  • Doi Number: 10.1016/j.cie.2016.09.019
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Page Numbers: pp.504-512
  • Keywords: Hub-and-spoke networks, Nonlinear congestion cost, Conic quadratic programming, Valid inequalities, CONTROLLABLE PROCESSING TIMES, LOCATION PROBLEM, PERSPECTIVE, FACILITIES
  • TED University Affiliated: No


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.