#### Filter Results:

#### Publication Year

2003

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit
- Computers & OR
- 2008

This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite length so as to minimize the required length. We investigate several strategies for the constructive and improvement phases and several choices for… (More)

- Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit
- European Journal of Operational Research
- 2007

In this paper we study the two-dimensional non-guillotine cutting problem , the problem of cutting rectangular pieces from a large stock rectangle so as to maximize the total value of the pieces cut. The problem has many industrial applications whenever small pieces have to be cut from or packed into a large stock sheet. We propose a tabu search algorithm.… (More)

This paper presents a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional non-guillotine cutting problem , the problem of cutting the rectangular pieces from a large rectangle so as to maximize the value of the pieces cut. We investigate several strategies for the constructive and improvement phases and several choices… (More)

- Francisco Parreño, Ramón Alvarez-Valdés, José Manuel Tamarit, J. F. Oliveira
- INFORMS Journal on Computing
- 2008

In this paper a greedy randomized adaptive search procedure (GRASP) for the container loading problem is presented. This approach is based on a constructive block heuristic that builds upon the concept of maximal-space, a non-disjoint representation of the free space in a container. This new algorithm is extensively tested over the complete set of Bischoff… (More)

- Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit
- Computers & OR
- 2005

We propose a branch and cut algorithm for the Pallet Loading Problem. The 0-1 formulation proposed by Beasley for cutting problems is adapted to the problem, adding new constraints and new procedures for variable reduction. We then take advantage of the relationship between this problem and the maximum independent set problem to use the partial linear… (More)

- Francisco Parreño, Ramón Alvarez-Valdés, J. F. Oliveira, José Manuel Tamarit
- J. Heuristics
- 2010

This paper presents a Variable Neighborhood Search (VNS) algorithm for the container loading problem. The algorithm combines a constructive procedure based on the concept of maximal-space, with five new movements defined directly on the physical layout of the packed boxes, which involve insertion and deletion strategies. The new algorithm is tested on the… (More)

This paper presents a new heuristic algorithm for the pallet loading problem, the problem of packing the maximum number of identical rectangular boxes onto a rectangular pallet. The problem arises in distribution and logistics and has many practical applications. We have developed a tabu search algorithm based on new types of moves. Instead of moving… (More)

- Francisco Parreño, Ramón Alvarez-Valdés, J. F. Oliveira, José Manuel Tamarit
- Annals OR
- 2010

- Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit
- Computers & OR
- 2013

- Ricardo García-Ródenas, Máximo Almodóvar, Francisco Parreño
- EvoWorkshops
- 2009