Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/1598
Title: Lane covering with partner bounds in collaborative truckload transportation procurement
Authors: Kuyzu, Gültekin
19092
Keywords: Lane covering
Collaboration
Transportation
Column generation
Branch-and-price
Issue Date: Jan-2017
Publisher: Pergamon-Elsevier Science Ltd
Source: Kuyzu, G. (2017). Lane covering with partner bounds in collaborative truckload transportation procurement. Computers & Operations Research, 77, 32-43.
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.
URI: https://doi.org/10.1016/j.cor.2016.07.018
https://hdl.handle.net/20.500.11851/1598
ISSN: 0305-0548
Appears in Collections:Endüstri Mühendisliği Bölümü / Department of Industrial Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record

CORE Recommender

SCOPUSTM   
Citations

18
checked on Sep 23, 2022

WEB OF SCIENCETM
Citations

20
checked on Sep 24, 2022

Page view(s)

32
checked on Dec 26, 2022

Google ScholarTM

Check

Altmetric


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