An efficient vehicle route search with time varying vehicle speed

속도 정보를 이용한 효율적 차량경로의 탐색

The vehicle routing problem with time-varying speed(VRPTVS) is difficult to handle with regular problem solving approaches. An approach by partitioning the service zone into three sub-zones to reduce computing time and vehicle traveling distance is suggested in this paper. To develop a partitioning algorithm for VRPTVS, all customer locations are divided into two sections such as morning zone and evening zone, excluding daytime zone. And then each service zone is calculated to find a possible number of delivery points and chosen by time window having more number of possible delivery points by considering customer location and varying speeds. A temporary complete route that can serve all target points is developed by this procedure and a pairwise exchange method is applied to reduce the traveling time.