A novel application of crossover operator to a hybrid optimization framework: Investigation into cutting problems

2012 IEEE Congress on Evolutionary Computation, CEC 2012

Volumn , Issue , 2012, Pages

  Saraiva, Rommel Dias ^a   Pinheiro, Plácido Rogério ^a,b  

^a STATE UNIVERSITY OF CEARÁ   (Brazil)

^b UNIVERSITY OF FORTALEZA   (Brazil)

Author keywords

Combinatorial Optimization; Cutting and Packing; Hybrid Methods; Uniform Order Based Crossover

Indexed keywords

BENCH-MARK PROBLEMS; COMPUTATIONAL EXPERIMENT; CROSSOVER OPERATOR; CUTTING AND PACKING; CUTTING AND PACKING PROBLEM; CUTTING PROBLEMS; HYBRID METHOD; HYBRID OPTIMIZATION; METAHEURISTIC; NON-GUILLOTINE CUTTING PROBLEMS; NOVEL APPLICATIONS; OPTIMIZATION PROBLEMS; UNIFORM ORDER-BASED CROSSOVER;

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING;

GENETIC ALGORITHMS;

EID: 84866872792     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2012.6256627     Document Type: Conference Paper

References (25)

1. A. B. de Aguiar, A. M. S. Neto, P. R. Pinheiro, A. L. V. Coelho, "Applicability of a novel integer programming model for wireless sensor networks," International Journal of Computer Science and Information Security, vol. 3, pp. 7-13, 2009.
2. A. B. de Aguiar, P. R. Pinheiro, A. L. V. Coelho, "On the concept of density control and its application to a hybrid optimization framework: investigation into cutting problems," Computers & Industrial Engineering, 2011, vol. 61, pp. 463-472, 2011.
3. A. Plateau, D. Tachat, P. Tolla, "A hybrid search combining interior point methods and metaheuristics for 0-1 programming," International Transactions in Operational Research, vol. 9, pp. 731-746, 2002.
4. D. E. Goldberg, "Genetic algorithms in search, optimization and machine learning," Reading: Addison Wesley, 1989.
5. E. Hadjiconstantinou, N. Christofides, "An exact algorithm for general, orthogonal, two-dimensional knapsack problems," European Journal of Operational Research, vol. 83, pp. 39-56, 1995
6. H. A. Taha, "Operations research: an introduction," 9th edition, Chapter 10.
7. I. Davis, "Order-Based Genetic Algorithms and the Graph Coloring Problem," Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, pp. 72-90, 1991.
8. J. C. Herz, "Recursive computational procedure for two-dimensional stock cutting," IBM Journal of Research and Development, vol. 16, pp. 462-469, 1972.
9. J. E. Beasley, "OR-Library: distributing test problems by eletronic mail," Journal of the Operational Research Society, vol. 41(11), pp. 1069-1072, 1990.
10. J. E. Beasley, "An exact two-dimensional non-guillotine cutting tree search procedure," Operations Research , vol. 33 , pp. 49-64, 1985.
11. J. E. Beasley, "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, vol. 156, pp. 601-627, 2004.
12. J. H. Holland, "Adaptation on natural and artificial systems," Ann Arbor, MIT Press, 1975.
13. J. Puchinger, G. Raidl, "Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification," Proceedings of the 1st International Work-Conference on the Interplay Between Natural and Artificial Computation, pp. 41-53, 2005.
14. J. Terno, J. R. Scheithauer, U. Sommerweiss, "An efficient approach for the multi-pallet loading problem," European Journal of Operational Research, vol. 123, pp. 372-381, 2000;
15. K. A. Dowsland, W. B. Dowsland, "Packing problems," European Journal of Operational Research, vol. 56, pp. 2-14, 1992.
16. L. J. P. Araújo, P. R. Pinheiro, "Applying backtracking heuristics for constrained two-dimensional guillotine cutting problems," Comunications in Computer and Information Science, vol. 106, pp. 252-259, 2010.
17. L. J. P. Araújo, P. R. Pinheiro, "Combining heuristics backtracking and genetic algorithm to solve the container loading problerm with weight distribution," Advances in Intelligent and Soft Computing, vol. 73, pp. 95-102, 2010.
18. L. J. P. Araújo, P. R. Pinheiro, "Applying heuristics on integer linear programming for solving the container loading problem," 42nd Brazilian Symposium of Operational Research, 2010.
19. N. V. Nepomuceno, P. R. Pinheiro, A. L. V. Coelho, "A hybrid optimization framework for cutting and packing problems: case study on constrained 2d non-guillotine cutting," Recent Advances in Evolutionary Computation for Combinatorial Optimization, pp. 87-99, 2008.
20. N. V. Nepomuceno, "Metaheuristic and integer linear programming: a hybrid methodology applied to the container loading problem," Master Thesis, Fortaleza, Brazil: University of Fortaleza, 2006.
21. N. V. Nepomuceno, P. R. Pinheiro, A. L. V. Coelho, "Tackling the container loading problem: a hybrid approach based on integer linear programming and genetic algorithms," Proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization,vol. 4446, pp. 154-165, 2007.
22. P. C. Chu, "A genetic algorithm approach for combinatorial optimization problems," PhD Thesis, University of London, 1997.
23. R. Morabito, S. Arenales, "Approaches to the container loading problem," Operations Research, vol. 17(1), pp. 29-56, 1997.
24. S. P. Fekete, J. Schepers, "A new exact algorithm for general orthogonal d-dimensional knapsack problems," Proceedings of the 5th annual european symposium on algorithms, pp. 144-156, 1997.
25. S. W. Mafoud, D. E. Goldberg, "Parallel recombinative simmulated annealing: a genetic algorithm," Parallel Computing, vol. 21(1), pp. 1-28, 1995.