Time-dependent routing

Lifting the performance of a heuristic for the time-dependent travelling salesman problem through machine learning

In recent years, there have been several attempts to use machine learning techniques to improve the performance of exact and approximate optimization algorithms. Along this line of research, the present paper shows how supervised and unsupervised techniques can be used …

Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows

In this paper we implement a branch-price and cut algorithm for a time dependent vehicle routing problem with time windows in which the goal is to minimize the total route duration. The travel time between two customers is given by …

Solving the time-dependent multi-trip vehicle routing problem with time windows and an improved travel speed model by a hybrid solution algorithm

© 2018, Springer Science+Business Media, LLC, part of Springer Nature.In this study, we explore a time-dependent multi-trip vehicle routing problem (TDMTVRP) with an improved travel speed model. This problem is set in a scenario that (a) a set of customers …

x
This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close