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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 124; s. 105085
Hlavní autori:	Hà, Minh Hoàng, Nguyen, Tat Dat, Nguyen Duy, Thinh, Pham, Hoang Giang, Do, Thuy, Rousseau, Louis-Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.12.2020 Pergamon Press Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!