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

Available
The embargo period has ended, and this item is now available.

Files

Comparison_of_the_formulations_for_a_hub-and-spoke_network_design_problem_under_congestion.pdf (451.1 KB)

Date

2016

Authors

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
5
views
16
downloads

Citation Stats

  • Share

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

Source Title

Computers and industrial engineering

Publisher

Elsevier

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

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/36863

Published Version (Please cite this version)

http://dx.doi.org/10.1016/j.cie.2016.09.019

Collections

Scholarly Publications - Industrial Engineering

Language

English

Type

Article