Branch-and-price algorithm for the location-routing problem with time windows

•This study models the branch-and-price algorithm to solve the LRPTW to optimality.•The acceleration strategies have been developed to improve computational processes.•New test instances of the LRPTW, modified from literature are presented and expected to be the new benchmarks.•The effects and chara...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Transportation research. Part E, Logistics and transportation review Logistics and transportation review, 2016-02, Vol.86, p.1-19
Hauptverfasser:	Ponboon, Sattrawut, Qureshi, Ali Gul, Taniguchi, Eiichi
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Branch-and-price Column generation Cost engineering Effectiveness studies Exact solution Exact solutions Labeling algorithm Location analysis Location-routing problem Logistics Mathematical analysis Route optimization Shortest path algorithms Shortest-path problems Simplex method Time windows Transportation Transportation problem (Operations research) Windows (intervals)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!