关注
Carlo Sulzbach Sartori
Carlo Sulzbach Sartori
在 amazon.com 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
A study on the pickup and delivery problem with time windows: Matheuristics and new instances
CS Sartori, LS Buriol
Computers & Operations Research 124, 105065, 2020
262020
Scheduling truck drivers with interdependent routes under European Union regulations
CS Sartori, P Smet, G Vanden Berghe
European Journal of Operational Research, 2022
112022
A Matheuristic Approach to the Pickup and Delivery Problem with Time Windows
CS Sartori, LS Buriol
International Conference on Computational Logistics, 253-267, 2018
72018
Efficient Duration-Based Workload Balancing for Interdependent Vehicle Routes
CS Sartori, P Smet, G Vanden Berghe
21st Symposium on Algorithmic Approaches for Transportation Modelling …, 2021
42021
Instances for the Pickup and Delivery Problem with Time Windows based on open data
CS Sartori, L Buriol
Research dataset (Mendeley), 2020
32020
A Fix-and-Optimize VNS Algorithm Applied to the Nurse Rostering Problem
TI Wickert, CS Sartori, LS Buriol
6th International Workshop on Model-based Metaheuristics, 1-12, 2016
32016
Multi-depot periodic vehicle routing with variable visit patterns
V Gandra, CS Sartori, H Çalık, P Smet
Proceedings of the Genetic and Evolutionary Computation Conference Companion …, 2022
22022
Production scheduling with stock- and staff-related restrictions
CS Sartori, V Gandra Martins Santos, H Çalik, P Smet
International Conference on Computational Logistics 2021, 2021
22021
Scheduling hours of service for truck drivers with interdependent routes
CS Sartori, P Smet, G Vanden Berghe
Technical Report (KU Leuven), 2021
22021
Optimizing solutions for the pickup and delivery problem
CS Sartori
Bachelor's thesis in computer science (UFRGS), 2016
22016
Truck driver scheduling with interdependent routes and working time constraints
CS Sartori, P Smet, G Vanden Berghe
EURO Journal on Transportation and Logistics, 100092, 2022
12022
The pickup and delivery problem with time windows: algorithms, instances, and solutions
CS Sartori
Master's thesis in computer science (UFRGS), 2019
12019
A Radius-Based Approach for the Bi-Objective p-Center and p-Dispersion Problem
N De Walsche, CS Sartori, H Çalık
International Conference on Computational Logistics, 533-549, 2023
2023
Efficient algorithms for driver scheduling with interdependent routes
CS Sartori, G Vanden Berghe, P Smet
PhD thesis (KU Leuven), 2023
2023
Models and algorithms for simple disjunctive temporal problems
CS Sartori, P Smet, G Vanden Berghe
arXiv preprint arXiv:2302.02644, 2023
2023
Instâncias para roteamento de veículos usando dados abertos
CS Sartori, LS Buriol
Pesquisa Operacional para o Desenvolvimento 12, 1-11, 2020
2020
An Iterated Variable Neighborhood Descent Algorithm applied to the Pickup and Delivery Problem with Time Windows
CS Sartori, MW Friske, LS Buriol
Anais do XLIX Simpósio Brasileiro de Pesquisa Operacional, 3573 a 3580, 2017
2017
O Problema de Roteamento de Veículos com Múltiplos Depósitos e Janelas de Tempo
CS Sartori
Salão de Iniciação Científica (UFRGS), 2016
2016
系统目前无法执行此操作,请稍后再试。
文章 1–18