A new branch-cut-and-price algorithm for the split delivery vehicle routing with time windows
Résumé
We present a new branch-cut-and-price algorithm for the split delivery vehicle routing problem with time windows. We devise a novel property of optimal solutions and take advantage from this information throughout the modelling. Our algorithm also uses several state-of-the-art techniques from the literature, known and new families of valid inequalities. Our algorithm establishes new start-of-the-art results for the problem.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|