10h30 - 10h55
A dynamic programming based approach for a 3D tires loading problem
Tire manufacturers are currently spending a lot of time and effort on manually planning the load of delivery trucks. We will present a new approach based on dynamic programming that improves this process while capturing the 3D load constraints of very large tires.
10h55 - 11h20
Multimodal matching algorithm for ridesharing
Ridesharing enables people to share costs and reduce pollution. The present algorithm matches drivers and riders in order to maximize convenience for users in terms of detour and preferences. It aims to combine both ridesharing and public transportation and to offer fast solutions thanks to an effective data structure.
11h20 - 11h45
Parcel delivery with time windows
The presentation is about two mathematical approaches to solve TSPTW in postal environment. The first one is based on a time buckets implementation, whereas the second one involves constraint programming. The particularity of our problem also comes from the data, because many of the service points may not have any time window.