초록 close

A new method to find an efficient vehicle routing as well as delivery district per time window is presented. The heuristic can be used to determine the shortest vehicle moving time necessary to travel all positions to stop by under three different time windows. Penalty is defined and adapted into the construction process for better routing. The procedure of the proposed heuristic are given with numerical examples and a computer program is constructed to show the performance.


키워드close