Fernando A. C. C. Fontes

Learn More
We report on the development of a Decision Support System (DSS) to plan the best assignment for the weekly promotion space of a TV station. Each product to promote has a given target audience that is best reached at specific time periods during the week. The DSS aims to maximize the total viewing for each product within its target audience while fulfilling(More)
This note proposes a model predictive control (MPC) algorithm for the solution of a robust control problem for continuous-time systems. Discontinuous feedback strategies are allowed in the solution of the min–max problems to be solved. The use of such strategies allows MPC to address a large class of nonlinear systems, including among others nonholonomic(More)
A Biased Random Key Genetic Algorithm (BRKGA) is proposed to find solutions for the unit commitment problem. In this problem, one wishes to schedule energy production on a given set of thermal generation units in order to meet energy demands at minimum cost, while satisfying a set of technological and spinning reserve constraints. In the BRKGA, solutions(More)
In this work we address the Singe-Source Uncapacitated Minimum Cost Network Flow Problem with concave cost functions. Given that this problem is of a combinatorial nature and also that the total costs are nonlinear, we propose a hybrid heuristic to solve it. In this type of algorithms one usually tries to manage two conflicting aspects of searching(More)
In this work we address the Hop-Constrained Minimum cost Flow Spanning Tree (HMFST) problem with nonlinear costs. The HMFST problem is an extension of the Hop-Constrained Minimum Spanning Tree problem since it considers flow requirements other than unit flows. We propose a hybrid heuristic, based on Ant Colony Optimization (ACO) and on Local Search (LS), to(More)
There are certain optimal control problems with state constraints for which the standard versions of the necessary conditions of optimality are unable to provide information to select minimizers. In the recent years, there has been some literature on stronger forms of the maximum principle, the socalled nondegenerate necessary conditions, that are(More)
In this work we address the Single-Source Uncapacitated Minimum Cost Network Flow Problem with concave cost functions. This problem is NP-hard, therefore we propose a hybrid heuristic to solve it. Our goal is not only to apply an Ant Colony Optimization (ACO) algorithm to such a problem, but also to provide an insight on the behaviour of the parameters in(More)