Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
•We develop a branch-and-price algorithm for the truck and trailer routing problem with time windows.•We provide the first optimal solutions to several benchmark instances with 50 and 100 customers.•We propose an efficient adaptive large neighborhood search algorithm. Motivated by a situation faced...
Gespeichert in:
Veröffentlicht in: | Computers & operations research 2017-07, Vol.83, p.28-44 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!