Shweta Rana

Papers

Total Citations

H-Index

About

Shweta Rana is a computer science researcher whose work focuses on tackling computationally intractable problems, particularly the Travelling Salesman Problem (TSP)—a classic NP-Complete challenge with broad applications in science and engineering. Her most cited paper, "Solving Travelling Salesman Problem Using Improved Genetic Algorithm" (2017), introduces a novel optimization approach that enhances traditional genetic algorithms to more effectively navigate the complex solution space of TSP. This work addresses one of the hardest problems in computer science, where conventional algorithms fall short, by leveraging evolutionary computation to find near-optimal solutions efficiently. With 6 citations, her contribution provides a practical pathway for researchers and engineers dealing with routing, logistics, and network design challenges. Rana’s research underscores the importance of heuristic and metaheuristic methods in overcoming the limitations of exact algorithms for NP-Complete problems, making her work valuable for students and practitioners exploring advanced optimization techniques in artificial intelligence and operations research.