Loading...
Please wait, while we are loading the content...
Similar Documents
An Improved Genetic Algorithm Crossover Operator for Traveling Salesman Problem
| Content Provider | Paperity |
|---|---|
| Author | Sajid, Muhammad Nauman Hussain, Abid Muhammad, Yousaf Shad |
| Abstract | The genetic algorithm is one of the best algorithms in order to solve many combinatorial optimization problems, especially traveling salesman problem. The application of genetic algorithms to problems which are not amenable to bit string representation and traditional crossover has been a growing area of interest. One approach has been to represent solutions by permutations of a list, and “permutation crossover� operators have been introduced to preserve the legality of offspring. There are many existing schemes for permutation representation like PMX, OX, and CX etc. In this paper, we extend the CX scheme which produces healthy offspring based upon survival of the fittest theory. Comparison of the proposed operator with other ones for ten benchmarks TSPLIB instances vividly shows its pros at the same accuracy level. Also, it requires less time for tuning of genetic parameters and provides narrower confidence intervals on the results than other operators. |
| Starting Page | 1 |
| Ending Page | 13 |
| File Format | HTM / HTML |
| Journal | Turkish Journal of Mathematics and Computer Science |
| Volume Number | 9 |
| e-ISSN | 21481830 |
| Language | English |
| Publisher Date | 2018-12-28 |
| Access Restriction | Open |
| Subject Keyword | Traveling salesman problems Crossover operators Np-hard Path-representation Genetic algorithms |
| Content Type | Text |
| Resource Type | Article |
