The stratified p-hub center and p-hub maximal covering problems

buir.contributor.authorYetiş Kara, Bahar
buir.contributor.orcidYetiş Kara, Bahar|0000-0001-8674-1165
dc.citation.epage148en_US
dc.citation.spage120en_US
dc.citation.volumeNumber135en_US
dc.contributor.authorYetiş Kara, Bahar
dc.contributor.authorGhaffarinasab, N.
dc.contributor.authorCampbell, J. F.
dc.date.accessioned2023-02-16T10:53:40Z
dc.date.available2023-02-16T10:53:40Z
dc.date.issued2022-02-01
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractHub networks are the foundation of many transportation and distribution systems, and real-world hub networks often transport freight or passengers of different service classes. This paper introduces the stratified multiple allocation p-hub center and p-hub maximal covering problems where the traffic corresponding to each origin–destination (O/D) pair is divided into different strata each having a specific service level requirement. The problems are formulated as mixed-integer linear programming (MILP) models and efficient Benders decomposition algorithms are developed for solving large instances. Extensive computational experiments are conducted to demonstrate the efficiency of the proposed mathematical models and the solution algorithms. MILP formulations are also proposed for the generalized versions of the problems that include fixed set-up costs for hubs and hub arcs. Results indicate that the optimal sets of hub locations and hub arcs when considering different strata can be quite dissimilar to those of the traditional p-hub center or p-hub maximal covering problem, but are similar to those of hierarchical hub location problems. Furthermore, models are provided and solved for multi-modal stratified hub location problems with fixed setup costs for hubs and hub arcs. Optimal results show a wide range of network topologies that can be generated, as compared to the classical versions.en_US
dc.description.provenanceSubmitted by Ezgi Uğurlu (ezgi.ugurlu@bilkent.edu.tr) on 2023-02-16T10:53:40Z No. of bitstreams: 1 The_stratified__p-hub_center_and_p-hub_maximal_covering_problems.pdf: 1944989 bytes, checksum: 5c07ac7f5739177453d832c3f0f7587a (MD5)en
dc.description.provenanceMade available in DSpace on 2023-02-16T10:53:40Z (GMT). No. of bitstreams: 1 The_stratified__p-hub_center_and_p-hub_maximal_covering_problems.pdf: 1944989 bytes, checksum: 5c07ac7f5739177453d832c3f0f7587a (MD5) Previous issue date: 2022-02-01en
dc.embargo.release2024-02-01
dc.identifier.doi10.1016/j.trb.2022.01.002en_US
dc.identifier.eissn1879-2367
dc.identifier.issn0191-2615
dc.identifier.urihttp://hdl.handle.net/11693/111436
dc.language.isoEnglishen_US
dc.publisherElsevier Ltden_US
dc.relation.isversionofhttps://doi.org/10.1016/j.trb.2022.01.002en_US
dc.source.titleTransportation Research Part B: Methodologicalen_US
dc.subjectHub location problemen_US
dc.subjectp-hub centeren_US
dc.subjectp-hub maximal coveringen_US
dc.subjectStratified demanden_US
dc.subjectBenders decompositionen_US
dc.titleThe stratified p-hub center and p-hub maximal covering problemsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
The_stratified__p-hub_center_and_p-hub_maximal_covering_problems.pdf
Size:
1.85 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description: