Meta-heuristics for the one-dimensional cutting stock problem with usable leftover

Decision making viva genetic algorithm for the utilization of leftovers

“…We can see this scenario in Table 2, where the longer or shorter extreme values have no effect on evaluation time, that is, a shorter extreme value may take more time in evaluation, whereas sometimes the longer extreme value may take less time in evaluation, and consequently every time results in the best solution, as shown in Figure 5. There have been many other approaches where the optimization of materials loss and the computational time are discussed, 14,17,22,51,58,59 so the proposed algorithm is incomparable these approaches. Furthermore, the optimization of cost and profit is carried out, 59,60 so the comparison of them with the proposed algorithm is not possible.…”

“…There have been many other approaches where the optimization of materials loss and the computational time are discussed, 14,17,22,51,58,59 so the proposed algorithm is incomparable these approaches. Furthermore, the optimization of cost and profit is carried out, 59,60 so the comparison of them with the proposed algorithm is not possible. In the following, we have compared the outcomes of the proposed algorithm with the ones taken from the literature (Tables 4 and 5).…”

Manufacturing-oriented silicon steel coil lengthwise cutting stock problem with useable leftover

“…Several other algorithms (Cherri et al, 2013(Cherri et al, , 2014Arenales et al, 2015;Andrade et al, 2014Andrade et al, , 2016Cui et al, 2017;Tomat and Gradi sar 2017;Ravelo et al, 2020;Birgin et al, 2020;Sumetthapiwat et al, 2020) and our algorithm were tested by processing the orders successively, where the leftovers generated in current order can be used to satisfy the next orders. However, Cherri et al (2013Cherri et al ( , 2014 do not consider the WT constraint and the limitation of the total number of leftovers.…”

“…Tomat and Gradi sar (2017) proposed an algorithm to deal with one-dimensional CSP (1DCSP) with usable leftovers. Ravelo et al (2020) used meta-heuristics concepts to solve the 1DCSP with useable leftovers. Cui et al (2017) consider the WT constraint and the limitation of total number of leftovers and proposed a new model and heuristic solution approach for 1DCSP with usable leftover.…”

Algoritmo del Búfalo Africano para resolver el problema de corte unidimensional

“…Sin embargo, otros han buscado minimizar el número de stocks como en (Peng and Chu, 2010a) y (Peng and Chu, 2010b). Y otros más se han enfocado en reutilizar los sobrantes como en (Machado et al, 2020) y (Ravelo et al, 2020).…”