Applying backtracking heuristics for constrained two-dimensional guillotine cutting problems

Authors:
Luiz Jonatã/;Piresde Araú/jo;Pl$#225/cido Rogé/rio Pinheiro
Affiliations:
Graduate Program in Applied Informatics, University of Fortaleza(UNIFOR), Fortaleza, Brazil;Graduate Program in Applied Informatics, University of Fortaleza(UNIFOR), Fortaleza, Brazil;Graduate Program in Applied Informatics, University of Fortaleza(UNIFOR), Fortaleza, Brazil
Venue:
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Year:
2011

Citing 7
Cited 0

Parallel recombinative simulated annealing: a genetic algorithm

Parallel Computing
Memetic algorithms: a short introduction

New ideas in optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Tackling the container loading problem: a hybrid approach based on integer linear programming and genetic algorithms

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
On the concept of density control and its application to a hybrid optimization framework: Investigation into cutting problems

Computers and Industrial Engineering
A unified view on hybrid metaheuristics

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Backtracking Heuristic (BH) methodology consists in to construct blocks of items by combination beetween heristics, that solve mathematical programming models, and backtrack search algorithm to figure out the best heuristics and their best ordering. BH has been re- cently introduced in the literature in order to solve three-dimensional Knapsack Loadin Problems, showing promising results. In the present Work we apply the same methodology to solve constrained two-dimensional Guillotine cutting problems. In order to assess the potentials of this novel ersion also for cutting problems, we conducted computational experiments on a set of difficult and well known benchmark instances.