Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm.

Luís Gouveia Markus Leitner Mario Ruthmair

Published in: Transp. Sci. (2023)

Keyphrases

np hard
worst case
dynamic programming
objective function
computational complexity
search space
scheduling problem
upper bound
routing problem
optimal solution
cost function
simulated annealing
mathematical model
search strategy
benchmark problems