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ženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 124; s. 105085
Hlavní autoři:	Hà, Minh Hoàng, Nguyen, Tat Dat, Nguyen Duy, Thinh, Pham, Hoang Giang, Do, Thuy, Rousseau, Louis-Martin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.12.2020 Pergamon Press Inc
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!