Research Article
Multisystem Optimization for an Integrated Production Scheduling with Resource Saving Problem in Textile Printing and Dyeing
Algorithm 2
One generation of the proposed MSO algorithm.
| Calculate the similarity levels of objectives and constraints between each pair of subsystems | | Calculate the rank of each solution yik in subsystem i | | Calculate migration probability λik, which is linearly proportional to the rank of yik | | For each subsystem i | | Perform within-subsystem evolution using the modified NSGA-II | | Find a suitable subsystem j to pair with subsystem i based on similarity levels of objectives and constraints | | For each solution yik | | Calculate partial distances {} between yik and each solution in subsystem j | | For each solution variable s | | Use λik to decide whether or not to immigrate to yik | | If migrating, then | | Select emigrating solution yjl using roulette wheel selection, and its probability is proportional to partial distances {} | | yik (s) ⟵ yjl (s) | | End if | | End for | | End for | | End for |
|