Show simple item record

dc.contributor.advisorKara, Bahar Y.
dc.contributor.authorAlumur, Sibel Alev
dc.date.accessioned2016-01-08T18:08:50Z
dc.date.available2016-01-08T18:08:50Z
dc.date.issued2009
dc.identifier.urihttp://hdl.handle.net/11693/14824
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2009.en_US
dc.descriptionThesis (Ph.D.) -- Bilkent University, 2009.en_US
dc.descriptionIncludes bibliographical references leaves 138-150.en_US
dc.description.abstracthe 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.statementofresponsibilityAlumur, Sibel Aleven_US
dc.format.extentxv, 153 leaves, illustrationsen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectHub locationen_US
dc.subjectmultimodal hub locationen_US
dc.subjecthub coveren_US
dc.subjectphub centeren_US
dc.subjectp-hub medianen_US
dc.subjectincomplete hub network designen_US
dc.subject.lccQA402.6 .A58 2009en_US
dc.subject.lcshLocation problems (Programming)en_US
dc.subject.lcshTransportation problems (Programming)en_US
dc.subject.lcshTransportation Mathematical models.en_US
dc.titleHub location and Hub network designen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreePh.D.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record