Abstract
The Generate-and-Solve is a hybrid framework to cope with hard combinatorial optimization problems by artificially reducing the search space of solutions. In this framework, a metaheuristic engine works as a generator of reduced instances of the problem. These instances, in turn, can be more easily handled by an exact solver to provide a feasible (optimal) solution to the original problem. This approach has commonly employed genetic algorithms and it has been particularly effective in dealing with cutting and packing problems. In this paper, we present an instantiation of the framework for tackling the constrained two-dimensional non-guillotine cutting problem and the container loading problem using a simulated annealing generator. We conducted computational experiments on a set of difficult benchmark instances. Results show that the simulated annealing implementation overachieves previous versions of the Generate-and-Solve framework. In addition, the framework is shown to be competitive with current state-of-the-art approaches to solve the problems studied here.
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
Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds.): Hybrid Metaheuristics: An Emerging Approach to Optimization. SCI, vol. 114. Springer, Heidelberg (2008)
Nepomuceno, N., Pinheiro, P., Coelho, A.L.V.: Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms. In: Cotta, C., van Hemert, J. (eds.) EvoCOP 2007. LNCS, vol. 4446, pp. 154–165. Springer, Heidelberg (2007)
Nepomuceno, N., Pinheiro, P., Coelho, A.L.V.: A Hybrid Optimization Framework for Cutting and Packing Problems: Case Study on Constrained 2D Non-guillotine Cutting. In: Cotta, C., van Hemert, J. (eds.) Recent Advances in Evolutionary Computation for Combinatorial Optimization. SCI, vol. 153, pp. 87–99. Springer, Heidelberg (2008)
Pinheiro, P.R., Coelho, A.L.V., de Aguiar, A.B., Bonates, T.O.: On the concept of density control and its application to a hybrid optimization framework: Investigation into cutting problems. Computers & Industrial Engineering 61(3), 463–472 (2011)
Saraiva, R.D., Pinheiro, P.R.: A novel application of crossover operator to a hybrid optimization framework: Investigation into cutting problems. In: CEC, pp. 1–7. IEEE (2012)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. European Journal of Operational Research 183(3), 1109–1130 (2007)
Beasley, J.E.: A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research 156(3), 601–627 (2004)
Valdes, R.A., Parreño, F., Tamarit, J.M.: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. The Journal of the Operational Research Society 56(4), 414–425 (2005)
Valdes, R.A., Parreño, F., Tamarit, J.M.: A tabu search algorithm for a two-dimensional non-guillotine cutting problem. European Journal of Operational Research 183(3), 1167–1182 (2007)
Egeblad, J., Pisinger, D.: Heuristic approaches for the two- and three-dimensional knapsack packing problem. Computers & Operations Research 36(4), 1026–1049 (2009)
George, J.A., Robinson, D.F.: A heuristic for packing boxes into a container. Computers & Operations Research 7(3), 147–156 (1980)
Loh, T.H., Nee, A.Y.C.: A packing algorithm for hexahedral boxes. In: Proceedings of the Conference of Industrial Automation, pp. 115–126 (1992)
Bischoff, E., Ratcliff, M.: Issues in the development of approaches to container loading. Omega 23(4), 377–390 (1995)
Bischoff, E.E., Janetz, F., Ratcliff, M.S.W.: Loading pallets with non-identical items. European Journal of Operational Research 84(3), 681–692 (1995)
Gehring, H., Bortfeldt, A.: A genetic algorithm for solving the container loading problem. International Transactions in Operational Research 4(5-6), 401–418 (1997)
Bortfeldt, A., Gehring, H.: Ein tabu search-verfahren für containerbeladeprobleme mit schwach heterogenem kistenvorrat. OR Spektrum 20(1), 237–250 (1998)
Bortfeldt, A., Gehring, H.: A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research 131(1), 143–161 (2001)
Eley, M.: Solving container loading problems by block arrangement. European Journal of Operational Research 141(2), 393–409 (2002)
Liang, S., Lee, C., Huang, S.: A hybrid meta-heuristic for the container loading problem. Communications of the IIMA 7(4), 73–84 (2007)
Yap, C., Lee, L., Majid, Z., Seow, H.: Ant colony optimization for container loading problem. Journal of Mathematics and Statistics 8(2), 169–175 (2012)
Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33(1), 49–64 (1985)
Beasley, J.E.: OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069–1072 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saraiva, R.D., Nepomuceno, N.V., Pinheiro, P.R. (2013). The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing. In: Middendorf, M., Blum, C. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2013. Lecture Notes in Computer Science, vol 7832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37198-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-37198-1_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37197-4
Online ISBN: 978-3-642-37198-1
eBook Packages: Computer ScienceComputer Science (R0)