PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 12, 2026Algorithms0 citationsOpen Access

Hybrid Narwhale Optimization with Super Modified Simplex and Runge–Kutta Enhancements: Benchmark Validation and Application to Fuzzy Aggregate Production Planning

View Full Paper
PAPasura AungkulanonKing Mongkut's University of Technology North BangkokAHAnucha HirunwatKing Mongkut's University of Technology North BangkokRMRoberto MontemanniUniversity of Modena and Reggio Emilia

Key Points

  • The central aim is to improve convergence reliability and efficiency in fuzzy linear programming-based aggregate production planning using hybrid algorithms.
  • Investigated the Narwhal Optimization Algorithm as a population-based metaheuristic framework.
  • Proposed hybrid variants incorporating Super Modified Simplex Method and Runge–Kutta optimizer.
  • Tested solutions on eight benchmark functions and four constrained optimization problems.
  • Evaluated for stability, solution quality, and resistance to convergence issues.
  • Hybrid variants showed improved convergence and stability compared to the original Narwhal Optimization and benchmark methods.
  • The proposed methods effectively managed multi-objective scenarios and reduced computational burden.
  • Performance was validated through practical fuzzy aggregate production planning with a defined planning horizon.

Abstract

Aggregate production planning (APP) helps medium-term production, manpower, inventory, and subcontracting decisions match expected demand. Deterministic planning models are generally ineffective in manufacturing due to demand and operational variability. Fuzzy linear programming (FLP) has been frequently used to describe imprecision using membership functions and satisfaction levels. Despite its versatility, accurate approaches for solving multi-objective FLP-based APP models become computationally expensive as issue size and complexity increase. Thus, metaheuristic algorithms are widely used, although many still have premature convergence, parameter sensitivity, and restricted scalability. This study investigates the Narwhal Optimization Algorithm (NO) as a population-based metaheuristic framework. It proposes two hybrid variants to improve convergence reliability and constraint-handling capability: NO combined with the Super Modified Simplex Method (SMS) for local refinement and NO integrated with a Runge–Kutta-based optimizer (RK) for search stability. These hybrid techniques are tested for solution quality, convergence behavior, and robustness using eight response-surface benchmark functions and four constrained optimization problems. A real-parameter fuzzy APP problem with three goods and a six-month planning horizon uses the best variations. The Elevator Kinematic Optimization (EKO) algorithm, chosen for its compliance with the same mathematical framework and consistent parameter values, is used to compare the offered solutions fairly and controlled. Fuzzy programming uses a max–min satisfaction framework with linear membership functions from positive and negative ideal solutions. Computational experiments assess solution quality, stability, and efficiency for nominal and ±10% demand disturbances. The hybrid NO variants better resist premature convergence, stabilize solutions, and satisfy users more than the original NO and benchmark approaches. For small and medium-sized organizations in dynamic situations, hybrid narwhal-based optimization appears to be a reliable and scalable decision-support solution for APP problems under uncertainty.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Aungkulanon et al. (2026) studied this question.

synapsesocial.com/papers/69db37964fe01fead37c593ehttps://doi.org/10.3390/a19040295
Ask AI
Helpful
Bookmark
Share
View Full Paper