Waiting and rebalancing strategies in an urban waterborne transport environment

This thesis explores waiting and rebalancing strategies in urban waterborne transport, intending to improve the efficiency and operational performance of water transportation systems. The study is based on a review of the literature on waterborne transport and waiting and rebalancing strategies. This is followed by a case study where the found...

A greedy randomized destroy and repair heuristic for the dial-a-ride problem with transfers

Automated vehicles have the potential to create a future in which most cars are shared instead of being individually owned and used. The advantages of vehicle sharing are expected to be multiple: reduced traffic, freed-up parking space, safer trips and a lower environmental impact of traveling. The dial-a-ride problem with transfers (DARP-T)...

Optimal Cost Prediction in the Vehicle Routing Problem Through Supervised Learning

Machine learning techniques aim to train a model in such a way that it can approximate complex dynamics like the vehicle routing problem. In the recent years, combinatorial neural networks and deep learning methods have been used to predict the solution of routing problems. However, the approaches investigated so far in literature could be...