Applying Tabu Search in Finding an Efficient Solution for the OVRP

Abstract

In the open vehicle routing problem (OVRP), the target would be to reduce the amount of vehicles after reducing the whole distance (or time) travelled. Every route begins at the depot and comes to an end at a customer, going to many customers, every once, en route, without returning to the depot. The demand of every customer has to be completely fullled by a single vehicle. The total demand serviced by each vehicle has to not go over vehicle capacity. A highly eective tabu search for open vehicle routing called Three Strategies Tabu Search (TSTS) heuristic for this problem is suggested. The TSTS depends on three strategies MOVE, EXCHANGE and SWAP. Computational results on fourteen standard benchmark problem instances demonstrate that the suggested TSTS is comparable in terms of solution quality for the best performing published heuristics.