A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem

Ruibin Bai; Ning Xue; Jianjun Chen; Gethin Wyn Roberts

doi:10.1016/j.trb.2015.06.002

A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem

Ruibin Bai
, Ning Xue
, Jianjun Chen
, Gethin Wyn Roberts

Research output: Contribution to journal › Article › peer-review

41 Citations (Scopus)

Abstract

This paper introduces a bidirectional multi-shift full truckload transportation problem with operation dependent service times. The problem is different from the previous container transport problems and the existing approaches for container transport problems and vehicle routing pickup and delivery are either not suitable or inefficient. In this paper, a set covering model is developed for the problem based on a novel route representation and a container-flow mapping. It was demonstrated that the model can be applied to solve real-life, medium sized instances of the container transport problem at a large international port. A lower bound of the problem is also obtained by relaxing the time window constraints to the nearest shifts and transforming the problem into a service network design problem. Implications and managerial insights of the results by the lower bound
results are also provided.

Original language	English
Pages (from-to)	134-148
Number of pages	15
Journal	Transportation Research Part B: Methodological
Volume	79
DOIs	https://doi.org/10.1016/j.trb.2015.06.002
Publication status	Published - Sept 2015

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 8 Decent Work and Economic Growth
SDG 9 Industry, Innovation, and Infrastructure
SDG 11 Sustainable Cities and Communities

Keywords

Full truckload transport
Container transport
Vehicle routing
Set covering
Service network design

Access to Document

10.1016/j.trb.2015.06.002

Cite this

@article{7486b44bd29642fb9f8d14898dad1f5b,

title = "A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem",

abstract = "This paper introduces a bidirectional multi-shift full truckload transportation problem with operation dependent service times. The problem is different from the previous container transport problems and the existing approaches for container transport problems and vehicle routing pickup and delivery are either not suitable or inefficient. In this paper, a set covering model is developed for the problem based on a novel route representation and a container-flow mapping. It was demonstrated that the model can be applied to solve real-life, medium sized instances of the container transport problem at a large international port. A lower bound of the problem is also obtained by relaxing the time window constraints to the nearest shifts and transforming the problem into a service network design problem. Implications and managerial insights of the results by the lower bound results are also provided.",

keywords = "Full truckload transport, Container transport, Vehicle routing, Set covering, Service network design",

author = "Ruibin Bai and Ning Xue and Jianjun Chen and Roberts, \{Gethin Wyn\}",

year = "2015",

month = sep,

doi = "10.1016/j.trb.2015.06.002",

language = "English",

volume = "79",

pages = "134--148",

journal = "Transportation Research Part B: Methodological",

issn = "1879-2367",

publisher = "Elsevier Ltd.",

}

TY - JOUR

T1 - A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem

AU - Bai, Ruibin

AU - Xue, Ning

AU - Chen, Jianjun

AU - Roberts, Gethin Wyn

PY - 2015/9

Y1 - 2015/9

N2 - This paper introduces a bidirectional multi-shift full truckload transportation problem with operation dependent service times. The problem is different from the previous container transport problems and the existing approaches for container transport problems and vehicle routing pickup and delivery are either not suitable or inefficient. In this paper, a set covering model is developed for the problem based on a novel route representation and a container-flow mapping. It was demonstrated that the model can be applied to solve real-life, medium sized instances of the container transport problem at a large international port. A lower bound of the problem is also obtained by relaxing the time window constraints to the nearest shifts and transforming the problem into a service network design problem. Implications and managerial insights of the results by the lower bound results are also provided.

AB - This paper introduces a bidirectional multi-shift full truckload transportation problem with operation dependent service times. The problem is different from the previous container transport problems and the existing approaches for container transport problems and vehicle routing pickup and delivery are either not suitable or inefficient. In this paper, a set covering model is developed for the problem based on a novel route representation and a container-flow mapping. It was demonstrated that the model can be applied to solve real-life, medium sized instances of the container transport problem at a large international port. A lower bound of the problem is also obtained by relaxing the time window constraints to the nearest shifts and transforming the problem into a service network design problem. Implications and managerial insights of the results by the lower bound results are also provided.

KW - Full truckload transport

KW - Container transport

KW - Vehicle routing

KW - Set covering

KW - Service network design

U2 - 10.1016/j.trb.2015.06.002

DO - 10.1016/j.trb.2015.06.002

M3 - Article

SN - 1879-2367

VL - 79

SP - 134

EP - 148

JO - Transportation Research Part B: Methodological

JF - Transportation Research Part B: Methodological

ER -

A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem

Abstract

UN SDGs

Keywords

Access to Document

Fingerprint

Cite this