An improved variable neighborhood search for the open vehicle routing problem with time windows

摘要

This paper considers the open vehicle routing problem with time windows (OVRPTW). An improved variable neighborhood search (VNS) algorithm is proposed to solve the problem. The improved VNS features a route construction mechanism to ensure the customers with earlier time windows will be served first. The results of computational study indicate that the proposed algorithm can solve OVRPTW effectively.