Comparison of the formulations for a hub-and-spoke network design problem under congestion
Date
2016
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Computers and industrial engineering
Print ISSN
0360-8352
Electronic ISSN
Publisher
Elsevier
Volume
101
Issue
Pages
504 - 512
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
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. © 2016 Elsevier Ltd
Course
Other identifiers
Book Title
Keywords
Conic quadratic programming , Hub-and-spoke networks , Nonlinear congestion cost , Valid inequalities , Air transportation , Nonlinear programming , Number theory , Quadratic programming , Site selection , Traffic congestion , Congestion costs , Exact solution , Hub and spoke networks , Hub location problems , Hub-and-spoke network design , Mixed-integer nonlinear programming , Strengthening methods , Valid inequality , Integer programming