Research Article
Novel Methods Generated by Genetic Programming for the Guillotine-Cutting Problem
(1) | OP ⟵ ValStandard_v/s; | (2) | BKj ⟵ ValStandard_BK1; | (3) | Iter ⟵ 0; | (4) | While Iter < n Do | (5) | Iter ⟵ Iter + 1; | (6) | Rk ⟵ MinArea(); MINWL_WASTE(); | (7) | Var ⟵ Cut (OP, BKj, Rk); | (8) | Var1 ⟵ Add(OP, BKj); | (9) | Return Waste(); |
|