Levi Ribeiro de Abreu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Levi Ribeiro de Abreu has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Bruno de Athayde Prata
Federal University of Ceará
14 shared publications - Marcelo Seido Nagano
University of São Paulo
10 shared publications Jose M. Framinan
4 shared publications- Heráclito Lopes Jaguaribe Pontes
Universidade Federal do Ceará
3 shared publications - Jônatas Breno Gomes Amarante
Universidade Federal do Ceará, Fortaleza, Ceará
2 shared publications Marcelo S. Nagano
University of São Paulo
2 shared publications
Latest Publications
- Open Access
- 6 October 2026
- Published by Elsevier in SSRN Electronic Journal
Multi-objective Storage Location Assignment: Balancing Correlation and Bin Heterogeneity
The Storage Location Assignment Problem (SLAP) is a fundamental challenge in warehouse operations, playing a crucial role in operational efficiency. It also directly influences order picking (OP), which alone accounts for a significant portion of total warehouse costs. While minimizing picker travel distance and time through data-driven strategies, such as correlated storage assignment, is common in the literature, these approaches often overlook high-density systems. Picker-to-parts warehouses that accommodate multiple products in the same location create bin heterogeneity, which is directly linked to intrabin searching time but frequently neglected in conventional SLAP studies. To address this gap, this research proposes a Multi-Objective framework for SLAP that jointly minimizes picker travel distance and time by maximizing item correlation, while reducing intralocation searching time by penalizing bin heterogeneity. The methodology uses historical order data and association-based methods to model item correlation, along with a tailored mixing index to address bin complexity. The resulting bi-objective storage optimization problem is solved using customized Multi-Objective Evolutionary Algorithms (MOEAs) and tested against different storage policies. This study distinguishes itself by leveraging real data from a footwear manufacturing company located in the province of Quebec, Canada, providing empirical evidence for practical solutions.
- 6 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessMulti-objective Storage Location Assignment: Balancing Correlation and Bin Heterogeneity
The Storage Location Assignment Problem (SLAP) is a fundamental challenge in warehouse operations, playing a crucial role in operational efficiency. It also directly influences order picking (OP), which alone accounts for a significant portion of total warehouse costs. While minimizing picker travel distance and time through data-driven strategies, such as correlated storage assignment, is common in the literature, these approaches often overlook high-density systems. Picker-to-parts warehouses that accommodate multiple products in the same location create bin heterogeneity, which is directly linked to intrabin searching time but frequently neglected in conventional SLAP studies. To address this gap, this research proposes a Multi-Objective framework for SLAP that jointly minimizes picker travel distance and time by maximizing item correlation, while reducing intralocation searching time by penalizing bin heterogeneity. The methodology uses historical order data and association-based methods to model item correlation, along with a tailored mixing index to address bin complexity. The resulting bi-objective storage optimization problem is solved using customized Multi-Objective Evolutionary Algorithms (MOEAs) and tested against different storage policies. This study distinguishes itself by leveraging real data from a footwear manufacturing company located in the province of Quebec, Canada, providing empirical evidence for practical solutions.
- Open Access
- 1 October 2026
- Published by Universidade Federal do Espirito Santo in Brazilian Journal of Production Engineering
- Vol. 12 (4) , 165-177
Aplicação do método 𝜌-mediana para localização de centros de distribuição: um estudo de caso em uma indústria alimentícia
En un entorno empresarial dinámico, la proximidad a los clientes es fundamental para las empresas que buscan optimizar los procesos logísticos y reforzar sus ventajas competitivas. El presente estudio tiene como objetivo identificar las mejores ubicaciones para tres centros de distribución (CD) en Ceará, destinados a una empresa del sector alimentario. Se tiene en cuenta el historial de demanda de 114 municipios del estado y los CD ya existentes en los municipios de Eusébio y Crato. La metodología utiliza el método de la mediana 𝜌 para identificar ubicaciones que minimicen los costes de distribución, equilibrando la distancia, el coste y el nivel de servicio. El modelo matemático busca optimizar la cadena de distribución, reduciendo los gastos operativos y aumentando la agilidad en las entregas. De este modo, Sobral, Quixeramobim y Limoeiro do Norte fueron señalados como los municipios más adecuados para la expansión. De este modo, la redistribución de las operaciones redujo en unos 1.263 reales el coste medio por tonelada transportada, mejorando el nivel de servicio para atender la creciente demanda de manera más eficiente.
- 1 October 2026
- Published by Universidade Federal do Espirito Santo in Brazilian Journal of Production Engineering
- Vol. 12 (4) , 165-177
Open AccessAplicação do método 𝜌-mediana para localização de centros de distribuição: um estudo de caso em uma indústria alimentícia
En un entorno empresarial dinámico, la proximidad a los clientes es fundamental para las empresas que buscan optimizar los procesos logísticos y reforzar sus ventajas competitivas. El presente estudio tiene como objetivo identificar las mejores ubicaciones para tres centros de distribución (CD) en Ceará, destinados a una empresa del sector alimentario. Se tiene en cuenta el historial de demanda de 114 municipios del estado y los CD ya existentes en los municipios de Eusébio y Crato. La metodología utiliza el método de la mediana 𝜌 para identificar ubicaciones que minimicen los costes de distribución, equilibrando la distancia, el coste y el nivel de servicio. El modelo matemático busca optimizar la cadena de distribución, reduciendo los gastos operativos y aumentando la agilidad en las entregas. De este modo, Sobral, Quixeramobim y Limoeiro do Norte fueron señalados como los municipios más adecuados para la expansión. De este modo, la redistribución de las operaciones redujo en unos 1.263 reales el coste medio por tonelada transportada, mejorando el nivel de servicio para atender la creciente demanda de manera más eficiente.
- 8 January 2026
- Published by Springer Nature in Annals of Operations Research
- Vol. 357 (2-3) , 803-835
A comparative computational study for single-machine problems with controllable processing times and limited resource consumption
- 8 January 2026
- Published by Springer Nature in Annals of Operations Research
- Vol. 357 (2-3) , 803-835
A comparative computational study for single-machine problems with controllable processing times and limited resource consumption
- 29 November 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 50 (5) , 45
A comparative computational study for parallel-machine problems with sustainable manufacturing constraints
- 29 November 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 50 (5) , 45
A comparative computational study for parallel-machine problems with sustainable manufacturing constraints
- Open Access
- 14 May 2025
- Published by Universidade Tecnologica Federal do Parana (UTFPR) in Revista Tecnologia e Sociedade
- Vol. 21 (63) , 332-350
Estimativa de medidas de desempenho de nível de serviço em um restaurante universitário por meio da simulação de eventos discretos
O nível de serviço de restaurantes pode ser medido por variáveis como o tempo de espera e o tamanho das filas de espera. Na prática, essas medidas de desempenho são difíceis de estimar devido à aleatoriedade da demanda de clientes. Neste artigo, foi proposto um modelo de simulação para estimar o impacto das intervenções operacionais em um restaurante universitário. Um modelo de simulação de eventos discretos foi desenvolvido e implementado no software Arena para representar as operações do restaurante universitário da Universidade Federal do Ceará, Brasil. Foram realizadas pesquisas de opinião e coleta de dados in loco para verificar a qualidade do modelo gerado. Além disso, foi proposto um conjunto de novos cenários de planejamento e alocação de recursos do estabelecimento, com base no conhecimento empírico e obtido pelo modelo da situação atual do restaurante. O modelo gerado foi capaz de representar o estado atual do empreendimento, e os cenários propostos indicaram uma melhoria significativa nas medidas de desempenho.
- 14 May 2025
- Published by Universidade Tecnologica Federal do Parana (UTFPR) in Revista Tecnologia e Sociedade
- Vol. 21 (63) , 332-350
Open AccessEstimativa de medidas de desempenho de nível de serviço em um restaurante universitário por meio da simulação de eventos discretos
O nível de serviço de restaurantes pode ser medido por variáveis como o tempo de espera e o tamanho das filas de espera. Na prática, essas medidas de desempenho são difíceis de estimar devido à aleatoriedade da demanda de clientes. Neste artigo, foi proposto um modelo de simulação para estimar o impacto das intervenções operacionais em um restaurante universitário. Um modelo de simulação de eventos discretos foi desenvolvido e implementado no software Arena para representar as operações do restaurante universitário da Universidade Federal do Ceará, Brasil. Foram realizadas pesquisas de opinião e coleta de dados in loco para verificar a qualidade do modelo gerado. Além disso, foi proposto um conjunto de novos cenários de planejamento e alocação de recursos do estabelecimento, com base no conhecimento empírico e obtido pelo modelo da situação atual do restaurante. O modelo gerado foi capaz de representar o estado atual do empreendimento, e os cenários propostos indicaram uma melhoria significativa nas medidas de desempenho.
- Open Access
- 20 January 2025
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Proceeding Series of the Brazilian Society of Computational and Applied Mathematics
- Vol. 11 (1) , 1-7
Exact methods for the parallel machines scheduling problem with identical machines, controllable processing times, and resource consumption
This paper aims to introduce a new variant of the identical parallel machines scheduling problem with controllable processing times and resource consumption. The performance measure is the minimization of makespan. We developed a mixed-integer linear programming (MILP) formulation and a constraint programming (CP) model. We conducted computational experiments using 2250 randomly generated test instances. The extensive computational experience of tested methods shows that the MILP model is promising for solving small-sized instances, and the CP model got the best average relative deviation and superior performance in large-sized instances.
- 20 January 2025
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC) in Proceeding Series of the Brazilian Society of Computational and Applied Mathematics
- Vol. 11 (1) , 1-7
Open AccessExact methods for the parallel machines scheduling problem with identical machines, controllable processing times, and resource consumption
This paper aims to introduce a new variant of the identical parallel machines scheduling problem with controllable processing times and resource consumption. The performance measure is the minimization of makespan. We developed a mixed-integer linear programming (MILP) formulation and a constraint programming (CP) model. We conducted computational experiments using 2250 randomly generated test instances. The extensive computational experience of tested methods shows that the MILP model is promising for solving small-sized instances, and the CP model got the best average relative deviation and superior performance in large-sized instances.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 20 (10) , 3089-3108
A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
This paper addresses a no-wait flowshop scheduling problem with total tardiness minimization. We present a mixed-integer linear programming formulation with positional decision variables and a new constraint programming model to solve the problem as exact approaches. As an alternative solution procedure, we develop an innovative Reactive Iterated Greedy (RIG) algorithm that presents a dynamic mechanism to adjust the number of jobs to be removed from the current permutation in the destruction phase. We carried out computational experiments on a set of 800 test instances available in the literature to evaluate the performance of the proposed RIG algorithm in comparison with five solution approaches (Mixed-Integer Linear Programming, Constraint Programming, Block Simulated Annealing, Variable Neighborhood Descent, and Iterated Greedy). The used performance criterion is the Relative Deviation Index (RDI). The RIG algorithm returned an average RDI of 5.0%, representing the best results among the solution procedures under comparison. Computational results pointed out that our proposal outperformed the mathematical model and other metaheuristics available in the literature with statistical significance.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 20 (10) , 3089-3108
A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
This paper addresses a no-wait flowshop scheduling problem with total tardiness minimization. We present a mixed-integer linear programming formulation with positional decision variables and a new constraint programming model to solve the problem as exact approaches. As an alternative solution procedure, we develop an innovative Reactive Iterated Greedy (RIG) algorithm that presents a dynamic mechanism to adjust the number of jobs to be removed from the current permutation in the destruction phase. We carried out computational experiments on a set of 800 test instances available in the literature to evaluate the performance of the proposed RIG algorithm in comparison with five solution approaches (Mixed-Integer Linear Programming, Constraint Programming, Block Simulated Annealing, Variable Neighborhood Descent, and Iterated Greedy). The used performance criterion is the Relative Deviation Index (RDI). The RIG algorithm returned an average RDI of 5.0%, representing the best results among the solution procedures under comparison. Computational results pointed out that our proposal outperformed the mathematical model and other metaheuristics available in the literature with statistical significance.
- 6 December 2023
- Published by Springer Nature in Operations Research Forum
- Vol. 4 (4) , 1-22
The Seeds of the NEH Algorithm: An Overview Using Bibliometric Analysis
- 6 December 2023
- Published by Springer Nature in Operations Research Forum
- Vol. 4 (4) , 1-22
The Seeds of the NEH Algorithm: An Overview Using Bibliometric Analysis
- Open Access
- 23 November 2023
- Published by Elsevier in Results in Control and Optimization
- Vol. 14
Applications of constraint programming in production scheduling problems: A descriptive bibliometric analysis
- 23 November 2023
- Published by Elsevier in Results in Control and Optimization
- Vol. 14
Open AccessApplications of constraint programming in production scheduling problems: A descriptive bibliometric analysis