Subhadip Pramanik

Dr. Subhadip Pramanik

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
3 January 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
SPSubhadip Pramanik
Subhadip Pramanik
AAAbdalla Alameen
Abdalla Alameen
Hitesh MohapatraHitesh Mohapatra
Hitesh Mohapatra
DPDebanjan Pathak
Debanjan Pathak
AGAdrijit Goswami
Adrijit Goswami
Many real-world expensive industrial and engineering multi-objective optimization problems (MOPs) are driven by historical, experimental, or simulation data. In such scenarios, due to the expensive cost and time required, we are only left with a small amount of labeled data to perform the optimization. These offline data-driven MOPs are usually solved by multi-objective evolutionary algorithms (MOEAs) with the help of surrogate models constructed from offline historical data. The key challenge in developing these data-driven MOEAs is that they have to replace multiple conflicting fitness functions by approximating these objective functions, which may produce cumulative approximation errors and misguide the search. In order to build a reliable surrogate model from a small amount of multi-output offline data and solve the DDMOPs, we have proposed an adaptive model selection method with a reliable individual-based model management-driven MOEA. The proposed algorithm dynamically selects between DNN and XGBoost by comparing their k-fold cross-validation MAE error, which can capture the true generalization ability of the surrogates on unseen data. Then, the selected surrogate is updated with a reliable individual selection strategy, where the individual who is closest, both in the decision and objective space, to the most preferred solution among labeled offline data is chosen. As a result, these two strategies guide the underlying MOEA to the Pareto optimal solutions. The empirical results of the ZDT and DTLZ benchmark test suite validate the use of the three state-of-the-art offline DDMOEAs, showing that our algorithm is able to achieve highly competitive results in terms of convergence and diversity for 2–3 objectives. Finally, our algorithm is applied to an offline data-driven multi-objective problem—transonic airfoil (RAE 2822) shape optimization—to validate its efficiency on real-world DDMOPs.

24 May 2025
Verified
Book Chapter
Closed access
PDF file
HMHitesh Mohapatra
Hitesh Mohapatra
SPSubhadip Pramanik
Subhadip Pramanik
SMSoumya Ranjan Mishra
Soumya Ranjan Mishra

19 December 2021
Verified
Conference Paper
Closed access
SPSubhadip Pramanik
Subhadip Pramanik
AGAdrijit Goswami
Adrijit Goswami
In several real-world engineering and industrial optimization problems, we only have historical data collected from physical experiments, numerical simulations, or production operations for performing optimization, and further, no expensive fitness evaluations are available during the optimization process. This class of optimization problems are called offline data-driven optimization. As no new data is available as offline data points, it is of utmost importance to build good quality surrogates from the initial data and harness useful information from unlabelled data to enhance the performance of the surrogates. This paper proposes a novel approach to combine the exploitation of local surrogate and exploration of global surrogate, guiding the optimization process to reach the optimum with the limited amount of available data. Furthermore, we follow a new method to choose reliable individuals for updating both global and local surrogates. Moreover, to show the high competitiveness of our algorithm over other state-of-the-approaches, we evaluate our model on problems up to 100 dimensions.