Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/20707
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVERDONCK, Lotte-
dc.contributor.authorBEULLENS, Patrick-
dc.contributor.authorCARIS, An-
dc.contributor.authorRAMAEKERS, Katrien-
dc.contributor.authorJANSSENS, Gerrit K.-
dc.date.accessioned2016-02-19T13:30:14Z-
dc.date.available2016-02-19T13:30:14Z-
dc.date.issued2016-
dc.identifier.citationJournal of the Operational Research Society, 67 (6), p. 853-871-
dc.identifier.issn0160-5682-
dc.identifier.urihttp://hdl.handle.net/1942/20707-
dc.description.abstractTransport companies may cooperate to increase their efficiency levels by e.g. the exchange of orders or vehicle capacity. In this paper a new approach to horizontal carrier collaboration is presented: the sharing of distribution centres (DCs) with partnering organisations. This problem can be classified as a cooperative facility location problem and formulated as an innovative mixed integer linear program. To ensure cooperation sustainability, collaborative costs need to be allocated fairly to the different participants. To analyse the benefits of cooperative facility location and the effects of different cost allocation techniques, numerical experiments based on experimental design are carried out on a U.K. case study. Sharing DCs may lead to significant cost savings up to 21.6%. In contrast to the case of sharing orders or vehicles, there are diseconomies of scale in terms of the number of partners and more collaborative benefit can be expected when partners are unequal in size. Moreover, results indicate that horizontal collaboration at the level of DCs works well with a limited number of partners and can be based on intuitively appealing cost sharing techniques, which may reduce alliance complexity and enforce the strength of mutual partner relationships.-
dc.description.sponsorshipThis work is supported by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office (research project COMEX, Combinatorial Optimization: Metaheuristics & Exact Methods).-
dc.language.isoen-
dc.subject.otherhorizontal cooperation; facility location; logistics; cooperative game theory; cost allocation-
dc.titleAnalysis of collaborative savings and cost allocation techniques for the cooperative carrier facility location problem-
dc.typeJournal Contribution-
dc.identifier.epage871-
dc.identifier.issue6-
dc.identifier.spage853-
dc.identifier.volume67-
local.format.pages34-
local.bibliographicCitation.jcatA1-
dc.description.notesCorresponding author: Address: Hasselt University - campus Diepenbeek, Agoralaan – building D, 3590 Diepenbeek, Belgium. Tel.: +32 11269115 E-mail addresses: lotte.verdonck@uhasselt.be, P.Beullens@soton.ac.uk, an.caris@uhasselt.be, katrien.ramaekers@uhasselt.be, gerrit.janssens@uhasselt.be-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.identifier.doi10.1057/jors.2015.106-
dc.identifier.isi000376535300005-
item.fulltextWith Fulltext-
item.contributorVERDONCK, Lotte-
item.contributorBEULLENS, Patrick-
item.contributorCARIS, An-
item.contributorRAMAEKERS, Katrien-
item.contributorJANSSENS, Gerrit K.-
item.accessRightsOpen Access-
item.validationecoom 2017-
item.fullcitationVERDONCK, Lotte; BEULLENS, Patrick; CARIS, An; RAMAEKERS, Katrien & JANSSENS, Gerrit K. (2016) Analysis of collaborative savings and cost allocation techniques for the cooperative carrier facility location problem. In: Journal of the Operational Research Society, 67 (6), p. 853-871.-
crisitem.journal.issn0160-5682-
crisitem.journal.eissn1476-9360-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
JORS-14-0426-PR2 accepted.pdfPeer-reviewed author version503.52 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

26
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

45
checked on Apr 23, 2024

Page view(s)

78
checked on Aug 31, 2022

Download(s)

120
checked on Aug 31, 2022

Google ScholarTM

Check

Altmetric


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