Scheduling and Process Optimization for Blockchain-Enabled Cloud Manufacturing Using Dynamic Selection Evolutionary Algorithm
The blockchain-enabled cloud manufacturing is an emerging service-oriented paradigm, and the scheduling and process optimization for blockchain-enabled cloud manufacturing (SPO-BCMfg) are crucial to achieving the service-oriented goal. The blockchain-enabled cloud manufacturing paradigm improves the...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on industrial informatics 2023-02, Vol.19 (2), p.1903-1911 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The blockchain-enabled cloud manufacturing is an emerging service-oriented paradigm, and the scheduling and process optimization for blockchain-enabled cloud manufacturing (SPO-BCMfg) are crucial to achieving the service-oriented goal. The blockchain-enabled cloud manufacturing paradigm improves the collaboration capabilities and information security over the ordinary cloud manufacturing while incorporating distributed storage, consensus mechanism, and cloud-edge collaboration. The above characteristics make SPO-BCMfg a multiobjective scheduling optimization problem. This article establishes the multiobjective SPO-BCMfg model based on a dynamic selection evolutionary algorithm to address the problem. First, we carry out the architecture and the modeling of the blockchain cloud manufacturing system. Then, a novel dynamic selection evolutionary algorithm is proposed, which is used to schedule and optimize the model for the process. In the stage of evolution, the algorithm uses a diversity-based population partitioning technique that utilizes the dynamic distance to realize the selection of elite solutions. The method was experimented on the SPO-BCMfg problem facing five and eight objectives. The experimental results show that the algorithm has a strong processing capacity in terms of convergence and diversity compared with the other advanced evolutionary algorithms. |
---|---|
ISSN: | 1551-3203 1941-0050 |
DOI: | 10.1109/TII.2022.3188835 |