GET THE APP

Genetic algorithm for traveling salesman problem with an extension of order crossover operator
..

Advances in Robotics & Automation

ISSN: 2168-9695

Open Access

Genetic algorithm for traveling salesman problem with an extension of order crossover operator


Joint Event on 5th International Conference on Artificial Intelligence & 5th International Conference on Automation & Robotics

April 16-17, 2018 | Las Vegas, USA

Yousaf Shad Muhammad, Abid Hussain, Muhammad Nauman Sajid and Ijaz Hussain

Quaid-i-Azam University, Pakistan
Foundation University, Pakistan

Posters & Accepted Abstracts: Adv Robot Autom

Abstract :

The genetic algorithm is one of the best algorithms in order to solve many combinatorial optimization problems, especially traveling salesman problem. Genetic algorithm application produces quickly convergent results when it is applied as a crossover operator to the bit of strings. There are many existing schemes for permutation representation like PMX, OX, and CX etc. In this paper, we extend the OX scheme which produces more than two healthy offspring based upon survival of the fittest theory. Comparison of the proposed operator with other ones for sixteen benchmarks TSPLIB instances vividly show 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. yousuf@qau.edu.pk

Google Scholar citation report
Citations: 1127

Advances in Robotics & Automation received 1127 citations as per Google Scholar report

Advances in Robotics & Automation peer review process verified at publons

Indexed In

 
arrow_upward arrow_upward