The generate-and-solve framework revisited: Generating by simulated annealing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7832 LNCS, Issue , 2013, Pages 262-273

  Saraiva, Rommel D ^a   Nepomuceno, Napoleão V ^b   Pinheiro, Plácido R ^b  

^a STATE UNIVERSITY OF CEARÁ   (Brazil)

^b UNIVERSITY OF FORTALEZA   (Brazil)

Author keywords

Combinatorial Optimization; Cutting and Packing; Hybrid Metaheuristics; Integer Programming; Simulated Annealing

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL EXPERIMENT; CONTAINER-LOADING PROBLEMS; CUTTING AND PACKING; CUTTING AND PACKING PROBLEM; HYBRID METAHEURISTICS; NON-GUILLOTINE CUTTING PROBLEMS; STATE-OF-THE-ART APPROACH;

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; LOADING; SIMULATED ANNEALING;

PROBLEM SOLVING;

EID: 84875111170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-37198-1_23     Document Type: Conference Paper

References (23)

1. Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds.): Hybrid Metaheuristics: An Emerging Approach to Optimization. SCI, vol. 114. Springer, Heidelberg (2008)
2. 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)
3. 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)
4. 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)
5. 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. EEE (2012)
6. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
7. 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)
8. Beasley, J.E.: A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research 156(3), 601-627 (2004)
9. 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)
10. 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)
11. Egeblad, J., Pisinger, D.: Heuristic approaches for the two- and three-dimensional knapsack packing problem. Computers & Operations Research 36(4), 1026-1049 (2009)
12. George, J.A., Robinson, D.F.: A heuristic for packing boxes into a container. Computers & Operations Research 7(3), 147-156 (1980)
13. 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)
14. Bischoff, E., Ratcliff, M.: Issues in the development of approaches to container loading. Omega 23(4), 377-390 (1995)
15. 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)
16. Gehring, H., Bortfeldt, A.: A genetic algorithm for solving the container loading problem. International Transactions in Operational Research 4(5-6), 401-418 (1997)
17. Bortfeldt, A., Gehring, H.: Ein tabu search-verfahren für containerbeladeprobleme mit schwach heterogenem kistenvorrat. OR Spektrum 20(1), 237-250 (1998)
18. Bortfeldt, A., Gehring, H.: A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research 131(1), 143-161 (2001)
19. Eley, M.: Solving container loading problems by block arrangement. European Journal of Operational Research 141(2), 393-409 (2002)
20. Liang, S., Lee, C., Huang, S.: A hybrid meta-heuristic for the container loading problem. Communications of the IIMA 7(4), 73-84 (2007)
21. 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)
22. Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33(1), 49-64 (1985)
23. Beasley, J.E.: OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society 41(11), 1069-1072 (1990)