Insertion heuristic algorithm for dynamic vehicle routing problem with time window

In order to effectively solve the dynamic vehicle routing problem with time window, an insertion heuristic algorithm was proposed. In this algorithm, in order to reduce the time of searching routes, before searching all of the current routes, a set of candidate paths were selected by using GIS buffer analysis function under the new demand points. Meanwhile, the average satisfaction degree of customers, the traveling distance and the waiting time of vehicles are considered synthetically to optimize the increase of total cost caused by new customers. Finally, an example was presented to show the validity of the proposed algorithm.