In this work, we propose a method based onthe unified particle swarm optimization (UPSO) for no-waitmulti-hoist scheduling, including a collision avoidance heuristic.Conflicts due to track sharing between hoists and no-wait con-straints represent major issues to be addressed. Consequently,a complex optimization problem has to be solved dynamically,to identify the best operating strategy to be executed dependingon the characteristics of the current job list. A decompositionprocedure has been developed to speed up the solution ofthe large-scale optimization problem at hand. The proposedapproach is demonstrated on a real galvanic process layout,showing the improved performances achieved by the proposedheuristic compared to the monolithic approach.
A Unified PSO-based method for scheduling of multi-hoists in advanced Galvanic plants
Ramin D;Spinelli S;Brusaferri A
2020
Abstract
In this work, we propose a method based onthe unified particle swarm optimization (UPSO) for no-waitmulti-hoist scheduling, including a collision avoidance heuristic.Conflicts due to track sharing between hoists and no-wait con-straints represent major issues to be addressed. Consequently,a complex optimization problem has to be solved dynamically,to identify the best operating strategy to be executed dependingon the characteristics of the current job list. A decompositionprocedure has been developed to speed up the solution ofthe large-scale optimization problem at hand. The proposedapproach is demonstrated on a real galvanic process layout,showing the improved performances achieved by the proposedheuristic compared to the monolithic approach.| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_430184-doc_170435.pdf
solo utenti autorizzati
Descrizione: A Unified PSO-based method for multi-hoist scheduling in advanced Galvanic plants
Tipologia:
Versione Editoriale (PDF)
Licenza:
Altro tipo di licenza
Dimensione
983.38 kB
Formato
Adobe PDF
|
983.38 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


