- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- André R. S. Amaral
- Discrete Applied Mathematics
- 2009

Single row facility layout is the NP-hard problem of arranging n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. In this paper, we… (More)

- André R. S. Amaral
- European Journal of Operational Research
- 2006

We consider the layout problem of arranging a number of departments on a line. This problem is known as single row facility layout. The problem is very difficult to be solved. In fact, it has as a… (More)

- André R. S. Amaral
- Optimization Letters
- 2013

The double row layout problem is how to allocate a given set of n machines on both sides of a straight line corridor so that the total cost of transporting materials between machines is minimized.… (More)

- André R. S. Amaral
- Computers & OR
- 2012

The corridor allocation problem (CAP) seeks an arrangement of facilities along a central corridor defined by two horizontal lines parallel to the x-axis of a Cartesian coordinate system. The… (More)

- Dilip Datta, André R. S. Amaral, José Rui Figueira
- European Journal of Operational Research
- 2011

In this paper, a permutation-based genetic algorithm (GA) is applied to the NP-hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout… (More)

- André R. S. Amaral, Adam N. Letchford
- Math. Program.
- 2013

The single row facility layout problem (SRFLP) is the NP-hard problem of arranging facilities on a line, while minimizing a weighted sum of the distances between facility pairs. In this paper, a… (More)

- André R. S. Amaral
- Operations Research
- 2008

The one-dimensional facility layout problem is concerned with arranging n departments of given lengths on a line, while minimizing the weighted sum of the distances between all pairs of departments.… (More)

- André R. S. Amaral
- Computers & OR
- 2013

In this paper, we study a problem that occurs in the row layout of facilities. Among n facilities, suppose that there are t facilities with some characteristic in common so that they should be… (More)

- André R. S. Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González
- Electronic Notes in Discrete Mathematics
- 2008

Given a graph G=(V,E) on n vertices, the Minimum Linear Arrangement Problem (MinLA) calls for a one-to-one function ψ:V→{1,…,n} which minimizes ∑{i,j}∈E|ψ(i)−ψ(j)|. MinLA is strongly NP-hard and very… (More)

- Adam N. Letchford, André R. S. Amaral
- European Journal of Operational Research
- 2001

This paper is concerned with upper bounds for the well-known Pallet Loading Problem (PLP), which is the problem of packing identical boxes into a rectangular pallet so as to maximize the number of… (More)