Show simple item record

dc.contributor.authorCalık H.en_US
dc.contributor.authorAlumur, S. A.en_US
dc.contributor.authorKara, B. Y.en_US
dc.contributor.authorKarasan, O. E.en_US
dc.date.accessioned2016-02-08T10:01:19Z
dc.date.available2016-02-08T10:01:19Z
dc.date.issued2009en_US
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/22531
dc.description.abstractHub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over incomplete hub networks and propose an integer programming formulation to this end. The aim of our model is to find the location of hubs, the hub links to be established between the located hubs, and the allocation of non-hub nodes to the located hub nodes such that the travel time between any origin-destination pair is within a given time bound. We present an efficient heuristic based on tabu search and test the performance of our heuristic on the CAB data set and on the Turkish network.en_US
dc.language.isoEnglishen_US
dc.source.titleComputers and Operations Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2008.11.023en_US
dc.subjectHub covering problemen_US
dc.subjectHub locationen_US
dc.subjectNetwork designen_US
dc.titleA tabu-search based heuristic for the hub covering problem over incomplete hub networksen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage3088en_US
dc.citation.epage3096en_US
dc.citation.volumeNumber36en_US
dc.citation.issueNumber12en_US
dc.identifier.doi10.1016/j.cor.2008.11.023en_US
dc.publisherElsevieren_US
dc.identifier.eissn1873-765X


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record