A novel completely mapped crossover operator for genetic algorithm to facilitate the traveling salesman problem. Issue 6 (9th September 2020)

• Record Type: Journal Article
• Authors: Iqbal, Zahid; Bashir, Nazia; Hussain, Abid; Cheema, Salman A.
• Is Part Of: Computational and mathematical methods. Volume 2:Issue 6(2020)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2020-09-09
• Subjects: crossover operators -- genetic algorithms -- NP‐hard -- path‐representation -- traveling salesman problems; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Periodicals; Numerical analysis; Mathematics -- Data processing; Periodicals; 004.0151
• DOI: 10.1002/cmm4.1122
• Languages: English
• ISSNs: 2577-7408

Abstract

Abstract : As an intelligent search technique, genetic algorithm (GA) is a key member of optimization research methods. Motivated by the ability of GA in resolving complex and nondeterministic polynomial problems, this research proposes a new operator, namely, completely mapped crossover operator to facilitates the search of optimal solutions. Under a very general setting of the state‐of‐the‐art parameters, the performance of newly proposed method is explored with respect to five vibrant and most commonly used techniques existent in the literature. Furthermore, the generality of the applicability of contemporary techniques is maintained by considering eighteen benchmarks from the library of traveling salesman problem, possessing different levels of complexity. Based on diverse performance assessment criteria, we observe that propose method outperforms the contemporary alternatives.