Metaheuristic Algorithms for Solving Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW)

Abstract

Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW) is problem of determining vehicles routes involving depot and number of customers in order to minimize the number of vehicles used and travel time. MTVRPTW has objective to minimize the total costs of transportation which are the number of tours, total tour duration time and range of duration time. This paper provides metaheuristic algorithms to solve the MTVRPTW. Firefly Algorithm, Cuckoo Search Algorithm and Flower Pollination Algorithm are applied and compared in exchange for having the performances. Based on the experimental results using different size of data shows that Firefly Algorithm performs better than Cuckoo Search Algorithm and Flower Pollination Algorithm in solving MTVRPTW.