Institutional Repository

Lane covering with partner bounds in collaborative truckload transportation procurement

Show simple item record

dc.contributor.author Kuyzu, Gültekin
dc.date.accessioned 2019-07-03T14:44:47Z
dc.date.available 2019-07-03T14:44:47Z
dc.date.issued 2017-01
dc.identifier.citation Kuyzu, G. (2017). Lane covering with partner bounds in collaborative truckload transportation procurement. Computers & Operations Research, 77, 32-43. en_US
dc.identifier.issn 0305-0548
dc.identifier.uri https://doi.org/10.1016/j.cor.2016.07.018
dc.identifier.uri http://hdl.handle.net/20.500.11851/1598
dc.description.abstract In collaborative truckload transportation procurement, the collaborating shippers aim to jointly identify and submit tours with little or no asset repositioning to a carrier, as opposed to submitting individual lanes, in return for more favorable rates. In order to maximize savings, the shippers must solve a Lane Covering Problem (LCP), which in more mathematical terms means to cover a subset of arcs in a directed graph by a set of constrained cycles with minimum total cost. Previous works in the literature have proposed effective greedy algorithms or the solution of the NP-Hard LCP variants. This paper incorporates a new constraint into the LCP, motivated by the need to limit the number of partners with whom the collaborative tours must be coordinated. An integer programming model is formulated, and column generation and branch-and-price approaches are developed for the solution of the resulting LCP variant. (C) 2016 Elsevier Ltd. All rights reserved. en_US
dc.description.sponsorship This work was supported by the Scientific and Technological Research Council of Turkey (TUBITAK) under grant number 112M227. en_US
dc.language.iso eng en_US
dc.publisher Pergamon-Elsevier Science Ltd en_US
dc.rights info:eu-repo/semantics/closedAccess
dc.subject Lane covering en_US
dc.subject Collaboration en_US
dc.subject Transportation en_US
dc.subject Column generation en_US
dc.subject Branch-and-price en_US
dc.title Lane covering with partner bounds in collaborative truckload transportation procurement en_US
dc.type article en_US
dc.relation.journal Computers & Operations Research en_US
dc.contributor.department TOBB ETU, Faculty of Engineering, Department of Industrial Engineering en_US
dc.contributor.department TOBB ETÜ, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü tr_TR
dc.identifier.volume 77
dc.identifier.startpage 32
dc.identifier.endpage 43
dc.relation.tubitak info:eu-repo/grantAgreement/TÜBİTAK/MAG/112M227 en_US
dc.contributor.orcid https://orcid.org/0000-0002-1997-306X
dc.identifier.wos WOS:000384855000004
dc.identifier.scopus 2-s2.0-84979943813
dc.contributor.tobbetuauthor Kuyzu, Gültekin
dc.contributor.YOKid 19092
dc.identifier.doi 10.1016/j.cor.2016.07.018
dc.contributor.ScopusAuthorID 14834070300
dc.relation.publicationcategory Uluslararası yayın tr_TR


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record