Model and algorithm of multi-depot container truck transportation with time windows

Authors:
Ruiyou Zhang;Dingwei Wang;Won Young Yun
Affiliations:
Institute of Systems Engineering, Northeastern University, Shenyang, China;Institute of Systems Engineering, Northeastern University, Shenyang, China;Department of Industrial Engineering, Pusan National University, Busan, Korea
Venue:
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
Year:
2009

Citing 4
Cited 0

The vehicle routing problem

The vehicle routing problem
Automatic selection of MRF control parameters by reactive tabu search

Image and Vision Computing
A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research
Routing, ship size, and sailing frequency decision-making for a maritime hub-and-spoke container network

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A multi-depot container truck transportation problem with time windows is studied in this paper. Two types of transportation resources as trucks and containers and four types of container movements as inbound/outbound full and inbound/outbound empty movements are considered. The problem is formulated as a graph and then mathematically modeled as a multi-traveling salesman problem with time windows (m-TSPTW) with multiple depots. A reactive tabu search (RTS) algorithm is developed and tested based on a number of randomly generated examples. The results compared with the commercial tool CPLEX indicate that the RTS algorithm can find the optimum solutions of small-sized examples in short time. Furthermore, the algorithm is robust and stable to solve large-sized example.