Thiago André Guimarães

Prof. Dr. Thiago André Guimarães

Federal University of Paraná, Curitiba, Paraná, Brazil
+1
orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2019 in Computers & Operations Research
Verified
Journal Article
Closed access
TGThiago André Guimarães
Thiago André Guimarães
LCLeandro C. Coelho
Leandro C. Coelho
CSCleder M. Schenekemberg
Cleder M. Schenekemberg
CSCassius T. Scarpin
Cassius T. Scarpin

1 January 2021 in European Journal of Operational Research
Verified
Journal Article
Closed access
CSCleder M. Schenekemberg
Cleder M. Schenekemberg
CSCassius T. Scarpin
Cassius T. Scarpin
JPJosé E. Pécora
José E. Pécora
TGThiago André Guimarães
Thiago André Guimarães
LCLeandro C. Coelho
Leandro C. Coelho

18 March 2015 in Revista Brasileira de Inovação
Verified
Journal Article
Open access
PDF file
VPVictor Manoel Pelaez
Victor Manoel Pelaez
LSLetícia Rodrigues Da Silva
Letícia Rodrigues Da Silva
TGThiago André Guimarães
Thiago André Guimarães
FRFabiano Dal Ri
Fabiano Dal Ri
TTThomaz Teodorovicz
Thomaz Teodorovicz
A evolução da indústria de agrotóxicos no Brasil está ligada a políticas agrícolas e industriais voltadas, principalmente, ao estímulo do consumo desses insumos. As políticas para a criação de um parque produtivo nesse ramo de atividade foram insuficientes em função de limitações das políticas de substituição de importações e da lógica de alocação das unidades fabris das empresas multinacionais que controlam o mercado em nível mundial. A criação de um marco regulatório mais rígido dos agrotóxicos tem sido foco de tensão e desarticulação de políticas, devido à intensificação do consumo e demanda de pleitos de registro. O objetivo deste artigo é discutir a insuficiência ou a falta de coordenação de diferentes políticas que incidem sobre a indústria de agrotóxicos no Brasil. Propõe-se uma estratégia de coordenação voltada à promoção e combinação de condições de sustentabilidade e competitividade, tendo como foco o estímulo à inovação tecnológica.

14 April 2022 in Sustainability
Verified
Journal Article
Open access
PDF file
Luis André Wernecke FumagalliLuis André Wernecke Fumagalli
Luis André Wernecke Fumagalli
Denis Alcides RezendeDenis Alcides Rezende
Denis Alcides Rezende
TGThiago André Guimarães
Thiago André Guimarães
Transport infrastructure investments must be linked to the public transport demand strategically. User behavior and decision-making process bring several possible alternative transportation options due to a series of factors that define it. Municipalities must manage these factors to promote equal and sustainable transport solutions through urban infrastructure, public transport competitiveness, and attractiveness, and fossil fuels use and pricing policy. The research objective is to determine these factors to monitor and use them for citizens’ benefit by means of analytical tools and methods to gain a superior knowledge of reality with a focus on improving investments and services in an agile and efficient manner. Methodologically, the number of passengers of main Curitiba’s (Brazil) bus rapid transit (BRT) lines is operated in two linear regression models combined with the number of private vehicles, public transport fare, and fuel price for the period between January/2010 and December/2019. Research analysis indicates direct causal relationships between the studied factors and that the necessary data for decision-making is available in the government information systems. In conclusion, urban management and strategic digital city project can be more balanced and assertive in transport infrastructure investments and citizen services provision.

1 September 2020 in Computers & Operations Research
Verified
Journal Article
Closed access
CSCleder M. Schenekemberg
Cleder M. Schenekemberg
CSCassius T. Scarpin
Cassius T. Scarpin
JJJose Eduardo Pécora Jr
Jose Eduardo Pécora Jr
TGThiago André Guimarães
Thiago André Guimarães
LCLeandro C. Coelho
Leandro C. Coelho

16 August 2023 in Transportation Science
Verified
Journal Article
Closed access
CSCleder Marcos Schenekemberg
Cleder Marcos Schenekemberg
TGThiago André Guimarães
Thiago André Guimarães
ACAntonio Augusto Chaves
Antonio Augusto Chaves
LCLeandro C. Coelho
Leandro C. Coelho
Production and inventory routing problems consider a single-product supply chain operating under a vendor-managed inventory system. A plant creates a production plan and vehicle routes over a planning horizon to replenish its customers at minimum cost. In this paper, we present two- and three-index formulations, implement a branch-and-cut algorithm based on each formulation, and introduce a local search matheuristic-based algorithm to solve the problem. In order to combine all benefits of each algorithm, we design a parallel framework to integrate all three fronts, called the three-front parallel branch-and-cut algorithm (3FP-B&C). We assess the performance of our method on well-known benchmark instances of the inventory routing problem (IRP) and the production routing problem (PRP). The results show that our 3FP-B&C outperforms by far other approaches from the literature. For the 956 feasible small-size IRP instances, our method proves optimality for 746, being the first exact algorithm to solve all instances with up to two vehicles. 3FP-B&C finds 949 best known solutions (BKS) with 153 new BKS (NBKS). For the large-size set, our method provides two new optimal solutions (OPT), and finds 82% of BKS, being 70% of NBKS for instances with up to five vehicles. This result is more than twice the number of BKS considering all heuristic methods from the literature combined. Finally, our 3FP-B&C finds the best lower bounds (BLB) for 1,169/1,316 instances, outperforming all previous exact algorithms. On the PRP, our method obtained 278 OPT out of the 336 instances of benchmark set of small- and medium-size instances being 19 new ones in addition to 335 BKS (74 NBKS) and 313 BLB (52 new ones). On another set of PRP with medium- and large-size instances, our algorithm finds 1,105 BKS out of 1,440 instances with 584 NBKS. Besides that, our 3FP-B&C is the first exact algorithm to solve the instances with an unlimited fleet, providing the first lower bounds for this subset with an average optimality gap of 0.61%. We also address a very large-size instance set, the second exact algorithm to address this set, outperforming the previous approach by far. Finally, a comparative analysis of each front shows the gains of the integrated approach. History: This paper has been accepted for the Transportation Science Special Issue: DIMACS Implementation Challenge: Vehicle Routing. Funding: C. M. Schenekemberg was supported by the São Paulo Research Foundation (FAPESP) [Grant 2020/07145-8]. A. A. Chaves was supported by FAPESP [Grants 2018/15417-8 and 2016/01860-1] and Conselho Nacional de Desenvolvimento Científico e Tecnológico [Grants 312747/2021-7 and 405702/2021-3]. L. C. Coelho was supported by the Canadian Natural Sciences and Engineering Research Council [Grant 2019-00094]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0261 .