Research Article
A Genetic Algorithm with Lower Neighborhood Search for the Three-Dimensional Multiorder Open-Size Rectangular Packing Problem
Algorithm 2
Local neighborhood search genetic algorithm (LNSGA) for 3D-MOSB-ODRPP.
| | Require: population size , crossover probability , mutation probability , maximum number of generations , and neighborhood size | | | Ensure: best solution | | (1) | Initialize population with randomly generated individuals | | (2) | for each individual in do | | (3) | Evaluate the fitness of using the Gurobi solver | | (4) | LocalNeighborhoodSearch(, ) | | (5) | Gurobi | | (6) | Update with in | | (7) | end for | | (8) | | | (9) | whiledo | | (10) | | | (11) | whiledo | | (12) | Select parents from using the selection operator | | (13) | Crossover with probability | | (14) | Mutate with probability | | (15) | Mutate with probability | | (16) | for each offspring in do | | (17) | Evaluate the fitness of using the Gurobi solver | | (18) | LocalNeighborhoodSearch(, ) | | (19) | Gurobi | | (20) | Update with in | | (21) | end for | | (22) | | | (23) | end while | | (24) | | | (25) | | | (26) | end while | | (27) | return Best solution from |
|
