Article ID Journal Published Year Pages File Type
1023969 Transportation Research Part E: Logistics and Transportation Review 2009 11 Pages PDF
Abstract

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.

Related Topics
Social Sciences and Humanities Business, Management and Accounting Business and International Management
Authors
, , ,