Q-learning-based multi-objective particle swarm optimization with local search within factories for energy-efficient distributed flow-shop scheduling problem

Given the increasing severity of ecological issues, sustainable development and green manufacturing have emerged as crucial areas of research and practice. The continuous growth of the globalizing economy has led to the prevalence of distributed manufacturing systems. Distributed flow-shop schedulin...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of intelligent manufacturing Ročník 36; číslo 1; s. 185 - 208
Hlavní autoři: Zhang, Wenqiang, Geng, Huili, Li, Chen, Gen, Mitsuo, Zhang, Guohui, Deng, Miaolei
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.01.2025
Springer Nature B.V
Témata:
Advanced manufacturing technologies
Algorithms
Business and Management
Clean energy
Control
Convergence
Energy consumption
Energy efficiency
Evolutionary algorithms
Factories
Industrial plants
Job shop scheduling
Learning
Machines
Manufacturing
Mechatronics
Multiple objective analysis
Optimization
Particle swarm optimization
Processes
Production
Robotics
Search methods
Subgroups
Sustainable development
Energy consumption
Q-learning
Distributed flow-shop scheduling problem
Variable neighborhood search
Particle swarm optimization
ISSN:0956-5515, 1572-8145
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Given the increasing severity of ecological issues, sustainable development and green manufacturing have emerged as crucial areas of research and practice. The continuous growth of the globalizing economy has led to the prevalence of distributed manufacturing systems. Distributed flow-shop scheduling problem (DFSP) is a complex NP-hard problem that involves two highly coupled sub-problems: job allocating for factories and job sequencing within factories. This paper proposes an efficient Q-learning-based multi-objective particle swarm optimization (QL-MoPSO) to address the DFSP, with the objectives of minimizing makespan and total energy consumption. The particle swarm optimization (PSO) algorithm has been enhanced by dividing particles into three subgroups, enabling faster convergence to three distinct areas of the Pareto Front (PF). Q-learning guides variable neighborhood search (VNS) as a local search strategy, balancing exploration and exploitation capabilities. To make the algorithm more reasonable and efficient for solving DFSP, multi-objective particle swarm optimization (MoPSO) uses the exchange sequence to update the job sequence vector, crossover and mutation to update the factory assignment vector. Computational experiments demonstrate that the proposed algorithm accelerates convergence and ensures good distribution performance and diversity, outperforming traditional multi-objective evolutionary algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0956-5515
1572-8145
DOI:10.1007/s10845-023-02227-9