PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 2, 20261 citationsOpen Access

A Q-Learning-Based Adaptive NSGA-II for Fuzzy Distributed Assembly Hybrid Flow Shop Scheduling Problem

View Full Paper
RWRui WuQLQiang LiBCBin Cheng

Key Points

  • The aim is to tackle the fuzzy distributed assembly hybrid flow shop scheduling problem by minimizing earliness/tardiness and energy consumption.
  • Establishment of a mathematical model for scheduling objectives.
  • Development of a Q-learning-based adaptive NSGA-II algorithm.
  • Incorporation of hybrid strategies for better initial population quality.
  • Design of an adaptive parameter adjustment mechanism to enhance optimization.
  • Integration of neighborhood search operators and a greedy strategy for local search.
  • The proposed Q-ANSGA algorithm outperforms existing methods in solving the FDAHFSP.
  • Significant improvements in search efficiency and convergence performance observed.
  • Effective handling of production flow across manufacturing, transportation, and assembly stages demonstrated.

Abstract

With the growing emphasis on holistic management throughout the entire product lifecycle, multi-stage production models that integrate distributed manufacturing, transportation, and assembly processes have gradually attracted research attention. However, studies in this area remain relatively scarce. This paper addresses the fuzzy distributed assembly hybrid flow shop scheduling problem (FDAHFSP), comprehensively considering the entire production flow from manufacturing and transportation to final assembly. A mathematical model is first established with the objectives of minimizing the fuzzy total weighted earliness/tardiness and the fuzzy total energy consumption. To effectively solve this problem, a Q-learning-based adaptive NSGA-II (Q-ANSGA) is proposed. The algorithm incorporates a hybrid strategy combining multiple rules to enhance the quality of the initial population. Additionally, a Q-learning-based adaptive parameter adjustment mechanism is designed to dynamically optimize genetic algorithm parameters, thereby improving the algorithm’s search efficiency and convergence performance. Furthermore, eight neighborhood search operators are developed, and an iterative greedy strategy is integrated to guide the local search process. Finally, comprehensive experiments on 45 test instances are conducted to evaluate the effectiveness of each improvement component and the overall performance of Q-ANSGA. Experimental results demonstrate that the proposed algorithm achieves superior performance in solving the FDAHFSP due to its systematic enhancements.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Wu et al. (2026) studied this question.

synapsesocial.com/papers/6980ffc6c1c9540dea81285fhttps://doi.org/10.3390/pr14030500
Ask AI
Helpful
Bookmark
Share
View Full Paper