Weitere Kapitel dieses Buchs durch Wischen aufrufen
This work investigates the one-dimensional integer cutting stock problem, which has many applications in Information and Communications Technology for green objectives. The problem consists of cutting a set of available objects in stock to produce smaller items with minimum the wastage of materials. On the basis of the traditional group-based Genetic Algorithm, we solve the large-scale cutting stock problems by adding two new proposals. Firstly, we put two additional steps to the First Fit heuristic to utilize wastage stock rolls when items are added to genes. These steps are applied to initialize the first population and to perform the mutation operation between two parents. Secondly, we propose a new heuristic in the crossover operation to create new individuals. The heuristic increases good genes and decreases bad genes which appeared in the population. We use them to improve traditional Genetic Algorithm in terms of the individual’s quality and the diversity of good genes in the populations. As a result, the wastage of stock rolls decreases. These heuristics are empirically analyzed by solving randomly generated instances and large instances from the literature, then results are compared to other methods. We specify an indicator to show some solutions are optimal. The numerical simulation shows that our approach is effective when it is applied to large-scale data sets, with better result in 40% of instances than the traditional cutting plane algorithm. On the other hand, we show that our approach can reach 289 optimal solutions out of 400 generated instances.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
P. Glimore and R. Gomory. A linear programming approach to the cutting stock problem: Part ii. Operat. Res, 11:863–888, 1963.
S. A. Araujo, A. A. Constantino, and K. C. Poldi.: An evolutionary algorithm for the one-dimensional cutting stock problem. International Transactions in Operational Research, 18(1):115–127, 2011.
Y.-P. Cui and T.-B. Tang. Parallelized sequential value correction procedure for the one-dimensional cutting stock problem with multiple stock lengths. Engineering Optimization, 46(10):1352–1368, 2014.
T. Johsuke and T. Kazuhiro. A genetic algorithm using tournament crossover operation for cutting stock problem. International Journal of the Information Systems for Logistics and Management (IJISLM), 5(2), 2010.
J. Rietz and S. Dempe. Large gaps in one-dimensional cutting stock problems. Discrete applied mathematics, 156(10):1929–1935, 2008.
R. Hinterding and L. Khan. Genetic algorithms for cutting stock problems: with and without contiguity. Springer, 1995.
K. C. Poldi and M. N. Arenales. Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Computers & Operations Research, 36(6):2074–2081, 2009.
G. Belov and G. Scheithauer. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research, 141(2):274–294, 2002.
C. Vanaret, J.-B. Gotteland, N. Durand, and J.-M. Alliot. Preventing premature convergence and proving the optimality in evolutionary algorithms. In Artificial Evolution, pages 29–40. Springer, 2014.
T. Gau and G. Wascher. Cutgen1: A problem generator for the standard one-dimensional cutting stock problem. European Journal of Operational Research, 84(3):572–579, 1995.
- A Genetic Algorithm Approach for Large-Scale Cutting Stock Problem
Nguyen Dang Tien
- Springer Singapore
Neuer Inhalt/© ITandMEDIA