Research Article
A Multiobjective Optimization Algorithm to Solve the Part Feeding Problem in Mixed-Model Assembly Lines
Table 3
Notations used in the pseudocode.
| | Nearest available tour before the tth tour | | Total number of bins for reference i | | Number of assigned bins of reference i on tour t | | Total number of delivered bins of reference i | | The nearest integers greater than or equal to B | | The nearest integers smaller than or equal to B | | Set of available tours | | Number of available tours | | First candidate list on the tth tour | | Second candidate list on the tth tour | | Final candidate list on the tth tour | | Set of consecutive removed tour(s) after the tth tour | | Objective function of the new solution | | Objective function of the current solution | | Current solution | | New solution | | Best solution | | A uniformly generated random number in the range of 0, 1 | | Number of iterations |
|
|
