Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints

This paper addresses a new variant of the multi-trip single vehicle routing problem where the nodes are related to each other through AND-type precedence constraints. The problem aims at determining a sequence of trips to visit all the nodes respecting every precedence constraint within and among th...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Operational research Ročník 22; číslo 4; s. 4253 - 4285
Hlavní autori:	Roohnavazfar, Mina, Pasandideh, Seyed Hamid Reza
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2022 Springer Nature B.V
Predmet:	Algorithms Benders decomposition Business and Management Computational Intelligence Integer programming Management Science Mixed integer Nodes Operations Research Operations Research/Decision Theory Optimization Original Paper Precedence constraints Route planning Vehicle routing AND-type precedence constraints Capacitated single vehicle routing problem Logic based benders decomposition algorithm Multiple trips
ISSN:	1109-2858, 1866-1505
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!