Hub location and Hub network design
buir.advisor | Kara, Bahar Y. | |
dc.contributor.author | Alumur, Sibel Alev | |
dc.date.accessioned | 2016-01-08T18:08:50Z | |
dc.date.available | 2016-01-08T18:08:50Z | |
dc.date.issued | 2009 | |
dc.description | Ankara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2009. | en_US |
dc.description | Thesis (Ph.D.) -- Bilkent University, 2009. | en_US |
dc.description | Includes bibliographical references leaves 138-150. | en_US |
dc.description.abstract | he hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between origin–destination pairs. Hub location problems arise in various application settings in telecommunication and transportation. In the extensive literature on the hub location problem, it has widely been assumed that the subgraph induced by the hub nodes is complete. Throughout this thesis we relax the complete hub network assumption in hub location problems and focus on designing hub networks that are not necessarily complete. We approach to hub location problems from a network design perspective. In addition to the location and allocation decisions, we also study the decision on how the hub network must be designed. We focus on the single allocation version of the problems where each demand center is allocated to a single hub node. We start with introducing the 3-stop hub covering network design problem. In this problem, we aim to design hub networks so that all origin– destination pairs receive service by visiting at most three hubs on a route. Then, we include hub network design decisions in the classical hub location problems introduced in the literature. We introduce the single allocation incomplete p-hub median, hub location with fixed costs, hub covering, and p-hub center network design problems to the literature. Lastly, we introduce the multimodal hub location and hub network design problem. We include the possibility of using different hub links, and allow for different transportation modes between hubs, and for different types of service time promises between origin–destination pairs, while designing the hub network in the multimodal problem. In this problem, we jointly consider transportation costs and travel times, which are studied separately in hub location problems presented in the literature. Computational analyses with all of the proposed models are presented on the various instances of the CAB data set and on the Turkish network. | en_US |
dc.description.provenance | Made available in DSpace on 2016-01-08T18:08:50Z (GMT). No. of bitstreams: 1 0003740.pdf: 1785377 bytes, checksum: 7cb3279ace183d9a046df250fdbaca15 (MD5) | en |
dc.description.statementofresponsibility | Alumur, Sibel Alev | en_US |
dc.format.extent | xv, 153 leaves, illustrations | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/14824 | |
dc.language.iso | English | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Hub location | en_US |
dc.subject | multimodal hub location | en_US |
dc.subject | hub cover | en_US |
dc.subject | phub center | en_US |
dc.subject | p-hub median | en_US |
dc.subject | incomplete hub network design | en_US |
dc.subject.lcc | QA402.6 .A58 2009 | en_US |
dc.subject.lcsh | Location problems (Programming) | en_US |
dc.subject.lcsh | Transportation problems (Programming) | en_US |
dc.subject.lcsh | Transportation Mathematical models. | en_US |
dc.title | Hub location and Hub network design | en_US |
dc.type | Thesis | en_US |
thesis.degree.discipline | Industrial Engineering | |
thesis.degree.grantor | Bilkent University | |
thesis.degree.level | Doctoral | |
thesis.degree.name | Ph.D. (Doctor of Philosophy) |
Files
Original bundle
1 - 1 of 1