TY - JOUR
T1 - Local container drayage problem with tractor and trailer operating in separable mode
AU - Xue, Zhaojie
AU - Lin, Wei Hua
AU - Miao, Lixin
AU - Zhang, Canrong
N1 - Funding Information:
The authors would like to thank the editor and the anonymous referees for their valuable comments and suggestions which improved the quality of this paper. This research is partly sponsored by the State Scholarship Fund of China Scholarship Council.
Publisher Copyright:
© 2014, Springer Science+Business Media New York.
PY - 2015/9/30
Y1 - 2015/9/30
N2 - In recent years, the Local Container Drayage Problem (LCDP) has received lots of studies in research as part of container transportation. This paper examines the LCDP under a special operation mode in which tractors and trailers can be separated, i.e., tractors can be assigned to a new task at another location while trailers are waiting for packing or unpacking. The problem is formulated as a vehicle routing and scheduling problem with temporal constraints. The resulting formulation can be used to solve small-scale problems. For large-scale problems, we develop a max–min Ant colony optimization algorithm to reduce the computation time. Numerical experiments with randomly generated instances are performed to demonstrate the performance of the algorithm.
AB - In recent years, the Local Container Drayage Problem (LCDP) has received lots of studies in research as part of container transportation. This paper examines the LCDP under a special operation mode in which tractors and trailers can be separated, i.e., tractors can be assigned to a new task at another location while trailers are waiting for packing or unpacking. The problem is formulated as a vehicle routing and scheduling problem with temporal constraints. The resulting formulation can be used to solve small-scale problems. For large-scale problems, we develop a max–min Ant colony optimization algorithm to reduce the computation time. Numerical experiments with randomly generated instances are performed to demonstrate the performance of the algorithm.
KW - Ant colony optimization
KW - Local container drayage problem
KW - Temporal constraints
KW - Vehicle routing and scheduling
UR - http://www.scopus.com/inward/record.url?scp=84930082287&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84930082287&partnerID=8YFLogxK
U2 - 10.1007/s10696-014-9190-2
DO - 10.1007/s10696-014-9190-2
M3 - Article
AN - SCOPUS:84930082287
VL - 27
SP - 431
EP - 450
JO - Flexible Services and Manufacturing Journal
JF - Flexible Services and Manufacturing Journal
SN - 1936-6582
IS - 2-3
ER -