A tabu search heuristic for the local container drayage problem under a new operation mode

Zhaojie Xue; Canrong Zhang; Wei Hua Lin; Lixin Miao; Peng Yang

doi:10.1016/j.tre.2013.12.007

A tabu search heuristic for the local container drayage problem under a new operation mode

Zhaojie Xue, Canrong Zhang, Wei Hua Lin, Lixin Miao, Peng Yang

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

77 Scopus citations

Abstract

This paper examines the Local Container Drayage Problem (LCDP) under an operation mode in which a tractor can be detached from its companion trailer and assigned to a new task. We have incorporated a set of temporal constraints into the classical VRP to realize this operation by utilizing the idle time available to tractors and coordinating the empty containers moving between customers. A tabu search algorithm is proposed. Some numerical experiments are conducted to assess the performance of the proposed algorithm, quantify the benefit of the new operation mode, and identify the conditions under which the mode is effective.

Original language	English (US)
Pages (from-to)	136-150
Number of pages	15
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	62
DOIs	https://doi.org/10.1016/j.tre.2013.12.007
State	Published - Feb 2014

Keywords

Local container drayage
Tabu search
Temporal constraints
Tractor and trailer separation
Vehicle routing and scheduling

ASJC Scopus subject areas

Business and International Management
Civil and Structural Engineering
Transportation

Access to Document

10.1016/j.tre.2013.12.007

Cite this

@article{15b4039afb28431dbc45767b95f578f0,

title = "A tabu search heuristic for the local container drayage problem under a new operation mode",

abstract = "This paper examines the Local Container Drayage Problem (LCDP) under an operation mode in which a tractor can be detached from its companion trailer and assigned to a new task. We have incorporated a set of temporal constraints into the classical VRP to realize this operation by utilizing the idle time available to tractors and coordinating the empty containers moving between customers. A tabu search algorithm is proposed. Some numerical experiments are conducted to assess the performance of the proposed algorithm, quantify the benefit of the new operation mode, and identify the conditions under which the mode is effective.",

keywords = "Local container drayage, Tabu search, Temporal constraints, Tractor and trailer separation, Vehicle routing and scheduling",

author = "Zhaojie Xue and Canrong Zhang and Lin, {Wei Hua} and Lixin Miao and Peng Yang",

note = "Funding Information: The authors would like to thank the two anonymous referees for their valuable comments and suggestions which improved the quality of this paper. This work was supported by the National Nature Science Foundation of China under Grant No. 71102011 .",

year = "2014",

month = feb,

doi = "10.1016/j.tre.2013.12.007",

language = "English (US)",

volume = "62",

pages = "136--150",

journal = "Transportation Research Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier Ltd",

}

TY - JOUR

T1 - A tabu search heuristic for the local container drayage problem under a new operation mode

AU - Xue, Zhaojie

AU - Zhang, Canrong

AU - Lin, Wei Hua

AU - Miao, Lixin

AU - Yang, Peng

N1 - Funding Information: The authors would like to thank the two anonymous referees for their valuable comments and suggestions which improved the quality of this paper. This work was supported by the National Nature Science Foundation of China under Grant No. 71102011 .

PY - 2014/2

Y1 - 2014/2

N2 - This paper examines the Local Container Drayage Problem (LCDP) under an operation mode in which a tractor can be detached from its companion trailer and assigned to a new task. We have incorporated a set of temporal constraints into the classical VRP to realize this operation by utilizing the idle time available to tractors and coordinating the empty containers moving between customers. A tabu search algorithm is proposed. Some numerical experiments are conducted to assess the performance of the proposed algorithm, quantify the benefit of the new operation mode, and identify the conditions under which the mode is effective.

AB - This paper examines the Local Container Drayage Problem (LCDP) under an operation mode in which a tractor can be detached from its companion trailer and assigned to a new task. We have incorporated a set of temporal constraints into the classical VRP to realize this operation by utilizing the idle time available to tractors and coordinating the empty containers moving between customers. A tabu search algorithm is proposed. Some numerical experiments are conducted to assess the performance of the proposed algorithm, quantify the benefit of the new operation mode, and identify the conditions under which the mode is effective.

KW - Local container drayage

KW - Tabu search

KW - Temporal constraints

KW - Tractor and trailer separation

KW - Vehicle routing and scheduling

UR - http://www.scopus.com/inward/record.url?scp=84891925198&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84891925198&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2013.12.007

DO - 10.1016/j.tre.2013.12.007

M3 - Article

AN - SCOPUS:84891925198

SN - 1366-5545

VL - 62

SP - 136

EP - 150

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

ER -

A tabu search heuristic for the local container drayage problem under a new operation mode

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this