Comparison of the formulations for a hub-and-spoke network design problem under congestion
dc.citation.epage | 512 | en_US |
dc.citation.spage | 504 | en_US |
dc.citation.volumeNumber | 101 | en_US |
dc.contributor.author | Kian, Ramer | en_US |
dc.contributor.author | Kargar, Kamyar | en_US |
dc.date.accessioned | 2018-04-12T10:55:46Z | |
dc.date.available | 2018-04-12T10:55:46Z | |
dc.date.issued | 2016 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.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 | en_US |
dc.description.provenance | Made available in DSpace on 2018-04-12T10:55:46Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 179475 bytes, checksum: ea0bedeb05ac9ccfb983c327e155f0c2 (MD5) Previous issue date: 2016 | en |
dc.embargo.release | 2019-11-01 | en_US |
dc.identifier.doi | 10.1016/j.cie.2016.09.019 | en_US |
dc.identifier.issn | 0360-8352 | |
dc.identifier.uri | http://hdl.handle.net/11693/36863 | |
dc.language.iso | English | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1016/j.cie.2016.09.019 | en_US |
dc.source.title | Computers and industrial engineering | en_US |
dc.subject | Conic quadratic programming | en_US |
dc.subject | Hub-and-spoke networks | en_US |
dc.subject | Nonlinear congestion cost | en_US |
dc.subject | Valid inequalities | en_US |
dc.subject | Air transportation | en_US |
dc.subject | Nonlinear programming | en_US |
dc.subject | Number theory | en_US |
dc.subject | Quadratic programming | en_US |
dc.subject | Site selection | en_US |
dc.subject | Traffic congestion | en_US |
dc.subject | Congestion costs | en_US |
dc.subject | Exact solution | en_US |
dc.subject | Hub and spoke networks | en_US |
dc.subject | Hub location problems | en_US |
dc.subject | Hub-and-spoke network design | en_US |
dc.subject | Mixed-integer nonlinear programming | en_US |
dc.subject | Strengthening methods | en_US |
dc.subject | Valid inequality | en_US |
dc.subject | Integer programming | en_US |
dc.title | Comparison of the formulations for a hub-and-spoke network design problem under congestion | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Comparison_of_the_formulations_for_a_hub-and-spoke_network_design_problem_under_congestion.pdf
- Size:
- 451.1 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version