Saptadeep Biswas

Dr. Saptadeep Biswas

Department of Mathematics, National Institute of Technology Agartala, Agartala, India
+1
orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
29 November 2024 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Open access
Saptadeep BiswasSaptadeep Biswas
Saptadeep Biswas
GSGyan Singh
Gyan Singh
BMBinanda Maiti
Binanda Maiti
AEAbsalom El-Shamir Ezugwu
Absalom El-Shamir Ezugwu
Kashif SaleemKashif Saleem
Kashif Saleem
UBUttam Kumar Bera
Uttam Kumar Bera

6 January 2025 in Artificial Intelligence Review
Verified
Journal Article
Open access
PDF file
BMBinanda Maiti
Binanda Maiti
Saptadeep BiswasSaptadeep Biswas
Saptadeep Biswas
Absalom El-Shamir EzugwuAbsalom El-Shamir Ezugwu
Absalom El-Shamir Ezugwu
UBUTTAM KUMAR BERA
UTTAM KUMAR BERA
AAAhmed Ibrahim Alzahrani
Ahmed Ibrahim Alzahrani
Laith AbualigahLaith Abualigah
Laith Abualigah
Optimization algorithms play a crucial role in solving complex challenges across various fields, including engineering, finance, and data science. This study introduces a novel hybrid optimization algorithm, the Hybrid Crayfish Optimization Algorithm with Differential Evolution (HCOADE), which addresses the limitations of premature convergence and inadequate exploitation in the traditional Crayfish Optimization Algorithm (COA). By integrating COA with Differential Evolution (DE) strategies, HCOADE leverages DE’s mutation and crossover mechanisms to enhance global optimization performance. The COA, inspired by the foraging and social behaviors of crayfish, provides a flexible framework for exploring the solution space, while DE’s robust strategies effectively exploit this space. To evaluate HCOADE’s performance, extensive experiments are conducted using 34 benchmark functions from CEC 2014 and CEC 2017, as well as six engineering design problems. The results are compared with ten leading optimization algorithms, including classical COA, Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Moth-flame Optimization (MFO), Salp Swarm Algorithm (SSA), Reptile Search Algorithm (RSA), Sine Cosine Algorithm (SCA), Constriction Coefficient-Based Particle Swarm Optimization Gravitational Search Algorithm (CPSOGSA), and Biogeography-based Optimization (BBO). The average rankings and results from the Wilcoxon Rank Sum Test provide a comprehensive comparison of HCOADE’s performance, clearly demonstrating its superiority. Furthermore, HCOADE’s performance is assessed on the CEC 2020 and CEC 2022 test suites, further confirming its effectiveness. A comparative analysis against notable winners from the CEC competitions, including LSHADEcnEpSin, LSHADESPACMA, and CMA-ES, using the CEC-2017 test suite, revealed superior results for HCOADE. This study underscores the advantages of integrating DE strategies with COA and offers valuable insights for addressing complex global optimization problems.

4 August 2023 in Journal of Cleaner Production
Verified
Journal Article
Closed access
PBPrasad Belamkar
Prasad Belamkar
Saptadeep BiswasSaptadeep Biswas
Saptadeep Biswas
ABAbhijit Baidya
Abhijit Baidya
PMPinki Majumder
Pinki Majumder
UBUttam Kumar Bera
Uttam Kumar Bera

20 January 2024 in International Journal of Disaster Risk Reduction
Verified
Journal Article
Closed access
Saptadeep BiswasSaptadeep Biswas
Saptadeep Biswas
Dhruv KumarDhruv Kumar
Dhruv Kumar
Mostafa Hajiaghaei-KeshteliMostafa Hajiaghaei-Keshteli
Mostafa Hajiaghaei-Keshteli
UBUTTAM KUMAR BERA
UTTAM KUMAR BERA

