주기적 다용량 차량경로문제에 관한 발견적 해법

In this paper, we deal with the periodic heterogeneous fleet vehicle routing problem (PHVRP). PHVRP is a problem of designing vehicle routes in each day of given period to minimize the sum of fixed cost and variable cost over the planning horizon. Each customer can be visited once or more times over the planning horizon according to the service combinations of that customer. Due to the complexity of the problem, we suggest a heuristic algorithm in which an initial solution is obtained by assigning the customer-day and the customer-car simultaneously and then it is improved. A performance of the proposed algorithm was compared to both well-known results and new test problems.