Modified Genetic Operators for the TSP

• 발행기관: 한국항해항만학회
• 저자명: Sang-Moon Soak Yeon-Mo Yang Hong-Girl Lee Byung-Ha Ahn
• 간행물 정보: 『한국항해항만학회지』제29권 제2호, 141~146쪽, 전체 6쪽
• 주제분류: 공학 > 해양공학
• 파일형태: PDF
• 발행일자: 2005.03.31

영문 초록

For a long time, genetic algorithms have been recognized as a new method to solve difficult and complex problems and the performance of genetic algorithms depends on genetic operators, especially crossover operator. Various problems like the traveling salesman problem, the transportation problem or the job shop problem, in logistics engineering am be modeled as a sequencing problem. This paper proposes modified genetic crossover operators to be used at various sequencing problems and uses the traveling salesman problem to be applied to a real world problem like the delivery problem and the vehicle routing problem as a benchmark problem. Because the proposed operators use parental information as well as network information, they could show better efficiency in performance and computation time than conventional operators.

목차

Abstract

1. Introduction

2. Genetic Crossover Operator

3. EPX Operator

4. Experimental Results

5. Conclusion

Reference

키워드

Genetic Algorithms Sequencing Problems Genetic Operators Traveling Salesman Problem