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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
