A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

Authors:
Ramón Alvarez-Valdés;Antonio Parajón;José Manuel Tamarit
Affiliations:
Department of Statistics and Operations Research, University of Valencia, Doctor Moliner 50, 46100 Burjassot Valencia, Spain;Department of Mathematics, National Autonomous University of Nicaragua, Nicaragua;Department of Statistics and Operations Research, University of Valencia, Doctor Moliner 50, 46100 Burjassot Valencia, Spain
Venue:
Computers and Operations Research
Year:
2002

Citing 5
Cited 11

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Best-first search methods for constrained two-dimensional cutting stock problems

Operations Research
Best-first search and dynamic programming methods for cutting problems: the cases of one or more stock plates

Computers and Industrial Engineering
An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock

Computers and Operations Research
Tabu Search

Tabu Search

Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study

Computers and Operations Research
Two-stage general block patterns for the two-dimensional cutting problem

Computers and Operations Research
T-shape homogenous block patterns for the two-dimensional cutting problem

Journal of Global Optimization
A heuristic dynamic programming algorithm for 2D unconstrained guillotine cutting

Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics
A recursive algorithm for constrained two-dimensional cutting problems

Computational Optimization and Applications
Smart container loading

Journal of Computational Methods in Sciences and Engineering - Special Supplement Issue in Section A and B: Selected Papers from the ISCA International Conference on Software Engineering and Data Engineering, 2009
Exact algorithms for the two-dimensional guillotine knapsack

Computers and Operations Research
Simple block patterns for the two-dimensional cutting problem

Mathematical and Computer Modelling: An International Journal
Simplest optimal cutting patterns for equal rectangles

Operations Research Letters
Optimal guillotine layout

Proceedings of the 2012 ACM symposium on Document engineering
New Hybrid Discrete PSO for Solving Non Convex Trim Loss Problem

International Journal of Applied Evolutionary Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

In response to market pressures resulting in increased competition, product proliferation and greater customization, firms in many industries have adopted modern technologies to provide operational flexibility on several dimensions. In this paper, we ...