Show simple item record

dc.contributor.authorMeraklı, M.en_US
dc.contributor.authorYaman, H.en_US
dc.date.accessioned2018-04-12T10:52:34Z
dc.date.available2018-04-12T10:52:34Z
dc.date.issued2016en_US
dc.identifier.issn0191-2615
dc.identifier.urihttp://hdl.handle.net/11693/36766
dc.description.abstractIn this study, we consider the robust uncapacitated multiple allocation p-hub median problem under polyhedral demand uncertainty. We model the demand uncertainty in two different ways. The hose model assumes that the only available information is the upper limit on the total flow adjacent at each node, while the hybrid model additionally imposes lower and upper bounds on each pairwise demand. We propose linear mixed integer programming formulations using a minmax criteria and devise two Benders decomposition based exact solution algorithms in order to solve large-scale problems. We report the results of our computational experiments on the effect of incorporating uncertainty and on the performance of our exact approaches.en_US
dc.language.isoEnglishen_US
dc.source.titleTransportation Research Part Ben_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.trb.2016.01.010en_US
dc.subjectBenders decompositionen_US
dc.subjectDemand uncertaintyen_US
dc.subjectHose modelen_US
dc.subjectHub locationen_US
dc.subjectMultiple allocationen_US
dc.subjectRobustnessen_US
dc.subjectBenders decompositionen_US
dc.titleRobust intermodal hub location under polyhedral demand uncertaintyen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage66en_US
dc.citation.epage85en_US
dc.citation.volumeNumber86en_US
dc.identifier.doi10.1016/j.trb.2016.01.010en_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