This document summarizes a research article from the International Journal of Electronics and Communication Engineering & Technology. The article compares the performance of three genetic algorithm crossover operators - PMX, OX, and CX - for solving the Traveling Salesman Problem (TSP). It finds that the PMX operator enables achieving a better solution than the other two operators tested. The document provides background on genetic algorithms and describes the TSP optimization problem, literature on using genetic algorithms for TSP, and proposes a new PMX crossover scheme to resolve TSP more efficiently.