A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints

We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints. In this problem, the fleet of vehicles is categorized into regular and special vehicles. Some customers require both vehicles’ services, whose service start times at the custome...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research Jg. 124; S. 105085
Hauptverfasser:	Hà, Minh Hoàng, Nguyen, Tat Dat, Nguyen Duy, Thinh, Pham, Hoang Giang, Do, Thuy, Rousseau, Louis-Martin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 01.12.2020 Pergamon Press Inc
Schlagworte:	Adaptive large neighborhood search Algorithms Computing time Constraint modelling Constraint programming Customer services Customers Insertion Linear programming Operations research Route planning Run time (computers) Synchronization constraint Time synchronization Time window Vehicle routing Vehicle routing problem Vehicles Windows (intervals) Adaptive large neighborhood search Time window Vehicle routing problem Synchronization constraint Constraint programming
ISSN:	0305-0548, 0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!