Kallol Biswas

Mr. Kallol Biswas

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
19 October 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
MRMd Ashikur Rahman
Md Ashikur Rahman
RSRajalingam Sokkalingam
Rajalingam Sokkalingam
MOMahmod Othman
Mahmod Othman
KBKallol Biswas
Kallol Biswas
LALazim Abdullah
Lazim Abdullah
EKEvizal Abdul Kadir
Evizal Abdul Kadir
Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution. As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been implemented in a wide area of combinatorial optimization problems. Metaheuristic algorithms have been evolved and modified with respect to the problem nature since it was recommended for the first time. As there is a growing interest in incorporating necessary methods to develop metaheuristics, there is a need to rediscover the recent advancement of metaheuristics in combinatorial optimization. From the authors’ point of view, there is still a lack of comprehensive surveys on current research directions. Therefore, a substantial part of this paper is devoted to analyzing and discussing the modern age metaheuristic algorithms that gained popular use in mostly cited combinatorial optimization problems such as vehicle routing problems, traveling salesman problems, and supply chain network design problems. A survey of seven different metaheuristic algorithms (which are proposed after 2000) for combinatorial optimization problems is carried out in this study, apart from conventional metaheuristics like simulated annealing, particle swarm optimization, and tabu search. These metaheuristics have been filtered through some key factors like easy parameter handling, the scope of hybridization as well as performance efficiency. In this study, a concise description of the framework of the selected algorithm is included. Finally, a technical analysis of the recent trends of implementation is discussed, along with the impacts of algorithm modification on performance, constraint handling strategy, the handling of multi-objective situations using hybridization, and future research opportunities.

20 May 2020 in Archives of Computational Methods in Engineering
Verified
Journal Article
Closed access
PDF file
KBKallol Biswas
Kallol Biswas
Pandian VasantPandian Vasant
Pandian Vasant
JVJosé Antonio Gámez Vintaned
José Antonio Gámez Vintaned
Junzo WatadaJunzo Watada
Junzo Watada

15 February 2022 in Journal of Petroleum Exploration and Production Technology
Verified
Journal Article
Open access
PDF file
KBKallol Biswas
Kallol Biswas
TRTauhidur Rahman
Tauhidur Rahman
AAAhmed Almulihi
Ahmed Almulihi
FAFawaz Alassery
Fawaz Alassery
AAAbu Hasan Al Askary
Abu Hasan Al Askary
RARasel Ahmed
Rasel Ahmed
It is vital to optimize the drilling trajectory to reduce the possibility of drilling accidents and boosting the efficiency. Previously, the wellbore trajectory was optimized using the true measured depth and well profile energy as objective functions without considering uncertainty between the actual and planned trajectories. Without an effective management of the uncertainty associated with trajectory planning, the drilling process becomes more complex. Prior techniques have some drawbacks; for example, they could not find isolated minima and have a slow convergence rate when dealing with high-dimensional problems. Consequently, a novel approach termed the “Modified Multi-Objective Cellular Spotted Hyena Optimizer” is proposed to address the aforesaid concerns. Following that, a mechanism for eliminating outliers has been developed and implemented in the sorting process to minimize uncertainty. The proposed algorithm outperformed the standard methods like cellular spotted hyena optimizer, spotted hyena optimizer, and cellular grey wolf optimizer in terms of non-dominated solution distribution, search capability, isolated minima reduction, and pareto optimal front. Numerous statistical analyses were undertaken to determine the statistical significance of the algorithm. The proposed algorithm achieved the lowest inverted generational distance, spacing metric, and error ratio, while achieving the highest maximum spread. Finally, an adaptive neighbourhood mechanism has been presented, which outperformed fixed neighbourhood topologies such as L5, L9, C9, C13, C21, and C25. Afterwards, the technique for order preference by similarity to ideal solution and linear programming technique for multidimensional analysis of preference were used to provide the best pareto optimal solution.

8 April 2025 in Solar Energy Materials and Solar Cells
Verified
Journal Article
Closed access
ISIram Sifat
Iram Sifat
KBKallol Biswas
Kallol Biswas
JAJohn Ayers
John Ayers
SPSung Yeul Park
Sung Yeul Park
AAAlexander Agrios
Alexander Agrios

27 January 2022 in PLOS ONE
Verified
Journal Article
Open access
PDF file
KBKallol Biswas
Kallol Biswas
ANAmril Nazir
Amril Nazir
TRTauhidur Rahman
Tauhidur Rahman
Mayeen Uddin KhandakerMayeen Uddin Khandaker
Mayeen Uddin Khandaker
Abubakr M. IdrisAbubakr M. Idris
Abubakr M. Idris
AJAbdulHalim Jallad
AbdulHalim Jallad
Cost and safety are critical factors in the oil and gas industry for optimizing wellbore trajectory, which is a constrained and nonlinear optimization problem. In this work, the wellbore trajectory is optimized using the true measured depth, well profile energy, and torque. Numerous metaheuristic algorithms were employed to optimize these objectives by tuning 17 constrained variables, with notable drawbacks including decreased exploitation/exploration capability, local optima trapping, non-uniform distribution of non-dominated solutions, and inability to track isolated minima. The purpose of this work is to propose a modified multi-objective cellular spotted hyena algorithm (MOCSHOPSO) for optimizing true measured depth, well profile energy, and torque. To overcome the aforementioned difficulties, the modification incorporates cellular automata (CA) and particle swarm optimization (PSO). By adding CA, the SHO’s exploration phase is enhanced, and the SHO’s hunting mechanisms are modified with PSO’s velocity update property. Several geophysical and operational constraints have been utilized during trajectory optimization and data has been collected from the Gulf of Suez oil field. The proposed algorithm was compared with the standard methods (MOCPSO, MOSHO, MOCGWO) and observed significant improvements in terms of better distribution of non-dominated solutions, better-searching capability, a minimum number of isolated minima, and better Pareto optimal front. These significant improvements were validated by analysing the algorithms in terms of some statistical analysis, such as IGD, MS, SP, and ER. The proposed algorithm has obtained the lowest values in IGD, SP and ER, on the other side highest values in MS. Finally, an adaptive neighbourhood mechanism has been proposed which showed better performance than the fixed neighbourhood topology such as L5, L9, C9, C13, C21, and C25. Hopefully, this newly proposed modified algorithm will pave the way for better wellbore trajectory optimization.

1 January 2020
Verified
Book Chapter
Closed access
KBKallol Biswas
Kallol Biswas
Pandian VasantPandian Vasant
Pandian Vasant
MLMoacyr Batholomeu Laruccia
Moacyr Batholomeu Laruccia
JVJosé Antonio Gámez Vintaned
José Antonio Gámez Vintaned
MMMyo M. Myint
Myo M. Myint
Due to a variety of possible good types and so many complex drilling variables and constraints, optimization of the trajectory of a complex wellbore is very challenging. There are several types of wells, such as directional wells, horizontal wells, redrilling wells, complex structure wells, cluster wells, and extended reach wells. This reduction of the wellbore length helps to establish cost-effective approaches that can be utilized to resolve a group of complex trajectory optimization challenges. For efficient performance (i.e., quickly locating global optima while taking the smallest amount of computational time), we have to identify flexible control parameters. This research will try to develop a review of the various (particle swarm optimization) PSO algorithm used to optimize deviated wellbore trajectories. This chapter helps to find out optimal wellbore trajectory optimization algorithms that can close the technology gap by giving a useful method. This method can generate a solution automatically.