Show simple item record

dc.contributor.advisorKaraşan, Oya Ekinen_US
dc.contributor.authorÇalık, Haticeen_US
dc.date.accessioned2016-01-08T18:08:48Z
dc.date.available2016-01-08T18:08:48Z
dc.date.issued2009
dc.identifier.urihttp://hdl.handle.net/11693/14823
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2009.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2009.en_US
dc.descriptionIncludes bibliographical references leaves 63-66.en_US
dc.description.abstractHubs are the accumulation points within the transportation and the telecommunication networks that collect and distribute the flow or data, which is originated from a starting point and needs to be transferred to a destination point. The main application areas of the hub location problem are airline systems, telecommunication network design and cargo delivery systems. In the literature, a common treatment of hub location problems is under the classification dating back to the location literature. In this classification, four different types are identified. Namely, the p-hub median problem, the hub location problem with fixed costs, the p-hub center problem, and the hub covering problem in the literature. In most of the hub location studies, the hub networks are assumed to be complete; however, the observations on the real life cases showed that this may not be the case. Therefore, in this thesis, we relax this assumption and focus on the single allocation version of the hub covering problem over incomplete hub networks. We propose two new mathematical formulations and a tabu search based heuristic algorithm for this problem. We perform several computational experiments on the formulations with the CAB data set from the literature and a larger scale network corresponding to the cities in Turkey. The results we obtained from our experimentations reveals that designing incomplete hub networks to provide service within a given service time bound is cost effective in accordance with designing complete hub networks.en_US
dc.description.statementofresponsibilityÇalık, Haticeen_US
dc.format.extentviii, 66 leaves, tablesen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectHub location problemen_US
dc.subjectnetwork designen_US
dc.subjecthub covering problemen_US
dc.subject.lccQA402.6 .C35 2009en_US
dc.subject.lcshLocation problems (Programming)en_US
dc.subject.lcshTransportation problems (Programming)en_US
dc.subject.lcshTransportation Mathematical models.en_US
dc.titleModeling and heuristic approaches for the Hub covering problem over incomplete Hub networksen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record