LCLuciano Costa

Luciano Costa

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Luciano Costa has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Evaluation of Artificial Intelligence Models for Prediction of Wind Energy Production: Systematic Literature Review based on Methodi Ordinatio 2.0

    by Maria Luiza Xavier de Holanda Cavalcanti, Lúcio Câmara e Silva, Luciano Costa, José Leão e Silva Filho, Lucimário Góis de Oliveira Silva, Fábio Sandro dos Santos

    This paper presents a systematic review of the literature on the application of Artificial Intelligence (AI) techniques in the wind energy sector, aiming to identify trends, challenges, and opportunities in this evolving field. The increasing demand for renewable energy sources, combined with advancements in AI technologies, has fueled research efforts focused on optimizing the performance and efficiency of wind energy systems. In this context, various AI approaches, including artificial neural networks, machine learning algorithms, and optimization techniques, have been explored to enhance energy production forecasting. To ensure a comprehensive analysis that accurately reflects the current state-of-the-art, this study investigates a consolidated timeframe from 2015 to 2026 using the Methodi Ordinatio 2.0 methodology. By ranking a rigorously filtered portfolio of 400 experimental articles based on annualized citation density and Journal Impact Factor, this approach prevents temporal bias against recent advancements. The review highlights a critical architectural transition in the field: the historical predominance of Recurrent Neural Networks (RNNs/LSTMs) and the current paradigm shift toward Attention-based mechanisms and Transformers, which demonstrate superior capabilities in handling long-term dependencies in volatile wind speed time series. The results indicate that while advancements in AI offer significant benefits for wind energy production, challenges persist regarding model complexity, data quality, and the need for stronger collaboration between academia and industry to enable large-scale implementation. Furthermore, this study identifies specific emerging trends, emphasizing the adaptation of Foundation Models for time-series forecasting, the critical need for Explainable AI (XAI) to ensure operational trust, and the trade-off between computational cost and accuracy in edge computing for wind farms.

  • Open Access

    Combining relax-and-fix and fix-and-optimize approaches to solve the Multi-Item Capacitated Lot-Sizing Problem with Unrelated Parallel Machines

    by Ricardo Lukas de Medeiros França, Leonardo Andrade Apolinário, Valdir Soares da Silva, Luciano Costa, Hugo Harry Kramer

  • Open Access

    The robust pickup and delivery problem with time windows

    by Alex Abreu, Maria Battarra, Luciano Costa, Pedro Munari

  • A two-phase method for layout optimization: The case of a referral cancer center in Latin America

    by Anderson Coutinho, Rafael Morais, Anand Subramanian, Matheus Silva, Oscar Porto, Luciano Costa

    This work proposes a two-phase approach for optimizing the layout of a referral cancer center in Latin America, which results from a collaboration between a university, in Brazil, and a consultancy company. The objective of the problem is to minimize the total transportation cost of patients, medical/non-medical staff, materials, and equipment. In the first phase, an integer programming model is used to assign departments to floors in such a way that the vertical transportation cost between departments is reduced. In the second phase, a heuristic method is employed to determine the layout of the blocks across a given floor, when applicable, while minimizing the transportation cost within the floor. Process mining is employed to gather data associated with the movement flow between rooms and departments within the unit. The developed approach was used by the managers of the cancer center to help design a new hospital building, and the layout produced by the optimization procedure was compared with the initial layout originally built by the architects of the hospital. The results obtained demonstrate that our method was capable of significantly reducing both vertical (\(-19.7\%\)) and horizontal (\(-22.7\%\)) transportation costs within the hospital.


  • Open Access

    A mixed-integer linear programming model for scheduling volunteers in technical support teams in Non-Governmental Organizations

    by Valdir Soares Silva Neto, Ricardo Lukas de Medeiros França, Keren Karolyne Nóbrega Silva, Luciano Carlos Azevedo da Costa, Hugo Harry F. R. Kramer

    The problem of allocating scarce resources is present in many daily decisions, at various levels, whether organizational or not. Institutions need to plan in detail how to distribute resources efficiently, especially when it comes to people and their skills and competencies in providing services. In this context, the aim of this study is to determine timetables for the volunteers of a technical support team in a non-governmental organization, considering the individual skills constraints of the volunteers and their respective availability. To solve the problem, a mathematical model is proposed whose objective is to allocate volunteers to tasks for which they have the greatest ability. The model ensures that the technical needs of the team are met, guaranteeing the allocation of specific numbers of volunteers to each role. The model also favors a balanced distribution of work among the volunteers. The results show that the proposed model can find optimal solutions in reduced computational time. The solutions generated by the proposed model are already being implemented and used in practice.


  • On the optimal layout of a dining room in the era of COVID‐19 using mathematical optimization

    by Claudio Contardo, Luciano Costa

    We consider the problem of maximizing the number of people that a dining room can accommodate provided that the chairs belonging to different tables are socially distant. We introduce an optimization model that incorporates several characteristics of the problem, namely: the type and size of surface of the dining room, the shapes and sizes of the tables, the positions of the chairs, the sitting sense of the customers, and the possibility of adding space separators to increase the capacity. We propose a simple, yet general, set‐packing formulation for the problem. We investigate the efficiency of space separators and the impact of considering the sitting sense of customers in the room capacity. We also perform an algorithmic analysis of the model, and assess its scalability to the problem size, the presence of (or lack thereof) room separators, and the consideration of the sitting sense of customers. We also propose two constructive heuristics capable of coping with large problem instances otherwise intractable for the optimization model.


  • Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows

    by Luciano Costa, Claudio Contardo, Guy Desaulniers, Julian Yarkony

    Column generation (CG) algorithms are well known to suffer from convergence issues due, mainly, to the degenerate structure of their master problem and the instability associated with the dual variables involved in the process. In the literature, several strategies have been proposed to overcome this issue. These techniques rely either on the modification of the standard CG algorithm or on some prior information about the set of dual optimal solutions. In this paper, we propose a new stabilization framework, which relies on the dynamic generation of aggregated rows from the CG master problem. To evaluate the performance of our method and its flexibility, we consider instances of three different problems, namely, vehicle routing with time windows (VRPTW), bin packing with conflicts (BPPC), and multiperson pose estimation (MPPEP). When solving the VRPTW, the proposed stabilized CG method yields significant improvements in terms of CPU time and number of iterations with respect to a standard CG algorithm. Huge reductions in CPU time are also achieved when solving the BPPC and the MPPEP. For the latter, our method has shown to be competitive when compared with a tailored method. Summary of Contribution: Column generation (CG) algorithms are among the most important and studied solution methods in operations research. CG algorithms are suitable to cope with large-scale problems arising from several real-life applications. The present paper proposes a generic stabilization framework to address two of the main issues found in a CG method: degeneracy in the master problem and massive instability of the dual variables. The newly devised method, called dynamic separation of aggregated rows (dyn-SAR), relies on an extended master problem that contains redundant constraints obtained by aggregating constraints from the original master problem formulation. This new formulation is solved in a column/row generation fashion. The efficacy of the proposed method is tested through an extensive experimental campaign, where we solve three different problems that differ considerably in terms of their constraints and objective function. Despite being a generic framework, dyn-SAR requires the embedded CG algorithm to be tailored to the application at hand.


  • Open Access

    On the optimal layout of a dining room in the era of COVID-19 using mathematical optimization

    by Claudio Contardo, Luciano Costa

    We consider the problem of maximizing the number of people that a dining room can accommodate provided that the chairs belonging to different tables are socially distant. We introduce an optimization model that incorporates several characteristics of the problem, namely: the type and size of surface of the dining room, the shapes and sizes of the tables, the positions of the chairs, the sitting sense of the customers, and the possibility of adding space separators to increase the capacity. We propose a simple, yet general, set-packing formulation for the problem. We investigate the efficiency of space separators and the impact of considering the sitting sense of customers in the room capacity. We also perform an algorithmic analysis of the model, and assess its scalability to the problem size, the presence of (or lack thereof) room separators, and the consideration of the sitting sense of customers. We also propose two constructive heuristics capable of coping with large problem instances otherwise intractable for the optimization model.

  • Selective arc‐ng pricing for vehicle routing

    by Luciano Costa, Claudio Contardo, Guy Desaulniers, Diego Pecin

    Column generation algorithms for solving vehicle routing problems often rely on a relaxed pricing subproblem where routes may be nonelementary and which is solved by a labeling algorithm. This pricing algorithm is said to be selective if it can discard nonelementary paths that may be Pareto‐optimal but guarantees finding at least one (not necessarily elementary) path of negative reduced cost when there exists at least one elementary path of negative reduced cost. In this paper, we propose a selective pricing mechanism for a recently introduced variant of the ng‐route relaxation, in which the neighborhoods are associated with arcs instead of nodes. We extend a state‐of‐the‐art set‐based dominance criterion for this problem and show, by means of an exhaustive computational campaign, that the resulting mechanism is effective at reducing the number of nondominated labels as compared to the original pricing algorithm for the same problem. As a result, typically shorter computing times are required to compute similar lower bounds when the proposed mechanism is embedded within a column generation solver.


  • Top Cited Papers

    Exact Branch-Price-and-Cut Algorithms for Vehicle Routing

    by Luciano Costa, Claudio Contardo, Guy Desaulniers

    Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes of VRPs are branch-price-and-cut algorithms. In this survey paper, we highlight the main methodological and modeling contributions made over the years on branch-and-price (branch-price-and-cut) algorithms for VRPs, whether they are generic or specific to a VRP variant. We focus on problems related to the classical VRP—that is, problems in which customers must be served by several capacitated trucks and which are not combinations of a VRP and another optimization problem.