24 June 2025 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
Saptadeep BiswasSaptadeep Biswas
Saptadeep Biswas
BMBinanda Maiti
Binanda Maiti
GSGyan Singh
Gyan Singh
AEAbsalom E. Ezugwu
Absalom E. Ezugwu
Kashif SaleemKashif Saleem
Kashif Saleem
UBUTTAM KUMAR BERA
UTTAM KUMAR BERA
This paper presents a novel hybrid metaheuristic, the Hybrid Coati Optimization Algorithm with Differential Evolution (HCOADE), developed to address complex global optimization tasks and constrained engineering design problems. HCOADE integrates the exploration-driven behaviour of the Coati Optimization Algorithm (COA)-inspired by the social foraging and predation strategies of coatis-with the powerful mutation and crossover mechanisms of Differential Evolution (DE), thereby achieving a balanced and adaptive search process. The hybridization enhances global exploration and local exploitation, enabling the algorithm to efficiently navigate diverse and challenging optimization landscapes. To rigorously evaluate its performance, HCOADE is tested on benchmark suites from CEC 2014, 2017, 2020, and 2022, which encompass unimodal, multimodal, hybrid, and composition functions. It is also applied to real-world constrained engineering problems, such as pressure vessel design, cantilever beam optimization, and reinforced concrete beam design. Comparative experiments against state-of-the-art algorithms—including COA, DE, RSA, PSO, SSA, BBO, QIO, DMOA, and others—demonstrate that HCOADE consistently delivers superior solution quality, faster convergence, and higher robustness. Quantitative results show that HCOADE achieved the 1st place average rank across all four benchmark suites. It obtained top performance on 80% of the functions in CEC 2014, 66.7% in CEC 2017, 70% in CEC 2020, and 66.7% in CEC 2022. Furthermore, HCOADE outperformed or matched CEC competition-winning algorithms such as LSHADE-cnEpSin, LSHADE-SPACMA, and CMA-ES on numerous challenging functions of CEC 2017. Statistical analyses, including Wilcoxon Rank Sum Tests and ranking evaluations, confirm the significance and reliability of HCOADE’s performance. Furthermore, convergence behaviour, measurement of exploration and exploitation, and sensitivity analysis highlight the algorithm’s adaptability and stability across varied problem domains. This study contributes a computationally efficient and generalizable hybrid optimization framework, offering a promising solution for theoretical benchmarks and real-world engineering applications.

30 March 2024 in Neural Computing and Applications
Verified
Journal Article
Open access
PDF file
Saptadeep BiswasSaptadeep Biswas
Saptadeep Biswas
ASAzharuddin Shaikh
Azharuddin Shaikh
Absalom El-Shamir EzugwuAbsalom El-Shamir Ezugwu
Absalom El-Shamir Ezugwu
JGJapie Greeff
Japie Greeff
Seyedali MirjaliliSeyedali Mirjalili
Seyedali Mirjalili
Laith AbualigahLaith Abualigah
Laith Abualigah
This study proposes a new prairie dog optimization algorithm version called EPDO. This new version aims to address the issues of premature convergence and slow convergence that were observed in the original PDO algorithm. To improve performance, several modifications are introduced in EPDO. First, a dynamic opposite learning strategy is employed to increase the diversity of the population and prevent premature convergence. This strategy helps the algorithm avoid falling into local optima and promotes global optimization. Additionally, the Lévy dynamic random walk technique is utilized in EPDO. This modified Lévy flight with random walk reduces the algorithm’s running time for the test function’s ideal value, accelerating its convergence. The proposed approach is evaluated using 33 benchmark problems from CEC 2017 and compared against seven other comparative techniques: GWO, MFO, ALO, WOA, DA, SCA, and RSA. Numerical results demonstrate that EPDO produces good outcomes and performs well in solving benchmark problems. To further validate the results and assess reliability, the authors employ average rank tests, the measurement of alternatives, and ranking according to the compromise solution (MARCOS) method, as well as a convergence report of EPDO and other algorithms. Furthermore, the effectiveness of the EPDO algorithm is demonstrated by applying it to five design problems. The results indicate that EPDO achieves impressive outcomes and proves its capability to address practical issues. The algorithm performs well in solving benchmark and practical design problems, as supported by the numerical results and validation methods used in the study.