This paper addresses the open vehicle routing problem with time window (OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task. The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process. We propose a hybrid column generation algorithm (HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.

No abstract

No abstract

No abstract

No abstract