Abhishek Kumar

Dr. Abhishek Kumar

Kyungpook National University, Daegu, Republic of Korea
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 August 2020 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
Abhishek KumarAbhishek Kumar
Abhishek Kumar
GWGuohua Wu
Guohua Wu
MAMostafa Z. Ali
Mostafa Z. Ali
RMRammohan Mallipeddi
Rammohan Mallipeddi
PSPonnuthurai Nagaratnam Suganthan
Ponnuthurai Nagaratnam Suganthan
SDSwagatam Das
Swagatam Das

1 December 2021 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
Abhishek KumarAbhishek Kumar
Abhishek Kumar
GWGuohua Wu
Guohua Wu
MAMostafa Z. Ali
Mostafa Z. Ali
QLQizhang Luo
Qizhang Luo
Rammohan MallipeddiRammohan Mallipeddi
Rammohan Mallipeddi
SDSwagatam Das
Swagatam Das

1 June 2017
Verified
Conference Paper
Closed access
Abhishek KumarAbhishek Kumar
Abhishek Kumar
RMRakesh Kumar Misra
Rakesh Kumar Misra
DSDevender Singh
Devender Singh
Effective Butterfly Optimizer(EBO) is a self-adaptive Butterfly Optimizer which incorporates a crossover operator in Perching and Patrolling to increase the diversity of the population. This paper proposes a new retreat phase called Covariance Matrix Adapted Retreat Phase (CMAR), which uses covariance matrix to generate a new solution and thus improves the local search capability of EBO. This version of EBO is called EBOwithCMAR. We evaluated the performance of EBOwithCMAR on CEC-2017 benchmark problems and compared with the results of winners of a special session of CEC-2016 for bound-constrained problems. The experimental results show that EBOwithCMAR is competitive with the compared algorithms.

1 February 2022 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
Abhishek KumarAbhishek Kumar
Abhishek Kumar
Partha Pratim BiswasPartha Pratim Biswas
Partha Pratim Biswas
PSPonnuthurai Nagaratnam Suganthan
Ponnuthurai Nagaratnam Suganthan

1 December 2019 in Applied Soft Computing
Verified
Journal Article
Closed access
Abhishek KumarAbhishek Kumar
Abhishek Kumar
RMRakesh Kumar Misra
Rakesh Kumar Misra
DSDevender Singh
Devender Singh
SMSujeet Mishra
Sujeet Mishra
SDSwagatam Das
Swagatam Das

8 July 2020
Verified
Conference Paper
Open access
Abhishek KumarAbhishek Kumar
Abhishek Kumar
SDSwagatam Das
Swagatam Das
IZIvan Zelinka
Ivan Zelinka
Determination of the global optimum of complex non-convex optimization problems of the real-world applications has remained a challenging task. Many researchers have been developing various types of effective direct search-based methods to tackle these problems. In this paper, we introduce a new variant of the recently developed Spherical Search (SS) algorithm, which contains a powerful and effective self-adaptation structure to enhance the performance. To analyze the performance, proposed algorithm is tested on the 57 test problems collected from different real-world applications. The obtained results statistically confirm the efficacy and efficiency of the proposed algorithm.