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
Interest
Topics
Details

Details

  • Name

    José Fernando Gonçalves
  • Cluster

    Computer Science
  • Role

    Research Coordinator
  • Since

    01st April 2012
Publications

2018

An evolutionary approach to the maximum edge weight clique problem

Authors
Fontes, DBMM; Goncalves, JF; Fontes, FACC;

Publication
Recent Advances in Electrical and Electronic Engineering

Abstract
Background: This work addresses the maximum edge weight clique problem (MEWC), an important generalization of the well-known maximum clique problem. Methods: The MEWC problem can be used to model applications in many fields including broadband network design, computer vision, pattern recognition, and robotics. We propose a random key genetic algorithm to find good quality solutions for this problem. Computational experiments are reported for a set of benchmark problem instances derived from the DIMACS maximum clique instances. Results: The results obtained show that our algorithm is both effective and efficient, as for most of the problem instances tested, we were able to match the best-known solutions with very small computational time requirements. © 2018 Bentham Science Publishers.

2018

Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem

Authors
Chaves, AA; Goncalves, JF; Nogueira Lorena, LAN;

Publication
COMPUTERS & INDUSTRIAL ENGINEERING

Abstract
This paper proposes an adaptive Biased Random-key Genetic Algorithm (A-BRKGA), a new method with on-line parameter control for combinatorial optimization problems. A-BRKGA has only one problem-dependent component, the decoder and all other parts can be reused. To control diversification and intensification, a novel adaptive strategy for parameter tuning is introduced. This strategy is based on deterministic rules and self adaptive schemes. For exploitation of specific regions of the solution space we propose a local search in promising communities. The proposed method is evaluated on the Capacitated Centered Clustering Problem (CCCP), which is an NP-hard problem where a set of n points, each having a given demand, is partitioned into m clusters each with a given capacity. The objective is to minimize the sum of the Euclidean distances between the points and their geometric cluster centroids. Computational results show that the A-BRKGA with local search is competitive with other methods of literature.

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 biased random-key genetic algorithm for the minimization of open stacks problem

Authors
Goncalves, JF; Resende, MGC; Costa, MD;

Publication
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH

Abstract
This paper describes a biased random-key genetic algorithm (BRKGA) for the minimization of the open stacks problem (MOSP). The MOSP arises in a production system scenario, and consists of determining a sequence of cutting patterns that minimize the maximum number of open stacks during the cutting process. The proposed approach combines a BRKGA and a local search procedure for generating the sequence of cutting patterns. A novel fitness function for evaluating the quality of the solutions is also developed. Computational tests are presented using available instances taken from the literature. The high quality of the solutions obtained validate the proposed approach.

2016

Preface to the Special Issue on Cutting and Packing

Authors
Gomes, AM; Goncalves, JF; Alvarez Valdes, R; de Carvalho, JV;

Publication
International Transactions in Operational Research

Abstract

Supervised
thesis

2015

Analysis of cargo stability in container transportation

Author
António José Galrão Ramos

Institution
UP-FEUP

2015

e-commerce em saúde: big data e novas oportunidades de negócio - estudo sobre a telemedecina e venda de produtos de saúde na Wells

Author
Ana Marisa Ferreira Diegues

Institution
UP-FEP

2015

Otimização da performance de aatendimento numa receção de imagiologia

Author
Patrícia Alexandra Cordeiro Veiga

Institution
UP-FEP

2015

Um Algoritmo Genético Para O Planeamento De Rotas Com Considerações Ambientais

Author
Andreia Patrícia Ferreira Sousa

Institution
UP-FEP

2015

In-store Order Picking Routing: A Biased Random-Key Genetic Algorithm Approach

Author
Tiago Miguel Ferreira Das Neves Salgado

Institution
UP-FEP