Akhtar Munir Khan

Dr. Akhtar Munir Khan

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
20 September 2023 in IEEE Access
Verified
Journal Article
Open access
Akhtar Munir KhanAkhtar Munir Khan
Akhtar Munir Khan
MJMuhammad Asif Jan
Muhammad Asif Jan
MSMuhammad Sagheer
Muhammad Sagheer
RKRashida Khanum
Rashida Khanum
MUM. Irfan Uddin
M. Irfan Uddin
Shamsul HudaShamsul Huda
Shamsul Huda
Adaptive penalty function methods (APFMs) are promising constraints handling techniques. In an APFM, a penalty parameter which balances constrains’ violations and objective function values is adaptively adjusted. This work modifies an APFM that uses a near feasibility threshold (NFT), a portion around the feasible region where infeasible solutions are considered as good ones, for constrained multiobjective optimization. The modified APFM with five different settings of NFT is embedded in a prominent multiobjective evolutionary algorithm based on decomposition, MOEA/D. This brings in five constrained variants of the base algorithm, denoted by CMOEA/D-TAP1 to CMOEA/D-TAP5. These variants are tested on well-known constrained multiobjective benchmark test suits, the CTP series and the CF series. The proposed variants are compared with four best performing algorithms through HV metric (hyper volume metric) statistics for CTP series, and with seven state-of-the-art algorithms through Wilcoxon rank sum test employed to mean values of both HV and IGD (inverted generational distance matric) metrics for CF series. Simulation results reflect that overall performance of the newly introduced variants is better than the competitors for the taken benchmark test suits.

27 May 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
MSMuhammad Sagheer
Muhammad Sagheer
MJMuhammad Asif Jan
Muhammad Asif Jan
Akhtar Munir KhanAkhtar Munir Khan
Akhtar Munir Khan
EKEmel Khan
Emel Khan
The Teaching–Learning-Based Optimization (TLBO) algorithm simulates the pedagogical dynamics of the classroom to guide population-based search. While TLBO exhibits rapid convergence through effective exploitation of the search space, its enhanced variant—Group TLBO (GTLBO)—introduces a group discussion mechanism during the learning phase to promote diversity and mitigate premature convergence. However, empirical analysis reveals that in early iterations, when selected solutions for discussion are widely dispersed, the algorithm may generate excessively large steps. This can lead to premature exploitation and insufficient exploration, resulting in suboptimal search behavior. To address this limitation, this work proposes two novel variants: Dynamic Group TLBO (DGTLBO) and Adaptive Group TLBO (AGTLBO), which incorporate dynamic and adaptive scaling of learning steps, respectively. Their constrained counterparts, HSR-DGTLBO and HSR-AGTLBO, are further developed by integrating with them a Hybrid Stochastic Ranking (HSR) based constraint-handling mechanism. The proposed algorithms are evaluated on the CEC 2017 benchmark suites and a set of four engineering design problems. The comparative analysis of extensive simulation results demonstrates that adaptive variants outperform dynamic variants, and both are superior to their parent variants and other state-of-the-art algorithms on the tested benchmarks and engineering problems. Additionally, an interaction group size of three yields optimal performance across all the tested cases.