An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands

•First Integer L-shaped method for the VRPTWSD under reactive and preventive returns.•New recursive equation to compute the recourse cost related to violated time windows.•Effective procedures to detect violated k-path inequalities and LBF cuts.•Preventive returns are advantageous and may result in...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 308; číslo 2; s. 676 - 695
Hlavní autori:	De La Vega, Jonathan, Gendreau, Michel, Morabito, Reinaldo, Munari, Pedro, Ordóñez, Fernando
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.07.2023
Predmet:	Fixed rule-based policy Integer L-shaped algorithm Routing Stochastic demand Time windows Time windows Routing Integer L-shaped algorithm Fixed rule-based policy Stochastic demand
ISSN:	0377-2217, 1872-6860
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!