이동시간의 변화를 고려한 차량경로 문제의 분지평가법을 이용한 최적화 해법

Abstract

Most of the models for the vehicle routing problems studied in the literature assumed constant travel times. However, those approaches may give infeasible solutions when traffic congestion causes delays in travel time. To overcome such difficulty, there have been some researches considering the change of the travel time which is called the time dependent vehicle routing problem (TDVRP). TDVRP assumes that the travel time between two locations is not only affected by the distance traveled, but by many other factors including the time of the day. In this paper, we propose a branch-and-price algorithm to solve the TDVRP. The time dependent property of the travel time is dealt with an enumeration scheme with bounding procedures in the column generation procedure identifying a profitable route. The proposed algorithm guarantees the “Non-passing” property to be held in the solutions. The algorithm was tested on problems composed of the Solomon’s benchmark instances for 25 and 50 nodes. Computational results are reported