음식물 쓰레기 수거에서 거래처 방문 일정과 차량 경로 동시 결정 문제

Abstract

Food waste collection company should decide weekly visiting scheduling and daily vehicle routing for pick up points during a week. A mathematical model to minimize travelling distance was introduced. The mathematical model shows that the characteristics of problem was similar to the travelling sales man and the scheduling problem. Four evolutionary algorithm with penalty cost function to handle constraints were developed to solve our problem. A feasibility search operation was used to increase the feasibility on the solution set. Experimental results show that the average objective value dropped by 9% by using the feasibility search operation, but the calculation time increased by 12%.