An adaptive evolutionary algorithm for traveling salesman problem with precedence constraints.
Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments.
Department of Information & Industrial Engineering, Yonsei University, 50 Yonsei-Ro, Seodaemaun-gu, Seoul 120-749, Republic of Korea.
Jinmo
J
Sung
Department of Information & Industrial Engineering, Yonsei University, 50 Yonsei-Ro, Seodaemaun-gu, Seoul 120-749, Republic of Korea.
Bongju
B
Jeong
D000465:Algorithms; D008962:Models, Theoretical; D011340:Problem Solving