Show simple item record

dc.contributor.authorYaman, H.en_US
dc.date.accessioned2016-02-08T10:03:40Z
dc.date.available2016-02-08T10:03:40Z
dc.date.issued2009en_US
dc.identifier.issn0191-2615
dc.identifier.urihttp://hdl.handle.net/11693/22704
dc.description.abstractWe study the problem of designing a three level hub network where the top level consists of a complete network connecting the so-called central hubs and the second and third levels are unions of star networks connecting the remaining hubs to central hubs and the demand centers to hubs and central hubs, respectively. The problem is to decide on the locations of a predetermined number of hubs and central hubs and the connections in order to minimize the total routing cost in the resulting network. This problem includes the classical p-hub median problem as a special case. We also consider a version of this problem where service quality considerations are incorporated through delivery time restrictions. We propose mixed integer programming models for these two problems and report the outcomes of a computational study using the CAB data and the Turkey data.en_US
dc.language.isoEnglishen_US
dc.source.titleTransportation Research Part Ben_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.trb.2009.01.005en_US
dc.subjectHierarchicalen_US
dc.subjectHub locationen_US
dc.subjectP-Hub medianen_US
dc.subjectTime restrictionsen_US
dc.titleThe hierarchical hub median problem with single assignmenten_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineering
dc.citation.spage643en_US
dc.citation.epage658en_US
dc.citation.volumeNumber43en_US
dc.citation.issueNumber6en_US
dc.identifier.doi10.1016/j.trb.2009.01.005en_US
dc.publisherElsevieren_US
dc.identifier.eissn1879-2367


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record