Advanced Search

Show simple item record

dc.contributor.authorKayisoglu, Betul
dc.contributor.authorAkgun, Ibrahim
dc.date.accessioned2021-12-01T07:57:20Z
dc.date.available2021-12-01T07:57:20Z
dc.date.issued2021en_US
dc.identifier.issn0305-0548
dc.identifier.issn1873-765X
dc.identifier.urihttps //doi.org/10.1016/j.cor.2021.105478
dc.identifier.urihttps://hdl.handle.net/20.500.12573/1060
dc.descriptionThis research was supported by the Scientific and Technological Research Council of Turkey (TUB.ITAK Grant No: 114M363) and the Research Fund of the Abdullah Gul University (Grant No: FDK-2018-123).en_US
dc.description.abstractWe study the Multiple Allocation Tree of Hubs Location Problem where a tree topology is required among the hubs and transportation cost of sending flows between OD pairs is minimized. Unlike most studies in the literature that assume a complete network with costs satisfying the triangle inequality to formulate the problem, we define the problem on non-complete networks and develop a modeling approach that does not require any specific cost and network structure. The proposed approach may provide more flexibility in modeling several characteristics of real-life hub networks. Moreover, the approach may produce better solutions than the classical approach, which may result from the differences in the selected hubs, the flow routes between origin-destination points, and the assignment of non-hub nodes to hub nodes. We solve the proposed model using CPLEX-based branch-and-bound algorithm and Gurobi-based branch-and-bound algorithm with Norel heuristic and develop Benders decomposition-based heuristic algorithms using two acceleration strategies, namely, strong cut generation and cut disaggregation. We conduct computational experiments using problem instances defined on non-complete networks with up to 500 nodes. The results indicate that the Benders-type heuristics are especially effective in finding good feasible solutions for large instances.en_US
dc.description.sponsorshipTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) 114M363 Abdullah Gul University FDK-2018-123 Appeared in source as:Research Fund of the Abdullah Gul Universityen_US
dc.language.isoengen_US
dc.publisherPERGAMON-ELSEVIER SCIENCE LTDTHE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLANDen_US
dc.relation.isversionof10.1016/j.cor.2021.105478en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectHub location problemen_US
dc.subjectMultiple allocationen_US
dc.subjectTree of hubs location problemen_US
dc.subjectBenders decompositionen_US
dc.subjectBenders-type heuristicen_US
dc.titleMultiple allocation tree of hubs location problem for non-complete networksen_US
dc.typearticleen_US
dc.contributor.departmentAGÜ, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.contributor.institutionauthorKayisoglu, Betul
dc.contributor.institutionauthorAkgun, Ibrahim
dc.identifier.volumeVolume 136en_US
dc.relation.journalCOMPUTERS & OPERATIONS RESEARCHen_US
dc.relation.tubitak114M363
dc.relation.publicationcategoryMakale - Uluslararası - Editör Denetimli Dergien_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record