Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Renato Elias Nunes de Moraes has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Reinforcement Learning–Guided General Variable Neighborhood Search for the Traveling Salesman Problem

    by Karina Assini Andreatta, Maria Claudia Silva Boeres, Renato Elias Nunes de Moraes

  • Open Access

    Joint Interference and Power Minimization for Fault-Tolerant Topology in Sensor Networks

    by Renato E. N. de Moraes, Yngrith S. Silva, Felipe N. Martins, Jair A. L. Silva, Helder R. O. Rocha

    Energy conservation is crucial in wireless ad hoc sensor network design to increase network lifetime. Since communication consumes a major part of the energy used by a sensor node, efficient communication is important. Topology control aims at achieving more efficient communication by dropping links and reducing interference among simultaneous transmissions by adjusting the nodes’ transmission power. Since dropping links make a network more susceptible to node failure, a fundamental problem in wireless sensor networks is to find a communication graph with minimum interference and minimum power assignment aiming at an induced topology that can satisfy fault-tolerant properties. In this paper, we examine and propose linear integer programming formulations and a hybrid meta-heuristic GRASP/VNS (Greedy Randomized Adaptive Search Procedure/Variable Neighborhood Search) to determine the transmission power of each node while maintaining a fault-tolerant network and simultaneously minimize the interference and the total power consumption. Optimal biconnected topologies for moderately sized networks with minimum interference and minimum power are obtained using a commercial solver. We report computational simulations comparing the integer programming formulations and the GRASP/VNS, and evaluate the effectiveness of three meta-heuristics in terms of the tradeoffs between computation time and solution quality. We show that the proposed meta-heuristics are able to find good solutions for sensor networks with up to 400 nodes and that the GRASP/VNS was able to systematically find the best lower bounds and optimal solutions.


  • Open Access

    Planning an Integrated Stockyard–Port System for Smart Iron Ore Supply Chains via VND Optimization

    by Álvaro D. O. Lopes, Helder R. O. Rocha, Marcos W. J. Servare Junior, Renato E. N. Moraes, Jair A. L. Silva, José L. F. Salles

    Stockyard–port planning is a complex combinatorial problem that has been studied primarily through simulation or optimization techniques. However, due to its classification as non-deterministic polynomial-time hard (NP-hard), the generation of optimal or near-optimal solutions in real time requires optimization techniques based on heuristics or metaheuristics. This paper proposes a deterministic simulation and a meta-heuristic algorithm to address the stockyard–port planning problem, with the aim of reducing the time that ships spend in berths. The proposed algorithm is based on the ore handling operations in a real stockyard–port terminal, considering the interaction of large physical equipment and information about the production processes. The stockyard–port system is represented by a graph in order to define ship priorities for planning and generation of an initial solution through a deterministic simulation. Subsequently, the Variable Neighborhood Descent (VND) meta-heuristic is used to improve the initial solution. The convergence time of VND ranged from 1 to 190 s, with the total number of ships served in the berths varying from 10 to 1000 units, and the number of stockyards and berths varying from 11 to 15 and 3 to 5, respectively. Simulation results demonstrate the efficiency of the proposed algorithm in determining the best allocation of stockpiles, berths, car-dumpers, and conveyor belts. The results also show that increasing the number of conveyor belts is an important strategy that decreases environmental impacts due to exposure of the raw material to the atmosphere, while also increasing the stockyard–port productivity. This positive impact is greater when the number yards and ship berths increases. The proposed algorithm enables real-time decision-making from small and large instances, and its implementation in an iron ore stockyard–port that uses Industry 4.0 principles is suitable.


  • Open Access

    Conceiving a Digital Twin for a Flexible Manufacturing System

    by Laurence C. Magalhães, Luciano C. Magalhães, Jhonatan B. Ramos, Luciano R. Moura, Renato E. N. de Moraes, João B. Gonçalves, Wilian H. Hisatugu, Marcelo T. Souza, Luis N. L. de Lacalle, João C. E. Ferreira

    Digitization and virtualization represent key factors in the era of Industry 4.0. Digital twins (DT) can certainly contribute to increasing the efficiency of various productive sectors as they can contribute to monitoring, managing, and improvement of a product or process throughout its life cycle. Although several works deal with DTs, there are gaps regarding the use of this technology when a Flexible Manufacturing System (FMS) is used. Existing work, for the most part, is concerned with simulating the progress of manufacturing without providing key production data in real-time. Still, most of the solutions presented in the literature are relatively expensive and may be difficult to implement in most companies, due to their complexity. In this work, the digital twin of an FMS is conceived. The specific module of an ERP (Enterprise Resources Planning) system is used to digitize the physical entity. Production data is entered according to tryouts performed in the FMS. Sensors installed in the main components of the FMS, CNC (computer numerical control) lathe, robotic arm, and pallet conveyor send information in real-time to the digital entity. The results show that simulations using the digital twin present very satisfactory results compared to the physical entity. In time, information such as production rate, queue management, feedstock, equipment, and pallet status can be easily accessed by operators and managers at any time during the production process, confirming the MES (manufacture execution system) efficiency. The low-cost hardware and software used in this work showed its feasibility. The DT created represents the initial step towards designing a metaverse solution for the manufacturing unit in question, which should operate in the near future as a smart and autonomous factory model.


  • A Reactive GRASP Algorithm for the Multi-depot Vehicle Routing Problem

    by Israel Pereira de Souza, Maria Claudia Silva Boeres, Renato Elias Nunes de Moraes, João Vinicius Corrêa Thompson


  • Power-efficient and interference-free link scheduling algorithms for connected wireless sensor networks

    by Renato E. N. Moraes, Welber W. F. dos Reis, Helder R. O. Rocha, Daniel J. C. Coura


  • Exact formulations for the minimum interference problem ink‐connectedad hocwireless networks

    by Renato E. N. Moraes, Celso C. Ribeiro, Glaydston M. Ribeiro

    Energy consumption is one of the most critical issues in wirelessad hocand sensor networks. A considerable amount of energy is dissipated due to radio transmission power and interference (message collisions). A typical topology control technique aims at reducing energy consumption while ensuring specific desired properties to the established wireless network (such as biconnectivity). Energy minimization can be achieved by reducing the transmission power and selecting edges that suffer or cause less interference. We propose four integer programming formulations for thek‐connected minimum wirelessad hocinterference problem, which consists in a topology control technique to find a power assignment to the nodes of anad hocwireless network such that the resulting network topology isk‐vertex connected and the radio interference is minimum. Interference is measured by three different models: Boolean, protocol, and physical. We report computational experiments comparing the formulations and interference models. Optimal solutions for moderately sized networks are obtained using a commercial solver.