고객의 납기마감시간이 존재하는 이기종 차량경로문제의 발견적 해법

• 영문명: A Heuristic for Fleet Size and Mix Vehicle Routing Problem with Time Deadline
• 발행기관: 한국산업경영시스템학회
• 저자명: 강충상(Chung-Sang Kang) 이준수(Jun-Su Lee)
• 간행물 정보: 『산업경영시스템학회지』제28권 제2호, 8~17쪽, 전체 10쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2005.06.01

영문 초록

This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfilled in the deadline. However, the late delivery is allowed to customers with loose deadline. That is, the paper suggests a model to minimize total acquisition cost, total travel distance and total violation time for a fleet size and mix vehicle routing problem with time deadline, and proposes a heuristic algorithm for the model. The proposed algorithm consists of two phases, i.e. generation of an initial solution and improvement of the current solution. An initial solution is generated based on a modified insertion heuristic and iterative improvement procedure is accomplished using neighborhood generation methods such as swap and reallocation. The proposed algorithm is evaluated using a wen known numerical example.

목차

Abstract

1. 서론

2. 납기를 갖는 FSMVRP

3. 발견적 기법

4. 실험 및 결과분석

5. 결론

참고문헌