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 journalArticle

23 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)136-150
Number of pages15
JournalTransportation Research Part E: Logistics and Transportation Review
Volume62
DOIs
StatePublished - Feb 2014

Fingerprint

tabu
Tabu search
Containers
heuristics
Light trailers
customer
experiment
performance
Experiments
Container
Heuristics
time

Keywords

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

ASJC Scopus subject areas

  • Business and International Management
  • Management Science and Operations Research
  • Transportation

Cite this

A tabu search heuristic for the local container drayage problem under a new operation mode. / Xue, Zhaojie; Zhang, Canrong; Lin, Wei Hua; Miao, Lixin; Yang, Peng.

In: Transportation Research Part E: Logistics and Transportation Review, Vol. 62, 02.2014, p. 136-150.

Research output: Contribution to journalArticle

@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",
year = "2014",
month = "2",
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 Limited",

}

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

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

VL - 62

SP - 136

EP - 150

JO - Transportation Research, Part E: Logistics and Transportation Review

JF - Transportation Research, Part E: Logistics and Transportation Review

SN - 1366-5545

ER -