Article · 29 Dec 2025
Conference abstractPublished 16 Apr 2018
Genetic algorithm for traveling salesman problem with an extension of order crossover operator
Quaid-i-Azam University, Pakistan Foundation University, Pakistan
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
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.
Subjects
Computer Science & ITAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
More from this journal
The newest in Advances in Robotics & Automation.
Article · 29 Dec 2025
Advancing Multi-Robot Collaboration and Resilience
Article · 29 Dec 2025
Simulation: The Cornerstone of Robotics Advancement
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalAdvances in Robotics & Automation
- SubjectComputer Science & IT
- BylineArticles whose byline prints “Yousaf Shad Muhammad”
- BylineArticles whose byline prints “Abid Hussain”
- BylineArticles whose byline prints “Muhammad Nauman Sajid”
- BylineArticles whose byline prints “Ijaz Hussain”

