Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/9031
Full metadata record
DC FieldValueLanguage
dc.contributor.authorÖner N.-
dc.contributor.authorKuyzu G.-
dc.date.accessioned2022-11-30T19:26:31Z-
dc.date.available2022-11-30T19:26:31Z-
dc.date.issued2022-
dc.identifier.issn0360-8352-
dc.identifier.urihttps://doi.org/10.1016/j.cie.2022.108583-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/9031-
dc.description.abstractIn truckload transportation procurement networks, shippers purchasing the services of truckload carriers seek to form multi-company tours which consist of regularly scheduled shipments with minimal empty truck movements with the aim of getting better rates from the carriers in return. Identifying the minimum cost collaborative solution and sharing the costs in a fair manner are two interrelated and critical tasks for the success of such networks. The restrictions on the tours which can be formed make both of these tasks very challenging. In this paper, we take a cooperative game theory approach and study the resulting constrained lane covering game. We first show the set of conditions which must be satisfied for the game to have a non-empty core. We propose nucleolus based cost allocation methods. We also develop column and row generation methods for solving these mathematical models. We compare our proposed cost allocation models with alternative cost allocation methods and each other using a set of core stability metrics through computational experiments on randomly generated instances from the literature. © 2022 Elsevier Ltden_US
dc.description.sponsorshipTürkiye Bilimsel ve Teknolojik Araştırma Kurumu, TÜBİTAK: 112M227en_US
dc.description.sponsorshipThe research presented in this paper was partially supported by the Scientific and Technological Research Council of Turkey (TUBITAK) through grant 112M227 .en_US
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.relation.ispartofComputers and Industrial Engineeringen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectCollaborative logisticsen_US
dc.subjectColumn and row generationen_US
dc.subjectCooperative gamesen_US
dc.subjectCost allocationen_US
dc.subjectNucleolusen_US
dc.subjectComputation theoryen_US
dc.subjectCost accountingen_US
dc.subjectGame theoryen_US
dc.subjectTrucksen_US
dc.subjectAllocation methodsen_US
dc.subjectCollaborative logisticsen_US
dc.subjectColumn and row generationen_US
dc.subjectCooperative gameen_US
dc.subjectCost-allocationen_US
dc.subjectCritical tasksen_US
dc.subjectMinimum costen_US
dc.subjectNucleolusen_US
dc.subjectTruck movementsen_US
dc.subjectTruckload transportationsen_US
dc.subjectShipsen_US
dc.titleNucleolus Based Cost Allocation Methods for a Class of Constrained Lane Covering Gamesen_US
dc.typeArticleen_US
dc.identifier.volume172en_US
dc.identifier.wosWOS:000864653000009en_US
dc.identifier.scopus2-s2.0-85138441953en_US
dc.institutionauthorKuyzu, Gültekin-
dc.identifier.doi10.1016/j.cie.2022.108583-
dc.authorscopusid57216081724-
dc.authorscopusid14834070300-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ1-
dc.ozel2022v3_Editen_US
item.openairetypeArticle-
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.dept02.4. Department of Industrial Engineering-
Appears in Collections:Endüstri Mühendisliği Bölümü / Department of Industrial Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Show simple item record



CORE Recommender

WEB OF SCIENCETM
Citations

1
checked on Dec 21, 2024

Page view(s)

98
checked on Dec 23, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.