On the concept of density control and its application to a hybrid optimization framework: Investigation into cutting problems

Computers and Industrial Engineering

Volumn 61, Issue 3, 2011, Pages 463-472

  Pinheiro, Plácido R ^a   Coelho, André L V ^a   De Aguiar, Alexei B ^a   Bonates, Tibérius O ^a  

^a UNIVERSITY OF FORTALEZA   (Brazil)

Author keywords

Combinatorial optimization; Cutting and packing; Density control operator; Genetic algorithms; Hybrid metaheuristics; Integer programming

Indexed keywords

COMPUTATIONAL EXPERIMENT; CUTTING AND PACKING; CUTTING AND PACKING PROBLEM; CUTTING PROBLEMS; EXTENDED VERSIONS; HYBRID APPROACH; HYBRID METAHEURISTICS; HYBRID OPTIMIZATION; MATHEMATICAL PROGRAMMING PROBLEM; METAHEURISTIC; NON-GUILLOTINE CUTTING PROBLEMS; OPTIMIZATION PROBLEMS; PREMATURE CONVERGENCE;

COMBINATORIAL OPTIMIZATION; DENSITY CONTROL (SPECIFIC GRAVITY); GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION;

INTEGER PROGRAMMING;

EID: 80053211044     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.03.013     Document Type: Article

References (31)

1. R. Alvarez-Valdes, F. Parreo, and J.M. Tamarit A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems Journal of Operational Research Society 56 2005 414 425 (Pubitemid 40424117)
2. R. Alvarez-Valdes, F. Parreo, and J.M. Tamarit A tabu search algorithm for a two-dimensional non-guillotine cutting problem European Journal of Operational Research 183 2007 1167 1182 (Pubitemid 47030734)
3. T. Bäck, D. Fogel, and Z. Michalewicz Handbook of evolutionary computation 1997 IOP Publishing Ltd. Bristol, UK
4. J. Beasley An exact two-dimensional non-guillotine cutting tree search procedure Operations Research 33 1985 49 64 (Pubitemid 15475049)
5. J. Beasley A population heuristic for constrained two-dimensional non-guillotine cutting European Journal of Operational Research 156 2004 601 627
6. C. Blum, M.B. Aguilera, A. Roli, and M. Sampels Hybrid metaheuristics: An emerging approach to optimization Studies in computational intelligence Vol. 114 2008 Springer
7. C.-F. Chien, C.-Y. Lee, Y.-C. Huang, and W.-T. Wu An efficient computational procedure for determining the container-loading pattern Computers & Industrial Engineering 56 2009 965 978
8. Chu, P. (1997). A genetic algorithm approach for combinatorial optimization problems. Ph.D. thesis, University of London.
9. W. Cook, and P. Seymour Tour merging via branch-decomposition INFORMS Journal on Computing 15 2003 233 248 (Pubitemid 39042719)
10. de Aguiar, A.; Pinheiro, P.; & Coelho, A. (2007). Optimizing energy consumption in heterogeneous wireless sensor networks: A novel integer programming model. In Proceedings of the IV international conference on operational research for development (ICORD2007) (pp. 496-505).
11. A. de Aguiar, P. Pinheiro, A. Coelho, N. Nepomuceno, A.S. Neto, and R. Cunha Scalability analysis of a novel integer programming model to deal with energy consumption in heterogeneous wireless sensor networks L.T.H. An, B. Pascal, P.D. Tao, Computation and optimization in information systems and management sciences, second international conference, MCO 2008 2008 Springer 11 20
12. I. Dumitrescu, and T. Stützle Combinations of local search and exact algorithms G.R. Raidl, Applications of evolutionary computing Lecture notes in computer science Vol. 2611 2003 Springer-Verlag 211 223
13. J. Egeblad, and D. Pisinger Heuristic approaches for the two- and three-dimensional knapsack packing problem Computers & Operations Research 36 2009 1026 1049
14. A. Eiben, and J. Smith Introduction to evolutionary computing 2nd ed. 2007 Springer-Verlag
15. S. Fekete, and J. Schepers A new exact algorithm for general orthogonal d-dimensional knapsack problems R.E. Burkard, G.J. Woeginger, Algorithms - ESA '97, 5th annual european symposium Lecture notes in computer science Vol. 1284 1997 Springer-Verlag 144 156 (Pubitemid 127119226)
16. M. Fischetti, and A. Lodi Local branching Mathematical Programming 98 2003 23 47
17. C. Floudas, and P. Pardalos Encyclopedia of optimization 2nd ed. 2009 Springer
18. E. Hopper, and B. Turton A genetic algorithm for a 2D industrial packing problem Computers & Industrial Engineering 37 1999 375 378
19. ILOG (2003). ILOG CPLEX 9.0 User's manual.
20. T. Leung, C. Yung, and M. Troutt Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem Computers & Industrial Engineering 40 2001 201 214 (Pubitemid 32573624)
21. LINDO (2003). LINGO 8.0 users guide. LINDO Systems, Inc.; Chicago, USA.
22. B. Mahanty, R.K. Agrawal, S. Shrin, and S. Chakravarty Hybrid approach to optimal packing using genetic algorithm and Coulomb potential algorithm Materials and Manufacturing Processes 22 2007 668 677 (Pubitemid 46862211)
23. N. Nepomuceno, P. Pinheiro, and A. Coelho Tackling the container loading problem: A hybrid approach based on integer linear programming and genetic algorithms C. Cotta, J.I. van Hemert, Evolutionary computation in combinatorial optimization Lecture notes in computer science Vol. 4446 2007 Springer 154 165
24. N. Nepomuceno, P. Pinheiro, and A. Coelho A hybrid optimization framework for cutting and packing problems: Case study on constrained 2D non-guillotine cutting. Vol. Recent advances in evolutionary computation for combinatorial optimization of studies in computational intelligence 2008 Springer-Verlag pp. 87-99
25. J. Puchinger, and G. Raidl Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification J. Mira, J.R. Álvarez, Artificial intelligence and knowledge engineering applications: A bioinspired approach: First international work-conference on the interplay between natural and artificial computation, IWINAC 2005 Lecture notes in computer science Vol. 3562 2005 Springer 41 53 (Pubitemid 41425240)
26. G. Raidl A unified view on hybrid metaheuristics F. Almeida, M.J.B. Aguilera, C. Blum, J.M. Moreno-Vega, M.P. Pérez, A. Roli, Hybrid metaheuristics, third international workshop, HM 2006 Lecture notes in computer science Vol. 4030 2006 Springer 1 12 (Pubitemid 44577444)
27. P. Siarry, and Z. Michalewicz Advances in metaheuristics for hard optimization 2007 Springer
28. E.-G. Talbi A taxonomy of hybrid metaheuristics Journal of Heuristics 8 2002 541 564 (Pubitemid 34950326)
29. Vasquez, M.; & Hao, J.-K. (2001). A hybrid approach for the 0-1 multidimensional knapsack problem. In Proceedings of the international joint conference on artificial intelligence (IJCAI) (pp. 328-333).
30. L. Wolsey Integer Programming 1998 John Wiley & Sons
31. Yeung, H.; 2004. Hybrid genetic algorithm for cutting and packing problems. Master's thesis, City University of Hong Kong.