P-hub maximal covering problem and extensions for gradual decay functions

Simple item page
buir.advisorKara, Bahar Y.
dc.contributor.authorPeker, Meltem
dc.date.accessioned2016-01-08T20:02:33Z
dc.date.available2016-01-08T20:02:33Z
dc.date.issued2013
dc.descriptionAnkara : The Department of IndustrialEngineering and the Graduate School of Engineering and Science of Bilkent University, 2013.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2013.en_US
dc.descriptionIncludes bibliographical references leaves 71-75.en_US
dc.description.abstractHubs are special facilities that serve as switching, transshipment and sorting nodes in many to many distribution systems. The hub location problem deals with the selection of the locations of hub facilities and finding assignments of demand nodes to hubs simultaneously. The p-hub maximal covering problem, that is one of the variations of the hub location problems, aims to find locations of hubs so as to maximize the covered demand that are within the coverage distance with a predetermined number of hubs. In the literature of hub location, p-hub maximal covering problem is conducted in the framework of only binary coverage; origin-destination pairs are covered if the total path length is less than coverage distance and not covered at all if the path length exceeds the coverage distance. Throughout this thesis, we extend the definition of coverage and introduce “partial coverage” that changes with the distance, to the hub location literature. In this thesis, we study the p-hub maximal covering problem for single and multiple allocations and provide new formulations that are also valid for partial coverage. The problems are proved to be NP-Hard. We even show that assignment problem with a given set of hubs for the single allocation version of the problem is also NP-Hard. Computational results for all the proposed formulations with different data sets are presented and discussed.en_US
dc.description.provenanceMade available in DSpace on 2016-01-08T20:02:33Z (GMT). No. of bitstreams: 1 0006749.pdf: 972301 bytes, checksum: d38d9daa46ad7964305588046971a359 (MD5)en
dc.description.statementofresponsibilityPeker, Meltemen_US
dc.format.extentxi, 81 leaves, graphs, tablesen_US
dc.identifier.urihttp://hdl.handle.net/11693/16893
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectHub location problemen_US
dc.subjectp-hub maximal covering problemen_US
dc.subjectpartial coverageen_US
dc.subject.lccQA402.6 .P44 2013en_US
dc.subject.lcshLocation problems (Programming)en_US
dc.subject.lcshTransportation problems (Programming)en_US
dc.subject.lcshTransportation--Mathematical models.en_US
dc.subject.lcshIndustrial location--Mathematical models.en_US
dc.titleP-hub maximal covering problem and extensions for gradual decay functionsen_US
dc.typeThesisen_US
thesis.degree.disciplineIndustrial Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0006749.pdf
Size:
949.51 KB
Format:
Adobe Portable Document Format
Download

Collections

Graduate School of Engineering and Science