M. Nauman Sajid

M. Nauman Sajid

Auto-generated profile, based on publicly available information

M. Nauman Sajid

Department of Computer Science, Foundation University, Islamabad, Pakistan

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 October 2017 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
AHAbid Hussain
Abid Hussain
Muhammad Yousaf ShadMuhammad Yousaf Shad
Muhammad Yousaf Shad
MSM. Nauman Sajid
M. Nauman Sajid
IHIjaz Hussain
Ijaz Hussain
ASAlaa Mohamd Shoukry
Alaa Mohamd Shoukry
SGShowkat Hussain Gani
Showkat Hussain Gani
Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements.