PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 23, 2026Scientific Reports0 citationsOpen Access

Dynamic-opposite learning enhanced meta-heuristic approach for solving multiple industrial optimization problems

HWHao WuLLLijuan LiGWGuohui Wang

Key Points

  • The research aims to improve optimization methods for complex industrial challenges by enhancing existing algorithms.
  • Developed a new algorithm combining moth-flame optimization and differential evolution with dynamic opposite learning.
  • Tested the algorithm on CEC series benchmarks and two practical industrial scenarios.
  • Performed comparative analysis against traditional metaheuristics.
  • The proposed DOLDEMFO algorithm consistently produced competitive results.
  • Showed improved performance across various industrial optimization tasks.
  • Enhanced exploration and exploitation capabilities led to better search efficiency.

Abstract

Advanced industrial manufacturing involves a number of complex operation and decision NP-hard problems, such as industrial robot trajectory planning and flexible job shop scheduling, which calls for effective optimization approaches. In this work, we propose an enhanced version of the moth-flame optimization (MFO) algorithm, referred to as dynamic-opposite learning differential evolution MFO (DOLDEMFO), tailored for addressing continuous and integrated industrial optimization challenges. A dynamic opposite learning (DOL) strategy is embedded to asymmetrically refine the search region, enhancing both exploration and exploitation potential. Additionally, differential evolution (DE) is incorporated into the MFO framework, leveraging its structural simplicity, convergence characteristics, and robustness, to further refine search efficiency. To evaluate the proposed approach, extensive experiments on CEC series benchmarks and two industrial cases were performed. Comparative analysis with conventional metaheuristics verifies that DOLDEMFO consistently delivers competitive results and consistent performance across diverse industrial optimization tasks.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Wu et al. (2026) studied this question.

synapsesocial.com/papers/69e9b62685696592c86eae8fhttps://doi.org/10.1038/s41598-026-46614-7
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Comparison study of dispatching rules and heuristics for online scheduling of single machine scheduling problem with predicted release time jobs2023 · 21 citations
  2. 2Solving Multiple-Objective Flexible Job Shop Problems by Evolution and Local Search2008 · 84 citations
  3. 3Particle swarm optimization2002 · 48,531 citations
  4. 4Genetic algorithms: An overview1995 · 238 citations
  5. 5Mathematical modeling and heuristic approaches to flexible job shop scheduling problems2007 · 459 citations