Kusum Deep

7.9k total citations · 4 hit papers
184 papers, 5.7k citations indexed

About

Kusum Deep is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Numerical Analysis. According to data from OpenAlex, Kusum Deep has authored 184 papers receiving a total of 5.7k indexed citations (citations by other indexed papers that have themselves been cited), including 110 papers in Artificial Intelligence, 67 papers in Computational Theory and Mathematics and 22 papers in Numerical Analysis. Recurrent topics in Kusum Deep's work include Metaheuristic Optimization Algorithms Research (107 papers), Advanced Multi-Objective Optimization Algorithms (64 papers) and Evolutionary Algorithms and Applications (53 papers). Kusum Deep is often cited by papers focused on Metaheuristic Optimization Algorithms Research (107 papers), Advanced Multi-Objective Optimization Algorithms (64 papers) and Evolutionary Algorithms and Applications (53 papers). Kusum Deep collaborates with scholars based in India, United Kingdom and Australia. Kusum Deep's co-authors include Shubham Gupta, Manoj Thakur, Jagdish Chand Bansal, Millie Pant, Krishna Pratap Singh, Mitthan Lal Kansal, Chilukuri K. Mohan, Kanchan Rajwar, Shail Kumar Dinkar and Swagatam Das and has published in prestigious journals such as Expert Systems with Applications, IEEE Access and Information Sciences.

In The Last Decade

Kusum Deep

179 papers receiving 5.5k citations

Hit Papers

A real coded genetic algorithm for solving integer and mi... 2009 2026 2014 2020 2009 2018 2023 2018 100 200 300 400 500

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Kusum Deep India 35 3.1k 1.6k 982 972 645 184 5.7k
Yongquan Zhou China 41 3.4k 1.1× 1.3k 0.8× 887 0.9× 821 0.8× 1.0k 1.6× 302 6.2k
Patrick Siarry France 38 2.8k 0.9× 1.8k 1.2× 1.1k 1.1× 1.0k 1.1× 1.1k 1.7× 196 7.1k
Seyedeh Zahra Mirjalili Australia 10 2.7k 0.9× 1.3k 0.8× 920 0.9× 1.4k 1.4× 558 0.9× 13 5.2k
Esmat Rashedi Iran 19 4.4k 1.4× 1.9k 1.2× 1.1k 1.2× 1.6k 1.7× 1.1k 1.7× 45 7.6k
Saeı̈d Saryazdi Iran 16 4.2k 1.4× 1.8k 1.2× 1.1k 1.1× 1.6k 1.6× 1.2k 1.9× 46 7.3k
Fatma A. Hashim Egypt 24 2.8k 0.9× 1.2k 0.8× 860 0.9× 1.1k 1.1× 636 1.0× 82 5.2k
Konstantinos E. Parsopoulos Greece 29 2.7k 0.9× 1.6k 1.0× 859 0.9× 786 0.8× 339 0.5× 87 4.9k
Zhun Fan China 37 2.0k 0.6× 1.7k 1.1× 684 0.7× 632 0.7× 728 1.1× 249 4.6k
Farhad Soleimanian Gharehchopogh Iran 48 4.2k 1.4× 1.6k 1.1× 919 0.9× 1.2k 1.3× 874 1.4× 156 7.7k
D. P. Vakharia India 12 2.6k 0.8× 1.4k 0.9× 986 1.0× 1.4k 1.5× 450 0.7× 38 5.6k

Countries citing papers authored by Kusum Deep

Since Specialization
Citations

This map shows the geographic impact of Kusum Deep's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kusum Deep with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kusum Deep more than expected).

Fields of papers citing papers by Kusum Deep

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Kusum Deep. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kusum Deep. The network helps show where Kusum Deep may publish in the future.

Co-authorship network of co-authors of Kusum Deep

