유전자 알고리즘을 이용한 시간제약 차량경로문제

• 영문명: Vehicle Routing Problems with Time Window Constraints by Using Genetic Algorithm
• 발행기관: 한국산업경영시스템학회
• 저자명: 전건욱(Geon-Wook Jeon) 이윤희(Yoon-Hee Lee)
• 간행물 정보: 『산업경영시스템학회지』제29권 제4호, 75~82쪽, 전체 8쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2006.12.01

영문 초록

  The main objective of this study is to find out the shortest path of the vehicle routing problem with time window constraints by using both genetic algorithm and heuristic. Hard time constraints were considered to the vehicle routing problem in this suggested algorithm. Four different heuristic rules, modification process for initial and infeasible solution, 2-opt process, and lag exchange process, were applied to the genetic algorithm in order to both minimize the total distance and improve the loading rate at the same time. This genetic algorithm is compared with the results of existing problems suggested by Solomon. We found better solutions concerning vehicle loading rate and number of vehicles in R-type Solomon’s examples R103 and R106.

목차

1. 서론
2. 유전자 알고리즘을 이용한 모형 구축
3. 예제적용 및 결과분석
4. 결론 및 향후 연구방향
참고문헌

키워드

Genetic Algorithm Vehicle Routing Problem with Time Windows Meta Heuristic