Research Article
A Genetic Algorithm with Lower Neighborhood Search for the Three-Dimensional Multiorder Open-Size Rectangular Packing Problem
Algorithm 1
Genetic algorithm (GA) for 3D-MOSB-ODRPP.
| Require: population size , crossover probability , mutation probability , and maximum number of generations | | Ensure: best solution | (1) | Initialize population with randomly generated individuals | (2) | Evaluate the fitness of each individual in using the TS heuristic | (3) | | (4) | whiledo | (5) | | (6) | whiledo | (7) | Select parents from using the selection operator | (8) | Crossover with probability | (9) | Mutate with probability | (10) | Mutate with probability | (11) | Evaluate the fitness of and using the TS heuristic | (12) | | (13) | end while | (14) | | (15) | | (16) | end while | (17) | return Best solution from |
|