Eksikli ana dağıtım üssü ağlarında kaplama problemi

ABSTRACTTHE HUB COVERING PROBLEM OVERINCOMPLETE HUB NETWORKSMurat KalaycılarM.S. in Industrial EngineeringSupervisor: Assist. Prof. Bahar Y. KaraApril 2006The rising trend in the transportation and telecommunication systems increases theimportance of hub location studies in recent years. Hubs are special types of facilities inmany-to-many distribution systems where flows are consolidated and disseminated.Analogous to location models, p-hub median, p-hub center and hub covering problemshave been studied in the literature. In this thesis, we focus on a special type of hubcovering problem which we call as ?Hub Covering Problem over Incomplete HubNetworks?. Most of the studies in the hub location literature assume that the hub nodesare fully interconnected. We observe that, especially in cargo delivery systems, hubnetwork is not complete. Thus, in this study we relax this fundamental assumption andpropose integer programming models for single and multi allocation cases of the hubcovering problem. We also propose three heuristics for both single and multi allocationcases of the problem. During the computational performance of proposed models andheuristics, CAB data was used. Results and comparisons of these heuristics will also bediscussed.Keywords: Hub Location, Covering, Mixed Integer Programming, Heuristic