A reactive tabu search algorithm for the multi-depot container truck transportation problem

A container truck transportation problem that involves multiple depots with time windows at both origins and destinations, including the reposition of empty containers, is formulated as a multi-traveling salesman problem with time windows (m-TSPTW) with multiple depots. Since the problem is NP-hard,...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part E, Logistics and transportation review Logistics and transportation review, 2009-11, Vol.45 (6), p.904-914
Main Authors: Zhang, Ruiyou, Yun, Won Young, Moon, Ilkyeong
Format: Article
Language:English
Subjects:
Algorithms
Comparative analysis
Container truck transportation
Heuristic
Integer programming
Multiple depots
Reactive tabu search
Studies
Time windows
Transportation problem (Operations research)
Traveling salesman problem
Traveling salesman problem Time windows Multiple depots Container truck transportation Reactive tabu search Heuristic
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A container truck transportation problem that involves multiple depots with time windows at both origins and destinations, including the reposition of empty containers, is formulated as a multi-traveling salesman problem with time windows (m-TSPTW) with multiple depots. Since the problem is NP-hard, a cluster method and a reactive tabu search (RTS) algorithm are developed to solve the problem. The two methods are compared with the mixed integer program which can be used to find optimum solutions for small size problems. The computational results show that the developed methods, particularly the RTS algorithm, can be efficiently used to solve the problem.
ISSN:1366-5545
1878-5794
DOI:10.1016/j.tre.2009.04.012