Algoritmi | User | Mário Manuel Silva Leite
Mário Manuel Silva Leite
Mário Manuel Silva Leite
At Algoritmi
Assistant Researcher with MSc
Member of the SEOR R&D Group
Academic Degree
MSc
Current Position
Invited Teaching Assistant at Escola de Engenharia da Universidade do Minho
Personal Webpage
Personal Email
maleite.cbc@gmail.comOrcid
0000-0002-9997-0722Researcher ID
Ciência ID
451D-583D-7B6Google Scholar
h-index
2Publications
5Editorial
0Citations
22Q1 / Q2
2About Me 
Mário Manuel Silva Leite is currently a doctoral research fellow by the Fundação para a Ciência e Tecnologia (FCT) with a research project entitled “Algoritmos de otimização combinatória para a gestão eficiente e sustentável de operações logísticas integradas / Combinatorial optimization algorithms for efficient and sustainable management of integrated logistics operations”. Consequently, he is part of the Doctoral Program in Industrial and Systems Engineering (DPISE) at the University of Minho (UM) and performs his duties as a researcher at the ALGORITMI Center of the UM School of Engineering. In 2017, he completed a Master's in Systems Engineering and, in 2015, a Degree in Computer Engineering, both at the University of Minho. In the 2018/2019 academic year, he served as an Invited Assistant in the UM Department of Production and Systems (DPS). His main areas of intervention are operational research, logistics, integrated processes of the supply chain, heuristics, and meta-heuristics, with scientific works published in co-authorship.
Publications (5)
Solving the integrated planning and scheduling problem using variable neighborhood search based algorithms
Expert Systems with Applications
2023 | journal-article
Optimization Algorithms for Integrated Processes in Industry 4.0
2020 IEEE International Conference on Technology Management, Operations and Decisions, ICTMOD 2020
2020 | conference-paper
A real-time optimization algorithm for the integrated planning and scheduling problem towards the context of industry 4.0
FME Transactions
2019 | journal-article
Variable neighborhood search for integrated planning and scheduling
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2017 | conference-paper
Improving selective collection of urban waste using a business intelligence system
Wastes: Solutions, Treatments and Opportunities - Selected Papers from the 3rd Edition of the International Conference on Wastes: Solutions, Treatments and Opportunities, 2015
2015 | conference-paper
Fundings (0)
No title available
No journal available
No publication date available
No title available
No journal available
No publication date available
No title available
No journal available
No publication date available
History
| Init | End | Change | Value |
|---|
Solving the integrated planning and scheduling problem using variable neighborhood search based algorithms
Expert Systems with Applications
2023 | journal-article
Optimization Algorithms for Integrated Processes in Industry 4.0
2020 IEEE International Conference on Technology Management, Operations and Decisions, ICTMOD 2020
2020 | conference-paper
A real-time optimization algorithm for the integrated planning and scheduling problem towards the context of industry 4.0
FME Transactions
2019 | journal-article
Variable neighborhood search for integrated planning and scheduling
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2017 | conference-paper
Improving selective collection of urban waste using a business intelligence system
Wastes: Solutions, Treatments and Opportunities - Selected Papers from the 3rd Edition of the International Conference on Wastes: Solutions, Treatments and Opportunities, 2015
2015 | conference-paper
No title available
No journal available
No publication date available
No title available
No journal available
No publication date available
No title available
No journal available
No publication date available
| Start | End | Term | Value | |
|---|---|---|---|---|
