Thiago Alves de Queiroz
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
Thiago Alves de Queiroz has a total of 77 co-authors. Here are the top co-authors by number of shared publications:
- Flavio Keidi Miyazawa
University of Campinas
17 shared publications - Manuel Iori
DISMI University of Modena and Reggio Emilia Reggio Emilia Italy
14 shared publications - Vinícius Loti de Lima
Institute of Computing, University of Campinas, Campinas, Brazil
7 shared publications - Arthur Kramer
Federal University of Rio Grande do Norte
5 shared publications - Beatrice Bolsi
University of Modena and Reggio Emilia
5 shared publications Leandro Resende Mundim
University of São Paulo
5 shared publications
Latest Publications
- Open Access
- 17 November 2026
- Published by Wiley in International Transactions in Operational Research
A scenario‐based heuristic for a car patrolling problem with time windows and stochastic alarms
This paper addresses a stochastic variant of the car patrolling problem, in which unexpected alarms introduce uncertainty into route planning for private security services provided by a large Italian company. Each customer has different weekly demands (i.e., services), which can be optional or mandatory. Some services (i.e., alarms) are not known in advance and are thus treated as stochastic information. The company is concerned about providing an immediate response to alarms triggered during a patrol. The objective is to determine a set of patrol routes, one per day, that comply with several operational constraints, including hard time windows, maximum riding time, the minimum number of services performed, and the uncertainty regarding alarm triggers. Since our interest is in solving real‐world instances, we propose a scenario‐based iterated local search heuristic. It incorporates diverse operators, along with a local search and recourse function, to guide the search toward robust solutions. Computational experiments demonstrate that solutions that ignore unexpected alarms frequently deteriorate under stochastic evaluation, with losses exceeding 16% in some cases. In contrast, the proposed heuristic improves both robustness and solution quality, resulting in gains of up to 7% and reducing service cancellations. Further analysis demonstrates the sensitivity of solution performance to scenario diversity and sample size, highlighting the importance of carefully selecting scenarios that reflect alarm occurrences.
- 17 November 2026
- Published by Wiley in International Transactions in Operational Research
Open AccessA scenario‐based heuristic for a car patrolling problem with time windows and stochastic alarms
This paper addresses a stochastic variant of the car patrolling problem, in which unexpected alarms introduce uncertainty into route planning for private security services provided by a large Italian company. Each customer has different weekly demands (i.e., services), which can be optional or mandatory. Some services (i.e., alarms) are not known in advance and are thus treated as stochastic information. The company is concerned about providing an immediate response to alarms triggered during a patrol. The objective is to determine a set of patrol routes, one per day, that comply with several operational constraints, including hard time windows, maximum riding time, the minimum number of services performed, and the uncertainty regarding alarm triggers. Since our interest is in solving real‐world instances, we propose a scenario‐based iterated local search heuristic. It incorporates diverse operators, along with a local search and recourse function, to guide the search toward robust solutions. Computational experiments demonstrate that solutions that ignore unexpected alarms frequently deteriorate under stochastic evaluation, with losses exceeding 16% in some cases. In contrast, the proposed heuristic improves both robustness and solution quality, resulting in gains of up to 7% and reducing service cancellations. Further analysis demonstrates the sensitivity of solution performance to scenario diversity and sample size, highlighting the importance of carefully selecting scenarios that reflect alarm occurrences.
- Open Access
- 1 February 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 333 (2) , 337-348
A tree search-based heuristic for the three-dimensional single container loading problem
- 1 February 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 333 (2) , 337-348
Open AccessA tree search-based heuristic for the three-dimensional single container loading problem
- 3 January 2026
- Published by Springer Nature
- p. 329-340
A Hybrid Approach for Pallet Loading in Ceramic Tile Industry
- 3 January 2026
- Published by Springer Nature
- p. 329-340
A Hybrid Approach for Pallet Loading in Ceramic Tile Industry
- 11 October 2025
- Published by Springer Nature
- p. 353-362
Two-Dimensional Irregular Knapsack Problem with Defects from a Dynamic Textile Environment
- 11 October 2025
- Published by Springer Nature
- p. 353-362
Two-Dimensional Irregular Knapsack Problem with Defects from a Dynamic Textile Environment
- 23 September 2025
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (7) , 1-17
Models for the two-dimensional open-dimension rectangular packing problem
- 23 September 2025
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (7) , 1-17
Models for the two-dimensional open-dimension rectangular packing problem
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 890-897
Solving the Cubic Knapsack Problem using the Quantum-Inspired Digital Annealer Technology
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 890-897
Open AccessSolving the Cubic Knapsack Problem using the Quantum-Inspired Digital Annealer Technology
- Open Access
Exact Methods for the Split Delivery Vehicle Routing Problem With Two‐Dimensional Loading Constraints
The Split Delivery Vehicle Routing Problem with Two‐dimensional Loading Constraints (2L‐SDVRP) integrates vehicle routing, split delivery, and two‐dimensional packing constraints. In the 2L‐SDVRP, customers can be served by multiple vehicles, and their demands consist of different two‐dimensional rectangular items that must be packed in the vehicles' bases. The problem involves determining the least‐cost routes that satisfy all customer demands while ensuring the feasible packing of items in each vehicle. We present tailored branch‐and‐cut (BC) methods for solving the 2L‐SDVRP. One of the methods is based on an effective, relaxed two‐index vehicle flow formulation that is newly introduced in this paper. To evaluate the performance of the BC methods, computational experiments were conducted using both benchmark instances and new realistic instances inspired by cases from Brazilian logistics companies. The results indicate the superior performance of the method based on the two‐index formulation, which obtained optimal solutions for 14 more instances than the other approach on the benchmark instances. This method also performed better on newly created instances, improving solutions by 5.6% on average.
Open AccessExact Methods for the Split Delivery Vehicle Routing Problem With Two‐Dimensional Loading Constraints
The Split Delivery Vehicle Routing Problem with Two‐dimensional Loading Constraints (2L‐SDVRP) integrates vehicle routing, split delivery, and two‐dimensional packing constraints. In the 2L‐SDVRP, customers can be served by multiple vehicles, and their demands consist of different two‐dimensional rectangular items that must be packed in the vehicles' bases. The problem involves determining the least‐cost routes that satisfy all customer demands while ensuring the feasible packing of items in each vehicle. We present tailored branch‐and‐cut (BC) methods for solving the 2L‐SDVRP. One of the methods is based on an effective, relaxed two‐index vehicle flow formulation that is newly introduced in this paper. To evaluate the performance of the BC methods, computational experiments were conducted using both benchmark instances and new realistic instances inspired by cases from Brazilian logistics companies. The results indicate the superior performance of the method based on the two‐index formulation, which obtained optimal solutions for 14 more instances than the other approach on the benchmark instances. This method also performed better on newly created instances, improving solutions by 5.6% on average.
- Open Access
- 3 December 2024
- Published by Universidade Federal do Espirito Santo in Brazilian Journal of Production Engineering
- Vol. 10 (5) , 210-220
Otimização do transporte de pacientes em hospitais de grande porte
O presente trabalho lida com o problema de coleta e entrega de pacientes entre unidades distintas de um mesmo hospital, que particularmente surge em hospitais que ocupam uma grande área geográfica e, por isso, possuem diversos pavilhões com serviços distintos entre si. O problema considera uma frota de veículos, cada qual com capacidade de transporte limitada. As solicitações para o transporte de pacientes são recebidas ao longo do dia e são completamente desconhecidas até a sua emissão. O objetivo do problema é determinar rotas, atualizadas de forma dinâmica, para cada veículo de modo que o atraso total ponderado associado ao atendimento das solicitações seja mínimo. A proposta deste trabalho envolve uma heurística de reotimização baseada em políticas que observam características dos pacientes e do hospital, além de uma metaheurística de busca tabu. A heurística fornece soluções satisfatórias para o problema sobre instâncias de diferentes tamanhos.
- 3 December 2024
- Published by Universidade Federal do Espirito Santo in Brazilian Journal of Production Engineering
- Vol. 10 (5) , 210-220
Open AccessOtimização do transporte de pacientes em hospitais de grande porte
O presente trabalho lida com o problema de coleta e entrega de pacientes entre unidades distintas de um mesmo hospital, que particularmente surge em hospitais que ocupam uma grande área geográfica e, por isso, possuem diversos pavilhões com serviços distintos entre si. O problema considera uma frota de veículos, cada qual com capacidade de transporte limitada. As solicitações para o transporte de pacientes são recebidas ao longo do dia e são completamente desconhecidas até a sua emissão. O objetivo do problema é determinar rotas, atualizadas de forma dinâmica, para cada veículo de modo que o atraso total ponderado associado ao atendimento das solicitações seja mínimo. A proposta deste trabalho envolve uma heurística de reotimização baseada em políticas que observam características dos pacientes e do hospital, além de uma metaheurística de busca tabu. A heurística fornece soluções satisfatórias para o problema sobre instâncias de diferentes tamanhos.
- 24 October 2024
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 48 (4) , 1-28
Algorithms for the bin packing problem with scenarios
- 24 October 2024
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 48 (4) , 1-28
Algorithms for the bin packing problem with scenarios
- Open Access
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1201-1209
Optimizing a Car Patrolling Application by Iterated Local Search
We address a car patrolling application arising in a service company that needs to visit customers in a large area periodically. Customers are divided into clusters, each of which is assigned to a single patrol and requires different services, either mandatory or optional, on a weekly basis. The services have to be performed by satisfying several operational constraints, including interdependent time windows and maximum route duration. The aim is to maximize a weighted function that combines the profit collected from the optional services and the total working time required to perform all routes. The resulting optimization problem can be represented as a territory design and multi-period team orienteering problem. We solve the problem using an Iterated Local Search that invokes several inner procedures, including dedicated heuristics for creating the initial clusters, perturbation operators to diversify the search, and a variable neighborhood descent to search for good-quality routes. Extensive computational tests on a set of real-world instances involving up to a few hundred customers and a few thousand services prove the algorithm efficiency.
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1201-1209
Open AccessOptimizing a Car Patrolling Application by Iterated Local Search
We address a car patrolling application arising in a service company that needs to visit customers in a large area periodically. Customers are divided into clusters, each of which is assigned to a single patrol and requires different services, either mandatory or optional, on a weekly basis. The services have to be performed by satisfying several operational constraints, including interdependent time windows and maximum route duration. The aim is to maximize a weighted function that combines the profit collected from the optional services and the total working time required to perform all routes. The resulting optimization problem can be represented as a territory design and multi-period team orienteering problem. We solve the problem using an Iterated Local Search that invokes several inner procedures, including dedicated heuristics for creating the initial clusters, perturbation operators to diversify the search, and a variable neighborhood descent to search for good-quality routes. Extensive computational tests on a set of real-world instances involving up to a few hundred customers and a few thousand services prove the algorithm efficiency.