Research Article
Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages
1 Node X select random node; | 2 Copy X to child; | 3 Node R X; | 4 Node L X; | 5 while(true) | 6 { | 7 R right neighbor of R in father tour; | 8 L left neighbor of L in mother tour; | 9 if R is in child then break while loop; | 10 if L is in child then break while loop; | 11 Add node R to child right side; | 12 Add node L to child left side; | 13 } | 14 Complete child by remaining nodes (nodes haven’t been copied to child tour yet) in random; | 15 return child; |
|