Abstract
We introduce the problem of scrap minimization in a bar mill with the capability of cutting several bars at once. We show this problem to be an instance of the cutting stock problem with additional constraints due to the ordering of the layers and relationships between orders spanning more than one layer.
We develop an ACO algorithm with a heuristic based on efficient patterns for search space reduction and for tackling the difficulty of building feasible solutions when the number of blocks is limited. We evaluate the performance on actual mill programs of different characteristics to show the usefulness of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Afshar, A.: An improved linear programming model for one-dimensional cutting stock problem. In: First International Conference on Construction in Developing Countries (ICCIDC-I). Advancing and Integrating Construction Education, Research & Practice, August 4-5 (2008)
Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operations Research 44(2), 145–159 (1990)
Eshghi, K., Javanshir, H.: A revised version of ant colony optimization for one-dimensional cutting stock problem. International Journal of Industrial Engineering 15(4), 341–348 (2008)
Gilmore, P., Gomoroy, R.: A linear programming approach to the cutting stock problem. Operations Research 11, 863–888 (1963)
Haessler, R.W.: Controlling cutting pattern changes in one dimensional trim problems. Operations Resarch 23(3), 483–493 (1975)
Jahromi, M.H., Tavakkoli-Moghaddam, R., Makui, A., Shamsi, A.: Solving an one-dimensional cutting stock problem by simulated annealing and tabu search. Journal of Industrial Engineering International 8 (2012)
Kantorovic, L.: Mathematical methods of organizing and planning production (1939). Managment Science 6, 366–422 (1960)
Lu, H.C., Huang, Y.H., Tseng, K.A.: An integrated algorithm for cutting stock problems in the thin-film transistor liquid crystal display industry. Computers & Industrial Engineering 64, 1084–1092 (2013)
Lu, Q., Wang, Z., Chen, M.: An ant colony optimization algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Natural Computation, ICNC 2008 7, 475–479 (2008)
Nozarian, S., Jahan, M.V., Jalali, M.: An imperialist competitive algorithm for 1-d cutting stock problem. International Journal of Information Science 3(2), 25–36 (2013)
Pradenas, L., Garces, J., Parada, V., Ferland, J.: Genotype-phenotype heuristic approaches for a cutting stock problem with circular patterns. Engineering Applications of Artificial Intelligence 26, 2349–2355 (2013)
Scheithauer, G., Terno, J.: A branch & bound algorithm for solving one-dimensional cutting stock problems exactly. Applicationes Mathematicae 23(2), 151–167 (1995)
Vasko, F., Newhart, D., Stott, J., Kenneth, L.: A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading. European Journal of Operations Research 114(1), 72–82 (1999)
Wagner, B.: A genetic algorithm solution for one-dimensional bundled stock cutting. European Journal of Operations Research 117(2), 368–381 (1999)
Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. European Journal of Operational Research 117(2), 368–381 (2007)
Yang, B., Li, C., Huang, L.: Solving one-dimensional cutting-stock problem based on ant colony optimization. Natural Computation, ICNC 2009, 1188–1191 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Díaz, D., Valledor, P., Areces, P., Rodil, J., Suárez, M. (2014). An ACO Algorithm to Solve an Extended Cutting Stock Problem for Scrap Minimization in a Bar Mill. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2014. Lecture Notes in Computer Science, vol 8667. Springer, Cham. https://doi.org/10.1007/978-3-319-09952-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-09952-1_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09951-4
Online ISBN: 978-3-319-09952-1
eBook Packages: Computer ScienceComputer Science (R0)