Abstract
In last decade, researchers have focused on improving existing methodologies through hybrid algorithms; these are a combination of algorithms between a metaheuristic with other metaheuristic and an exact method, to solve combinatorial optimization problems in the best possible way. This work presents a benchmark of different methodologies to solve the binary cutting stock problem using a column generation framework, this framework is divided into master and subproblem, master problem is solved using a classical integer linear programming, and the subproblem is solved using metaheuristic algorithms (genetic algorithm, simulated annealing and particle swarm optimization). This benchmark analysis is aimed to compare hybrid metaheuristics results with an exact methodology.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bansal JC, Deep K (2012) A modified binary particle swarm optimization for knapsack problems. Appl Math Comput 218:11042–11061
Berberler ME, Nuriyev UG (2010) A new heuristic algorithm for the one-dimensional cutting stock problem. Appl Comput Math 9(1):19–30
Cerny V (1985) A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45:41–51
Cherri AC, Arenales MN, Yanasse HH (2009) The one-dimensional cutting stock problems with usable leftover: a heuristic approach. Eur J Oper Res 196(3):897–908
Cherri AC, Arenales MN, Yanasse HH (2013) The usable leftover one-dimensional cutting stock problem—a priority-in-use heuristic. Int Trans Oper Res 20:189–199
Cherria AC, Arenalesb MN, Yanassec HH, Poldic KC, Viannad ACG (2014) The one-dimensional cutting stock problem with usable leftovers—A survey. Eur J Oper Res 236:395–402
Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. The MIT Press, Cambridge
Cuia Y, Yangb Y (2010) A heuristic for the one-dimensional cutting stock problem with usable leftover. Eur J Oper Res 204:245–250
Delorme M, Iori M, Martello S (2016) Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur J Oper Res 255:1–20
Eberhart RC, Kennedy J (2001) Swarm intelligence. A volume in the morgan kaufmann series in artificial intelligence. ISBN 978-1-55860-595-4
Fortin F-A, De Rainville F-M, Gardner M-A, Parizeau M, Gagné C (2012) DEAP—evolutionary algorithms made easy. J Mach Learn Res 13:2171–2175
Garey R, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. A series of books in the mathematical sciences, W. H. Freeman & Co. New York, NY, USA
Glover F, Srensen K (2015) Metaheuristics. Scholarpedia 10:4
Gurobi Optimization, Inc. (2015) Gurobi Optimizer Reference Manual. http://www.gurobi.com
Haessler RW, Sweeney PE (1991) Cutting stock problems and solution procedures. Eur J Oper Res 54:141–150
Jahromi MH, Tavakkoli-Moghaddam R, Makui A et al (2012) Solving an one-dimensional cutting stock problem by simulated annealing and tabu search. J Ind Eng Int 8:24
Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments—a survey. IEEE Trans Evolut Comput 9:303–317
Kartak VM, Ripatti AV, Scheithauer G, Kurz S (2015) Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. Discret Appl Math 187:120–129
Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680
Lopez Sanchez IA, Mora Vargas J, Santos CA, Gonzalez Mendoza M (2014) Solving binary cutting stock with matheuristics. In: Mexican International Conference on Artificial Intelligence
Lu HC, Huang YH, Tseng KA (2013) An integrated algorithm for cutting stock problems in the thin-film transistor liquid crystal display industry. Comput Ind Eng 64(4):1084–1092
Lu HC, Ko YC, Huang YH (2014) A note on “Reducing the number of binary variables in cutting stock problems”. Optim Lett 8(2):569–579
Metropolis N, Rosenbluth AW, Rosenbluth M, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087–1092
Michalak T, Rahwan T, Elkind E, Wooldridge M, Jennings NR (2016) A hybrid exact algorithm for complete set partitioning. Artif Intell 230:14–50
Mobasher A, Ekici A (2013) Solution approaches for the cutting stock problem with setup cost. Comput Op Res 40:225–235
Perone CS (2009) Pyevolve—a Python open-source framework for genetic algorithms. SIGEVOlution 4:12–20
Python Software Foundation. Python Language Reference, version 2.7. http://www.python.org
Acknowledgements
This research was supported by a grant from CONACyT.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
All authors declare that they have no conflicts of interest.
Ethical approval
This article does not contain any studies with human participants performed by any of the authors.
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Sanchez, I.A.L., Vargas, J.M., Santos, C.A. et al. Solving binary cutting stock with matheuristics using particle swarm optimization and simulated annealing. Soft Comput 22, 6111–6119 (2018). https://doi.org/10.1007/s00500-017-2666-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-017-2666-8