This figure shows the co-authorship network connecting the top 25 collaborators of Kusum Deep. A scholar is included among the top collaborators of Kusum Deep based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Kusum Deep. Kusum Deep is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Rajwar, Kanchan & Kusum Deep. (2024). Structural bias in metaheuristic algorithms: Insights, open problems, and future prospects. Swarm and Evolutionary Computation. 92. 101812–101812. 3 indexed citations
2.
Rajwar, Kanchan, et al.. (2024). Investigating Structural Bias in Real-Coded Genetic Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference Companion. 447–450. 1 indexed citations
3.
Deep, Kusum, et al.. (2024). Discrete Marine Predators Algorithm for Symmetric Travelling Salesman Problem. Evolutionary Intelligence. 17(5-6). 3833–3848. 2 indexed citations
4.
Deep, Kusum, et al.. (2024). Performance of Beta Mutation on CEC 2017 and CEC 2022 Benchmarks. 1–8. 1 indexed citations
5.
Banerjee, Mousumi, et al.. (2023). Enhancing Sine–Cosine mutation strategy with Lorentz distribution for solving engineering design problems. International Journal of Systems Assurance Engineering and Management. 15(4). 1536–1567. 1 indexed citations
6.
Rajwar, Kanchan & Kusum Deep. (2023). Uncovering structural bias in population-based optimization algorithms: A theoretical and simulation-based analysis of the Generalized Signature Test. Expert Systems with Applications. 240. 122332–122332. 12 indexed citations
7.
Deep, Kusum, et al.. (2023). Improved Teaching Learning Algorithm with Laplacian operator for solving nonlinear engineering optimization problems. Engineering Applications of Artificial Intelligence. 124. 106549–106549. 12 indexed citations
8.
Deep, Kusum, et al.. (2023). Quadratic approximation salp swarm algorithm for function optimization. OPSEARCH. 61(1). 282–314. 5 indexed citations
9.
Deep, Kusum, et al.. (2023). Laplacian Salp Swarm Algorithm for continuous optimization. International Journal of Systems Assurance Engineering and Management. 2 indexed citations
10.
Bansal, Jagdish Chand, et al.. (2019). Soft Computing for Problem Solving SocProS 2017, Volume 1. CERN Document Server (European Organization for Nuclear Research). 2 indexed citations
11.
Deep, Kusum, et al.. (2015). Real Coded Genetic Algorithm Operators Embedded in Gravitational Search Algorithm for Continuous Optimization. International Journal of Intelligent Systems and Applications. 7(12). 1–12. 13 indexed citations
12.
Pant, Millie, Kusum Deep, Jagdish Chand Bansal, Atulya K. Nagar, & Kedar Nath Das. (2014). Proceedings of Fifth International Conference on Soft Computing for Problem Solving: SocProS 2015 - Volume 1. Springer eBooks. 3 indexed citations
13.
Deep, Kusum, Atulya K. Nagar, Millie Pant, & Jagdish Chand Bansal. (2012). Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011 - Volume 1. DIAL (Catholic University of Leuven). 1076–1076. 2 indexed citations
14.
Deep, Kusum, et al.. (2012). Variant of partially mapped crossover for the Travelling Salesman problems. Redalyc (Universidad Autónoma del Estado de México). 3(1). 47–69. 17 indexed citations
15.
Deep, Kusum, et al.. (2011). New Variations of Order Crossover for Travelling Salesman Problem. Redalyc (Universidad Autónoma del Estado de México). 2(1). 2–13. 34 indexed citations
16.
Deep, Kusum, et al.. (2011). Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman Problem. Redalyc (Universidad Autónoma del Estado de México). 2(3). 2–24. 19 indexed citations
17.
Deep, Kusum, et al.. (2010). A New Multi-Swarm Particle Swarm Optimization and Its Application to Lennard-Jones Problem. Americanae (AECID Library). 2 indexed citations
18.
Deep, Kusum & V. K. Katiyar. (2010). Minimizing Lennard-Jones potential using a real coded Genetic Algorithm and Particle Swarm Optimization∗.
19.
Birla, Dinesh, et al.. (2006). Application of Random Search Technique in Directional Overcurrent Relay Coordination. International Journal of Emerging Electric Power Systems. 7(1). 34 indexed citations
20.
Deep, Kusum, et al.. (2005). A population based heuristic algorithm for optimal relay operating times ∗. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026