Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
Publications

Publications by José Fernando Oliveira

2016

A container loading algorithm with static mechanical equilibrium stability constraints

Authors
Galrao Ramos, AG; Oliveira, JF; Goncalves, JF; Lopes, MP;

Publication
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL

Abstract
The Container Loading Problem (CLP) literature has traditionally guaranteed cargo static stability by imposing the full support constraint for the base of the box. Used as a proxy for real-world static stability, this constraint excessively restricts the container space utilization and has conditioned the algorithms developed for this problem. In this paper we propose a container loading algorithm with static stability constraints based on the static mechanical equilibrium conditions applied to rigid bodies, which derive from Newton's laws of motion. The algorithm is a multi-population biased random-key genetic algorithm, with a new placement procedure that uses the maximal-spaces representation to manage empty spaces, and a layer building strategy to fill the maximal-spaces. The new static stability criterion is embedded in the placement procedure and in the evaluation function of the algorithm. The new algorithm is extensively tested on well-known literature benchmark instances using three variants: no stability constraint, the classical full base support constraint and with the new static stability constraint a comparison is then made with the state-of-the-art algorithms for the CLP. The computational experiments show that by using the new stability criterion it is always possible to achieve a higher percentage of space utilization than with the classical full base support constraint, for all classes of problems, while still guaranteeing static stability. Moreover, for highly heterogeneous cargo the new algorithm with full base support constraint outperforms the other literature approaches, improving the best solutions known for these classes of problems.

2016

A GRASP algorithm for the vehicle-reservation assignment problem

Authors
Oliveira, BB; Carravilla, MA; Oliveira, JF;

Publication
Lecture Notes in Economics and Mathematical Systems

Abstract

2016

A MIP model for production planning in the roasting coffee industry

Authors
Ospina, DY; Carravilla, MA; Oliveira, JF;

Publication
Lecture Notes in Economics and Mathematical Systems

Abstract

2016

A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

Authors
Galrao Ramos, AG; Oliveira, JF; Lopes, MP;

Publication
International Transactions in Operational Research

Abstract
The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints. © 2015 The Authors.

2016

A surveyonheuristics for the two-dimensional rectangular strip packing problem

Authors
Oliveira, JF; Neuenfeldt, A; Silva, E; Carravilla, MA;

Publication
Pesquisa Operacional

Abstract
Two-dimensional rectangular strip packing problems belong to the broader class of Cutting and Packing (C&P) problems, in which small items are required to be cut from or packed on a larger object, so that the waste (unused regions of the large object) is minimized. C&P problems differ from other combinatorial optimization problems by the intrinsic geometric constraints: items may not overlap and have to be fully contained in the large object. This survey approaches the specific C&P problem in which all items are rectangles, therefore fully characterized by a width and a height, and the large object is a strip, i.e. a rectangle with a fixed width but an infinite height, being the problem’s goal to place all rectangles on the strip so that the height is minimized. These problems have been intensively and extensively tackled in the literature and this paper will focus on heuristic resolution methods. Both the seminal and the most recent approaches (from the last decade) will be reviewed, in a rather tutorial flavor, and classified according to their type: constructive heuristics, improvement heuristics with search over sequences and improvement heuristics with search over layouts. Building on this review, research gaps are identified and the most interesting research directions pointed out. © 2016 Brazilian Operations Research Society.

2016

An agent-based approach to schedule crane operations in rail-rail transshipment terminals

Authors
Heshmati, S; Kokkinogenis, Z; Rossetti, RJF; Carravilla, MA; Oliveira, JF;

Publication
Lecture Notes in Economics and Mathematical Systems

Abstract

  • 1
  • 23