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

Full description

Saved in:

Bibliographic Details
Published in:	Operational research Vol. 22; no. 4; pp. 4253 - 4285
Main Authors:	Roohnavazfar, Mina, Pasandideh, Seyed Hamid Reza
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2022 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!