| Modified Genetic Operators for the TSP |
|
Sang-Moon Soak, Yeon-Mo Yang, Hong-Girl Lee, Byung-Ha Ahn |
|
|
| Abstract |
|
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. |
| Key Words:
Genetic Algorithms;Sequencing Problems;Genetic Operators;Traveling Salesman Problem |
|
PDF Links
Download Citation
