The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
Sign Up to like & getrecommendations! Published in 2022 at "Networks"
DOI: 10.1002/net.22125
Abstract: In this article, we study the multi‐depot family traveling salesman problem (MDFTSP) and two clustered variants, the soft‐clustered MDFTSP (SC‐MDFTSP) and the hard‐clustered MDFTSP. We emphasize the relevance of this study by relating the problems… read more here.
Keywords: clustered variants; multi depot; family traveling; depot family ... See more keywords